Isols and generalized Boolean algebras (Q749527): Difference between revisions

This paper proves the following result of the Stone Representation Theorem sort: Let C be a relatively complemented distributive lattice with zero whose elements form an isolated (immune or finite) set of natural numbers. Further, assume that one can effectively compute the lattice operations (meet, join, relative complement) and that one can effectively find, given \(x\in C\), an atom \(a\leq x\). Then C is effectively isomorphic to the lattice A of finite sets of atoms of C. In addition, the lattice structure of A is completely determined by A's recursive equivalence type.