representation theorems of $L-$subsets and $L-$families on complete residuated lattice
Authors
Abstract:
In this paper, our purpose is twofold. Firstly, the tensor andresiduum operations on $L-$nested systems are introduced under thecondition of complete residuated lattice. Then we show that$L-$nested systems form a complete residuated lattice, which isprecisely the classical isomorphic object of complete residuatedpower set lattice. Thus the new representation theorem of$L-$subsets on complete residuated lattice is obtained. Secondly, weintroduce the concepts of $L-$family and the system of $L-$subsets,then with the tool of the system of $L-$subsets, we obtain therepresentation theorem of intersection-preserving $L-$families oncomplete residuated lattice.
similar resources
representation theorems of $l-$subsets and $l-$families on complete residuated lattice
in this paper, our purpose is twofold. firstly, the tensor andresiduum operations on $l-$nested systems are introduced under thecondition of complete residuated lattice. then we show that$l-$nested systems form a complete residuated lattice, which isprecisely the classical isomorphic object of complete residuatedpower set lattice. thus the new representation theorem of$l-$subsets on complete re...
full text(L, e)-filters on complete residuated lattices
We introduce the notion of (L, e)-filters with fuzzy partially order e on complete residuated lattice L. We investigate (L, e)-filters induced by the family of (L, e)-filters and functions. In fact, we study the initial and final structures for the family of (L, e)-filters and functions. From this result, we define the product and co-product for the family of (L, e)-filters and functions.
full textL-pre-separation axioms in (2, L)-topologies based on complete residuated lattice-valued logic
In the present paper we introduce and study L-pre-T0-, L-pre-T1-, L-pre-T2 (L-pre-Hausdorff)-, L-pre-T3 (L-preregularity)-, L-pre-T4 (L-pre-normality)-, L-pre-strong-T3-, L-pre-strong-T4-, L-pre-R0-, L-pre-R1-separation axioms in (2, L)-topologies where L is a complete residuated lattice. Sometimes we need more conditions on L such as the completely distributive law or that the ”∧” is distribut...
full textGENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED
The present paper has been an attempt to investigate the general fuzzy automata on the basis of complete residuated lattice-valued ($L$-GFAs). The study has been chiefly inspired from the work by Mockor cite{15, 16, 17}. Regarding this, the categorical issue of $L$-GFAs has been studied in more details. The main issues addressed in this research include: (1) investigating the relationship betwe...
full textON THE SYSTEM OF LEVEL-ELEMENTS INDUCED BY AN L-SUBSET
This paper focuses on the relationship between an $L$-subset and the system of level-elements induced by it, where the underlying lattice $L$ is a complete residuated lattice and the domain set of $L$-subset is an $L$-partially ordered set $(X,P)$. Firstly, we obtain the sufficient and necessary condition that an $L$-subset is represented by its system of level-elements. Then, a new representat...
full textTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
full textMy Resources
Journal title
volume 10 issue 3
pages 125- 136
publication date 2013-06-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023