Jump Operator and Yates Degrees

Journal of Symbolic Logic 71 (1):252 - 264 (2006)
  Copy   BIBTEX

Abstract

In [9]. Yates proved the existence of a Turing degree a such that 0. 0′ are the only c.e. degrees comparable with it. By Slaman and Steel [7], every degree below 0′ has a 1-generic complement, and as a consequence. Yates degrees can be 1-generic, and hence can be low. In this paper, we prove that Yates degrees occur in every jump class

Other Versions

No versions found

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
Turing degrees and many-one degrees of maximal sets.Manuel Lerman - 1970 - Journal of Symbolic Logic 35 (1):29-40.
On the jump classes of noncuppable enumeration degrees.Charles M. Harris - 2011 - Journal of Symbolic Logic 76 (1):177 - 197.
Nonisolated degrees and the jump operator.Guohua Wu - 2002 - Annals of Pure and Applied Logic 117 (1-3):209-221.
Intervals containing exactly one c.e. degree.Guohua Wu - 2007 - Annals of Pure and Applied Logic 146 (1):91-102.
Isolation in the CEA hierarchy.Geoffrey LaForte - 2005 - Archive for Mathematical Logic 44 (2):227-244.
Completely mitotic c.e. degrees and non-jump inversion.Evan J. Griffiths - 2005 - Annals of Pure and Applied Logic 132 (2-3):181-207.

Analytics

Added to PP
2010-08-24

Downloads
34 (#674,613)

6 months
11 (#370,490)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references