Noncappable enumeration degrees below 0'e [Book Review]

&
Journal of Symbolic Logic 61 (4):1347 - 1363 (1996)
  Copy   BIBTEX

Abstract

We prove that there exists a noncappable enumeration degree strictly below 0' e

Categories

Keywords

Reprint years

DOI

10.2307/2275820

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,597

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The limitations of cupping in the local structure of the enumeration degrees.Mariya I. Soskova - 2010 - Archive for Mathematical Logic 49 (2):169-193.
Initial segments of the enumeration degrees.Hristo Ganchev & Andrea Sorbi - 2016 - Journal of Symbolic Logic 81 (1):316-325.
On Cupping and Ahmad Pairs.Iskander Sh Kalimullin, Steffen Lempp, N. G. Keng & Mars M. Yamaleev - 2024 - Journal of Symbolic Logic 89 (3):1358-1369.
On the jump classes of noncuppable enumeration degrees.Charles M. Harris - 2011 - Journal of Symbolic Logic 76 (1):177 - 197.
Branching in the $${\Sigma^0_2}$$ -enumeration degrees: a new perspective. [REVIEW]Maria L. Affatato, Thomas F. Kent & Andrea Sorbi - 2008 - Archive for Mathematical Logic 47 (3):221-231.
Cupping and noncupping in the enumeration degrees of ∑20 sets.S. Barry Cooper, Andrea Sorbi & Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (3):317-342.
Bounding Nonsplitting Enumeration Degrees.Thomas F. Kent & Andrea Sorbi - 2007 - Journal of Symbolic Logic 72 (4):1405 - 1417.
A note on the enumeration degrees of 1-generic sets.Liliana Badillo, Caterina Bianchini, Hristo Ganchev, Thomas F. Kent & Andrea Sorbi - 2016 - Archive for Mathematical Logic 55 (3):405-414.
Structural properties and Σ20 enumeration degrees.André Nies & Andrea Sorbi - 2000 - Journal of Symbolic Logic 65 (1):285-292.
Cupping and definability in the local structure of the enumeration degrees.Hristo Ganchev & Mariya I. Soskova - 2012 - Journal of Symbolic Logic 77 (1):133-158.

Analytics

Added to PP
2009-01-28

Downloads
50 (#439,769)

6 months
16 (#191,673)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
In memoriam: Barry Cooper 1943–2015.Andrew Lewis-Pye & Andrea Sorbi - 2016 - Bulletin of Symbolic Logic 22 (3):361-365.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
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.
Enumeration reducibility and partial degrees.John Case - 1971 - Annals of Mathematical Logic 2 (4):419-439.
Properly Σ2 Enumeration Degrees.S. B. Cooper & C. S. Copestake - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (6):491-522.

View all 8 references / Add more references