It will be shown that in the lattice of recursively enumerable sets one can define elementarily with parameters a structure isomorphic to ( ), i.e. isomorphic to the lattice of sets together with a unary predicate selecting out exactly the sets.
CITATION STYLE
Herrmann, E. (1984). Definable structures in the lattice of recursively enumerable sets. Journal of Symbolic Logic, 49(4), 1190–1197. https://doi.org/10.2307/2274271
Mendeley helps you to discover research relevant for your work.