A non-splitting theorem in the enumeration degrees

Annals of Pure and Applied Logic 160 (3):400-418 (2009)
  Copy   BIBTEX

Abstract

We complete a study of the splitting/non-splitting properties of the enumeration degrees below by proving an analog of Harrington’s non-splitting theorem for the enumeration degrees. We show how non-splitting techniques known from the study of the c.e. Turing degrees can be adapted to the enumeration degrees

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2009.01.009

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,127

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 jump operator on the ω-enumeration degrees.Hristo Ganchev & Ivan N. Soskov - 2009 - Annals of Pure and Applied Logic 160 (3):289-301.
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.
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.
Sets of generators and automorphism bases for the enumeration degrees.Andrea Sorbi - 1998 - Annals of Pure and Applied Logic 94 (1-3):263-272.
Initial segments of the enumeration degrees.Hristo Ganchev & Andrea Sorbi - 2016 - Journal of Symbolic Logic 81 (1):316-325.
How Enumeration Reducibility Yields Extended Harrington Non-Splitting.Mariya I. Soskova & S. Barry Cooper - 2008 - Journal of Symbolic Logic 73 (2):634 - 655.
Pa Relative to an Enumeration Oracle.G. O. H. Jun Le, Iskander Sh Kalimullin, Joseph S. Miller & Mariya I. Soskova - 2023 - Journal of Symbolic Logic 88 (4):1497-1525.
An extended Lachlan splitting theorem.Steffen Lempp & Sui Yuefei - 1996 - Annals of Pure and Applied Logic 79 (1):53-59.
Splitting properties of {$n$}-c.e. enumeration degrees.I. Sh Kalimullin - 2002 - Journal of Symbolic Logic 67 (2):537-546.
Enumeration 1-Genericity in the Local Enumeration Degrees. [REVIEW]Liliana Badillo, Charles M. Harris & Mariya I. Soskova - 2018 - Notre Dame Journal of Formal Logic 59 (4):461-489.

Analytics

Added to PP
2013-12-22

Downloads
4 (#1,644,260)

6 months
15 (#185,276)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Initial segments of the enumeration degrees.Hristo Ganchev & Andrea Sorbi - 2016 - Journal of Symbolic Logic 81 (1):316-325.

Add more citations

References found in this work

Then-rea enumeration degrees are dense.Alistair H. Lachlan & Richard A. Shore - 1992 - Archive for Mathematical Logic 31 (4):277-285.
On the Degrees Less than 0'.Gerald E. Sacks - 1964 - Journal of Symbolic Logic 29 (1):60-60.

View all 6 references / Add more references