Complementation in the Turing degrees

Journal of Symbolic Logic 54 (1):160-176 (1989)
Posner [6] has shown, by a nonuniform proof, that every ▵ 0 2 degree has a complement below 0'. We show that a 1-generic complement for each ▵ 0 2 set of degree between 0 and 0' can be found uniformly. Moreover, the methods just as easily can be used to produce a complement whose jump has the degree of any real recursively enumerable in and above $\varnothing'$ . In the second half of the paper, we show that the complementation of the degrees below 0' does not extend to all recursively enumerable degrees. Namely, there is a pair of recursively enumerable degrees a above b such that no degree strictly below a joins b above a. (This result is independently due to S. B. Cooper.) We end with some open problems
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275022
 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: 23,664
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
Guohua Wu (2007). Intervals Containing Exactly One Ce Degree. Annals of Pure and Applied Logic 146 (1):91-102.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

8 ( #466,975 of 1,902,890 )

Recent downloads (6 months)

2 ( #324,370 of 1,902,890 )

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.