Results 241 to 250 of about 769 (267)
Some of the next articles are maybe not open access.

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, 2002
The 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

Distributive Lattices with a Negation Operator

Mathematical Logic Quarterly, 1999
AbstractIn this note we introduce and study algebras (L, V, Λ, ⌝, 0,1) of type (2, 2,1,1,1) such that (L, V, ⌝, 0,1) is a bounded distributive lattice and ⌝ is an operator that satisfies the condition ⌝ (a V b) = a ⌝ b and ⌝ 0 = 1. We develop the topological duality between these algebras and Priestley spaces with a relation.
openaire   +2 more sources

The dual of a generalized completely distributive lattice is a hypercontinuous lattice

Algebra Universalis, 2010
Jinbo Yang, Xiaoquan Xu, Xu Xiaoquan
exaly  

Distributive elements of the lattice of semigroup varieties

Algebra and Logic, 2010
B M Vernikov, Vernikov B M
exaly  

The automorphism group of the universa distributive lattice

Algebra Universalis, 2000
H Dugald Macpherson   +2 more
exaly  

A Characterization of Distributive Lattices

Indagationes Mathematicae (Proceedings), 1951
openaire   +2 more sources

Home - About - Disclaimer - Privacy