scholarly journals A Ternary Operation in Distributive Lattices

Author(s):  
Garrett Birkhoff ◽  
S. A. Kiss
1951 ◽  
Vol 3 ◽  
pp. 28-30 ◽  
Author(s):  
Marlow Sholander

Many sets of postulates have been given for distributive lattices and for Boolean algebra. For a description of some of the most interesting and for references to others the reader is referred to Birkhoff's “Lattice Theory”[1]. In this paper we give sets of postulates which have some intrinsic interest because of their simplicity. In the first two sections binary operations are used to describe a distributive lattice by 2 identities in 3 variables and a Boolean algebra by 3 identities in 3 variables. In the third section a ternary operation is used to describe distributive lattices with 0 and J by 2 identities in 5 variables.


Author(s):  
U. M. Swamy ◽  
Ch. Santhi Sundar Raj ◽  
A. Natnael Teshale

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Wesley Fussner ◽  
Mai Gehrke ◽  
Samuel J. van Gool ◽  
Vincenzo Marra

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.


Order ◽  
2021 ◽  
Author(s):  
Peter Köhler

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.


Author(s):  
Gezahagne Mulat Addis

For a given ideal [Formula: see text] of an almost distributive lattice [Formula: see text], we study the smallest and the largest congruence relation on [Formula: see text] having [Formula: see text] as a congruence class.


Sign in / Sign up

Export Citation Format

Share Document