Journal of Symbolic Logic 49 (4):1190-1197 (1984)

It will be shown that in the lattice of recursively enumerable sets one can define elementarily with parameters a structure isomorphic to (∑ 0 4 , ∑ 0 3 ), i.e. isomorphic to the lattice of ∑ 0 4 sets together with a unary predicate selecting out exactly the ∑ 0 3 sets
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274271
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 51,756
Through your library

References found in this work BETA

Major Subsets and Automorphisms of Recursively Enumerable Sets.Wolfgang Maass - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 21.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles


Added to PP index

Total views
14 ( #648,820 of 2,333,919 )

Recent downloads (6 months)
2 ( #395,283 of 2,333,919 )

How can I increase my downloads?


My notes