A δ02 set with barely σ02 degree

Journal of Symbolic Logic 64 (4):1700 - 1718 (1999)
Abstract
We construct a Δ 0 2 degree which fails to be computably enumerable in any computably enumerable set strictly below $\emptyset'$
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2586807
Options
 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,126
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

No citations found.

Add more citations

Similar books and articles
A High Strongly Noncappable Degree.Steffen Lempp - 1988 - Journal of Symbolic Logic 53 (1):174-187.
1-Reducibility Inside an M-Degree with Maximal Set.E. Hermann - 1992 - Journal of Symbolic Logic 57 (3):1046-1056.
On the Cantor-Bendixon Rank of Recursively Enumerable Sets.Peter Cholak & Rod Downey - 1993 - Journal of Symbolic Logic 58 (2):629-640.
Structural Properties and Σ02 Enumeration Degrees.André Nies & Andrea Sorbi - 2000 - Journal of Symbolic Logic 65 (1):285 - 292.
The Δ02-Spectrum of a Linear Order.Russell Miller - 2001 - Journal of Symbolic Logic 66 (2):470 - 486.

Monthly downloads

Added to index

2009-01-28

Total downloads

7 ( #525,852 of 2,171,847 )

Recent downloads (6 months)

1 ( #326,616 of 2,171,847 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums