Results 251 to 260 of about 15,586 (289)
Some of the next articles are maybe not open access.
Valuations on Distributive Lattices II
Archiv der Mathematik, 1973In Parts I and II [Arch. Math. 24, 230–239, 337–345 (1973)] we were principally interested in combinatorial applications of the valuation ring of a distributive lattice. We now show how this ring provides a natural setting for some elementary results in measure theory as well as some classical results on representations of distributive lattices ...
openaire +1 more source
Distributive PBZ$$^{*}$$-lattices
Studia LogicazbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Distributive lattices with an operator
Studia Logica, 1996A \(j\)-distributive lattice is an algebra \((L, \vee, \wedge,j, 0, 1)\) such that \((L, \vee, \wedge, 0, 1)\) is a bounded distributive lattice and \(j : L \to L\) is a join-homomorphism. Congruences of \(j\)-distributive lattices are described in terms of corresponding dual spaces, and simple and subdirectly irreducible algebras are characterized for
openaire +2 more sources
Subordinations on Bounded Distributive Lattices
Order, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Postulates For Distributive Lattices
Canadian Journal of Mathematics, 1951Many 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].
openaire +2 more sources
On Unification for Bounded Distributive Lattices
ACM Transactions on Computational Logic, 2000We give a method for deciding unifiability in the variety of bounded distributive lattices. For this, we reduce the problem of deciding whether a unification problem S has a solution to the problem of checking the satisfiability of a set Φ S of ground clauses.
openaire +3 more sources
ENDOMORPHISMS OF DISTRIBUTIVE LATTICES WITH A QUANTIFIER
International Journal of Algebra and Computation, 2007Let V be a non-trivial variety of bounded distributive lattices with a quantifier, as introduced by Cignoli in [7]. It is shown that if V does not contain the 4-element bounded Boolean lattice with a simple quantifier, then V contains non-isomorphic algebras with isomorphic endomorphism monoids, but there are always at most two such algebras. Further,
M. E. Adams, Wieslaw Dziobiak
openaire +2 more sources
Distributive Lattices Lattice-Groups
2015This chapter begins with an introductory section which fixes the formal algebraic framework of distributive lattices and of Boolean algebras.
Henri Lombardi, Claude Quitté
openaire +1 more source
Homogeneous Modular Lattices are Distributive
Order, 2015A structure \(A\) is homogeneous if any partial isomorphism between finitely generated substructures can be extended to an automorphism of the structure \(A\). \textit{A. Abogatma} and \textit{J. K. Truss} [Order 32, No. 2, 239--243 (2015; Zbl 1348.06004)] have constructed uncountably many contable homogeneous lattices.
openaire +2 more sources
On Weak Lewis Distributive Lattices
Studia LogicazbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ismael Calomino +2 more
openaire +1 more source