Recursively enumerable generic sets

Journal of Symbolic Logic 47 (4):809-823 (1982)
We show that one can solve Post's Problem by constructing generic sets in the usual set theoretic framework applied to tiny universes. This method leads to a new class of recursively enumerable sets: r.e. generic sets. All r.e. generic sets are low and simple and therefore of Turing degree strictly between 0 and 0'. Further they supply the first example of a class of low recursively enumerable sets which are automorphic in the lattice E of recursively enumerable sets with inclusion. We introduce the notion of a promptly simple set. This describes the essential feature of r.e. generic sets with respect to automorphism constructions
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273100
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 21,439
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Peter Cholak, Rod Downey & Eberhard Herrmann (2001). Some Orbits for E. Annals of Pure and Applied Logic 107 (1-3):193-226.

View all 7 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

194 ( #17,655 of 1,911,652 )

Recent downloads (6 months)

39 ( #19,922 of 1,911,652 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.