Journal of Symbolic Logic 48 (1):193-196 (1983)
|Abstract||It is well known that for all recursively enumerable sets X 1 , X 2 there are disjoint recursively enumerable sets Y 1 , Y 2 such that $Y_1 \subseteq X_1, Y_2 \subseteq X_2$ and Y 1 ∪ Y 2 = X 1 ∪ X 2 . Alistair Lachlan called distributive lattices satisfying this property separated. He proved that the first-order theory of finite separated distributive lattices is decidable. We prove here that the first-order theory of all separated distributive lattices is undecidable|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Roberto Cignoli (1996). Free Q-Distributive Lattices. Studia Logica 56 (1-2):23 - 29.
Alasdair Urquhart (1981). Distributive Lattices with a Dual Homomorphic Operation. II. Studia Logica 40 (4):391 - 404.
Michał Kozak (2009). Distributive Full Lambek Calculus has the Finite Model Property. Studia Logica 91 (2):201 - 216.
Viorica Sofronie-Stokkermans (2000). Duality and Canonical Extensions of Bounded Distributive Lattices with Operators, and Applications to the Semantics of Non-Classical Logics I. Studia Logica 64 (1):93-132.
Claudia B. Wegener (2002). Free Modal Lattices Via Priestley Duality. Studia Logica 70 (3):339 - 352.
Wolfgang Maass (1984). On the Orbits of Hyperhypersimple Sets. Journal of Symbolic Logic 49 (1):51-62.
Saburo Tamura (1975). Two Identities for Lattices, Distributive Lattices and Modular Lattices with a Constant. Notre Dame Journal of Formal Logic 16 (1):137-140.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #274,830 of 549,087 )
Recent downloads (6 months)0
How can I increase my downloads?