Results 271 to 280 of about 2,215 (299)
Some of the next articles are maybe not open access.
Subordinations on Bounded Distributive Lattices
Order, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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
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
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
Distributive Lattices with a Dual Endomorphism
Mathematical Logic Quarterly, 1985An Ockham algebra is a bounded lattice L on which there is defined a \(\{\) 0,1\(\}\)-exchanging dual endomorphism f. The author considers here distributive Ockham algebras in which \(f^ 3=f\). A complete description of the subdirectly irreducible algebras is given.
openaire +2 more sources
Computable Isomorphisms of Distributive Lattices
2019© Springer Nature Switzerland AG 2019. A standard tool for the classifying computability-theoretic complexity of equivalence relations is provided by computable reducibility. This gives rise to a rich degree-structure which has been extensively studied in the literature.
Nikolay Bazhenov 0001 +2 more
openaire +2 more sources
Quasiorders and Sublattices of Distributive Lattices
Order, 2002The author studies the lattice \(\text{Sub}_{01}(L)\) of all \((0,1)\)-sublattices of a distributive lattice \(L\), using certain compatible quasiorders on the Priestley space of \(L\). The main theorems describe \(\text{Sub}_{01}(L)\) in terms of special quasiorders on the Priestley space of \(L\) and characterize the covering relation in \(\text{Sub ...
openaire +2 more sources