Noncappable enumeration degrees below 0'e [Book Review]

Journal of Symbolic Logic 61 (4):1347 - 1363 (1996)
Abstract
We prove that there exists a noncappable enumeration degree strictly below 0' e
Keywords Enumeration operator   enumeration degree   $\Sigma^0_2$-set
Categories (categorize this paper)
DOI 10.2307/2275820
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,848
Through your library
References found in this work BETA
Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (7-13):117-125.
Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Mathematical Logic Quarterly 5 (7‐13):117-125.
Properly Σ2 Enumeration Degrees.S. B. Cooper & C. S. Copestake - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (6):491-522.
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers.S. Barry Cooper - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (6):537-560.
Properly Σ2 Enumeration Degrees.S. B. Cooper & C. S. Copestake - 1988 - Mathematical Logic Quarterly 34 (6):491-522.

View all 7 references / Add more references

Citations of this work BETA
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.

Add more citations

Similar books and articles
Bounding Nonsplitting Enumeration Degrees.Thomas F. Kent & Andrea Sorbi - 2007 - Journal of Symbolic Logic 72 (4):1405 - 1417.
A Jump Class of Noncappable Degrees.S. B. Cooper - 1989 - Journal of Symbolic Logic 54 (2):324-353.
Uniform Enumeration Operations.A. H. Lachlan - 1975 - Journal of Symbolic Logic 40 (3):401-409.
The Π02 Enumeration Degrees Are Not Dense.William C. Calhoun & Theodore A. Slaman - 1996 - Journal of Symbolic Logic 61 (4):1364 - 1379.
A High Strongly Noncappable Degree.Steffen Lempp - 1988 - Journal of Symbolic Logic 53 (1):174-187.
Structural Properties and Σ02 Enumeration Degrees.André Nies & Andrea Sorbi - 2000 - Journal of Symbolic Logic 65 (1):285 - 292.
Added to PP index
2009-01-28

Total downloads
9 ( #501,829 of 2,210,506 )

Recent downloads (6 months)
1 ( #389,893 of 2,210,506 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature