Almost weakly 2-generic sets

Journal of Symbolic Logic 59 (3):868-887 (1994)
There is a family of questions in relativized complexity theory--weak analogs of the Friedberg Jump-Inversion Theorem--that are resolved by 1-generic sets but which cannot be resolved by essentially any weaker notion of genericity. This paper defines aw2-generic sets. i.e., sets which meet every dense set of strings that is r.e. in some incomplete r.e. set. Aw2-generic sets are very close to 1-generic sets in strength, but are too weak to resolve these questions. In particular, it is shown that for any set X there is an aw2-generic set G such that $\mathbf{NP}^G \cap co-\mathbf{NP}^G \nsubseteq \mathbf{P}^{G \oplus X}$ . (On the other hand, if G is 1-generic, then $\mathbf{NP}^G \cap co-\mathbf{NP}^G \subseteq \mathbf{P}^{G \oplus \mathrm{SAT}}$ . where SAT is the NP-complete satisfiability problem [6].) This result runs counter to the fact that most finite extension constructions in complexity theory can be made effective. These results imply that any finite extension construction that ensures any of the Friedberg analogs must be noneffective, even relative to an arbitrary incomplete r.e. set. It is then shown that the recursion theoretic properties of aw2-generic sets differ radically from those of 1-generic sets: every degree above O' contains an aw2-generic set: no aw2-generic set exists below any incomplete r.e. set; there is an aw2-generic set which is the join of two Turing equivalent aw2-generic sets. Finally, a result of Shore is presented [30] which states that every degree above 0' is the jump of an aw2-generic degree
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275914
 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
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 28,208
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
On Generic Extensions Without the Axiom of Choice.G. P. Monro - 1983 - Journal of Symbolic Logic 48 (1):39-52.
Ultrafilters on the Natural Numbers.Christopher Barney - 2003 - Journal of Symbolic Logic 68 (3):764-784.
On Non-Wellfounded Iterations of the Perfect Set Forcing.Vladimir Kanovei - 1999 - Journal of Symbolic Logic 64 (2):551-574.
The Degrees Below a 1-Generic Degree $.Christine Ann Haught - 1986 - Journal of Symbolic Logic 51 (3):770 - 777.
Recursively Enumerable Generic Sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.

Monthly downloads

Added to index


Total downloads

29 ( #177,760 of 2,172,844 )

Recent downloads (6 months)

1 ( #324,901 of 2,172,844 )

How can I increase my downloads?

My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums