Article contents
Decision problem for separated distributive lattices
Published online by Cambridge University Press: 12 March 2014
Abstract
It is well known that for all recursively enumerable sets X1, X2 there are disjoint recursively enumerable sets Y1 ⊆ Y2 such that Y ⊆ X1, Y2 ⊆ X2 and Y1, ⋃ Y2 = X1 ⋃ X2. 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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1983
References
REFERENCES
- 2
- Cited by