Displaying similar documents to “Generating of a class of lattices and its application”

Lattices of fuzzy objects.

Sangalli, Arturo A.L. (1996)

International Journal of Mathematics and Mathematical Sciences

Similarity:

The embedding of the formal concept analysis into the L-Fuzzy concept theory.

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

Mathware and Soft Computing

Similarity:

In this work, we study the relation between the concept lattice of Wille ([5], [6]) and the L-Fuzzy concept lattice ([2]) developed by us. To do it, we have defined an application g that associates to each concept of Wille an L-Fuzzy concept. The main point of this work is to prove that if we are working with a crisp relation between an object set and an attribute set, the concept lattice of Wille is a sublattice of the L-Fuzzy concept lattice. At the end, we show a typical example in...

B-almost distributive fuzzy lattice

Berhanu Assaye, Mihret Alemneh, Gerima Tefera (2018)

Bulletin of the Section of Logic

Similarity:

The paper introduces the concept of B-Almost distributive fuzzy lattice (BADFL) in terms of its principal ideal fuzzy lattice. Necessary and sufficient conditions for an ADFL to become a B-ADFL are investigated. We also prove the equivalency of B-algebra and B-fuzzy algebra. In addition, we extend PSADL to PSADFL and prove that B-ADFL implies PSADFL.

A T-partial order obtained from T-norms

Funda Karaçal, M. Nesibe Kesicioğlu (2011)

Kybernetika

Similarity:

A partial order on a bounded lattice L is called t-order if it is defined by means of the t-norm on L . It is obtained that for a t-norm on a bounded lattice L the relation a ⪯ T b iff a = T ( x , b ) for some x ∈ L is a partial order. The goal of the paper is to determine some conditions such that the new partial order induces a bounded lattice on the subset of all idempotent elements of L and a complete lattice on the subset A of all elements of L which are the supremum of a subset of atoms.

Classification systems and their lattice

Sándor Radeleczki (2002)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

We define and study classification systems in an arbitrary CJ-generated complete lattice L. Introducing a partial order among the classification systems of L, we obtain a complete lattice denoted by Cls(L). By using the elements of the classification systems, another lattice is also constructed: the box lattice B(L) of L. We show that B(L) is an atomistic complete lattice, moreover Cls(L)=Cls(B(L)). If B(L) is a pseudocomplemented lattice, then every classification system of L is independent...