Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T08:46:44.292Z Has data issue: false hasContentIssue false

Decision problem for separated distributive lattices

Published online by Cambridge University Press:  12 March 2014

Yuri Gurevich*
Affiliation:
Ben-Gurion University, Beer Sheva, Israel
*
University of Michigan, Ann Arbor, Michigan 48104

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1983

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable