Displaying similar documents to “Overtaker binary relations on complete completely distributive lattices related to the level sets of the L-Fuzzy sets.”

Fuzzy sets (in)equations with a complete codomain lattice

Vanja Stepanović, Andreja Tepavčević (2022)

Kybernetika

Similarity:

The paper applies some properties of the monotonous operators on the complete lattices to problems of the existence and the construction of the solutions to some fuzzy relational equations, inequations, and their systems, taking a complete lattice for the codomain lattice. The existing solutions are extremal - the least or the greatest, thus we prove some extremal problems related to fuzzy sets (in)equations. Also, some properties of upper-continuous lattices are proved and applied to...

Lattice valued intuitionistic fuzzy sets

Tadeusz Gerstenkorn, Andreja Tepavĉević (2004)

Open Mathematics

Similarity:

In this paper a new definition of a lattice valued intuitionistic fuzzy set (LIFS) is introduced, in an attempt to overcome the disadvantages of earlier definitions. Some properties of this kind of fuzzy sets and their basic operations are given. The theorem of synthesis is proved: For every two families of subsets of a set satisfying certain conditions, there is an lattice valued intuitionistic fuzzy set for which these are families of level sets.

Equivalent fuzzy sets

Branimir Šešelja, Andreja Tepavčević (2005)

Kybernetika

Similarity:

Necessary and sufficient conditions under which two fuzzy sets (in the most general, poset valued setting) with the same domain have equal families of cut sets are given. The corresponding equivalence relation on the related fuzzy power set is investigated. Relationship of poset valued fuzzy sets and fuzzy sets for which the co-domain is Dedekind-MacNeille completion of that posets is deduced.

The study of the L-fuzzy concept lattice.

Ana Burusco Juandeaburre, Ramón Fuentes-González (1994)

Mathware and Soft Computing

Similarity:

The L-Fuzzy concept theory that we have developed sets up classifications from the objects and attributes of a context through L-Fuzzy relations. This theory generalizes the formal concept theory of R. Wille. In this paper we begin with the L-Fuzzy concept definition that generalizes the definitions of the formal concept theory, and we study the lattice structure of the L-Fuzzy concept set, giving a constructive method for calculating this lattice. At the end, we apply this constructive...

Generalized version of the compatibility theorem. Two examples.

Carlo Bertoluzza, Antonella Bodini (1996)

Mathware and Soft Computing

Similarity:

In a previous work ([3]) we proved that the Nguyen's condition for [f(tilde-A)] to be equal to f(A) also holds for the most general class of the L-fuzzy subsets, where L is an arbitrary lattice. Here we recall the main points of the proof ad present some examples ralated to non-linear lattices.