scholarly journals On (finite) distributive lattices with antitone involutions

10.29007/81mc ◽  
2018 ◽  
Author(s):  
Jan Kühr ◽  
Michal Botur
Keyword(s):  
Distributive Lattices ◽  
Direct Products ◽  
Natural Conditions ◽  
Finite Distributive Lattices ◽  
Mv Algebras

Finite distributive lattices with antitone involutions (= basic algebras) are studied; it is proved that their underlying lattices are isomorphic to direct products of finite chains, and hence finite distributive basic algebras can be constructed by “perturbing” finite MV-algebras, and moreover, under certain natural conditions, they even coincide with finite MV-algebras.

scholarly journals Priestley duality for MV-algebras and beyond

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Wesley Fussner ◽  
Mai Gehrke ◽  
Samuel J. van Gool ◽  
Vincenzo Marra
Keyword(s):  
Large Class ◽  
Order Conditions ◽  
Enriched Environment ◽  
Priestley Duality ◽  
Distributive Lattices ◽  
First Order ◽  
Dual Spaces ◽  
Binary Operations ◽  
New Perspective ◽  
Mv Algebras

Abstract We provide a new perspective on extended Priestley duality for a large class of distributive lattices equipped with binary double quasioperators. Under this approach, non-lattice binary operations are each presented as a pair of partial binary operations on dual spaces. In this enriched environment, equational conditions on the algebraic side of the duality may more often be rendered as first-order conditions on dual spaces. In particular, we specialize our general results to the variety of MV-algebras, obtaining a duality for these in which the equations axiomatizing MV-algebras are dualized as first-order conditions.

scholarly journals The Central Decomposition of FD01(n)

Order ◽  
2021 ◽  
Author(s):  
Peter Köhler
Keyword(s):  
Distributive Lattices ◽  
Finitely Generated ◽  
Finite Distributive Lattices

AbstractThe paper presents a method of composing finite distributive lattices from smaller pieces and applies this to construct the finitely generated free distributive lattices from appropriate Boolean parts.

scholarly journals Congruence Representations of Join-homomorphisms of Finite Distributive Lattices: Size and Breadth

2000 ◽  
Vol 68 (1) ◽  
pp. 85-103 ◽  
Author(s):  
G. Grätzer ◽  
H. Lakser ◽  
E. T. Schmidt
Keyword(s):  
Distributive Lattices ◽  
Irreducible Elements ◽  
Finite Lattices ◽  
Congruence Lattices ◽  
Finite Distributive Lattices

AbstractLet K and L be lattices, and let ϕ be a homomorphism of K into L.Then ϕ induces a natural 0-preserving join-homomorphism of Con K into Con L.Extending a result of Huhn, the authors proved that if D and E are finite distributive lattices and ψ is a 0-preserving join-homomorphism from D into E, then D and E can be represented as the congruence lattices of the finite lattices K and L, respectively, such that ψ is the natural 0-preserving join-homomorphism induced by a suitable homomorphism ϕ: K → L. Let m and n denote the number of join-irreducible elements of D and E, respectively, and let k = max (m, n). The lattice L constructed was of size O(22(n+m)) and of breadth n+m.We prove that K and L can be constructed as ‘small’ lattices of size O(k5) and of breadth three.

scholarly journals Residuation in non-associative MV-algebras

2018 ◽  
Vol 68 (6) ◽  
pp. 1313-1320
Author(s):  
Ivan Chajda ◽  
Helmut Länger
Keyword(s):  
Binary Operation ◽  
Residuated Lattice ◽  
Natural Question ◽  
Natural Conditions ◽  
Double Negation ◽  
Mv Algebra ◽  
Residuated Poset ◽  
Double Negation Law ◽  
Mv Algebras

Abstract It is well known that every MV-algebra can be converted into a residuated lattice satisfying divisibility and the double negation law. In a previous paper the first author and J. Kühr introduced the concept of an NMV-algebra which is a non-associative modification of an MV-algebra. The natural question arises if an NMV-algebra can be converted into a residuated structure, too. Contrary to MV-algebras, NMV-algebras are not based on lattices but only on directed posets and the binary operation need not be associative and hence we cannot expect to obtain a residuated lattice but only an essentially weaker structure called a conditionally residuated poset. Considering several additional natural conditions we show that every NMV-algebra can be converted in such a structure. Also conversely, every such structure can be organized into an NMV-algebra. Further, we study an a bit more stronger version of an algebra where the binary operation is even monotone. We show that such an algebra can be organized into a residuated poset and, conversely, every residuated poset can be converted in this structure.

scholarly journals Congruences on a Distributive Lattice

1954 ◽  
Vol 10 (2) ◽  
pp. 76-77
Author(s):  
H. A. Thueston
Keyword(s):  
Distributive Lattice ◽  
Lattice Theory ◽  
Distributive Lattices ◽  
The Subject ◽  
The Many ◽  
Finite Distributive Lattices

Among the many papers on the subject of lattices I have not seen any simple discussion of the congruences on a distributive lattice. It is the purpose of this note to give such a discussion for lattices with a certain finiteness. Any distributive lattice is isomorphic with a ring of sets (G. Birkhoff, Lattice Theory, revised edition, 1948, p. 140, corollary to Theorem 6); I take the case where the sets are finite. All finite distributive lattices are covered by this case.

Sign in / Sign up

Export Citation Format

Share Document