Jump Operator and Yates Degrees

Journal of Symbolic Logic 71 (1):252 - 264 (2006)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1140641173
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: 30,781
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
Complementation in the Turing Degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
Bi-Isolation in the D.C.E. Degrees.Guohua Wu - 2004 - Journal of Symbolic Logic 69 (2):409 - 420.
An Almost Deep Degree.Peter Cholak, Marcia Groszek & Theodore Slaman - 2001 - Journal of Symbolic Logic 66 (2):881-901.
Jumping to a Uniform Upper Bound.Harold T. Hodes - 1982 - Proceedings of the American Mathematical Society 85 (4):600-602.
Maximal Contiguous Degrees.Peter Cholak, Rod Downey & Stephen Walk - 2002 - Journal of Symbolic Logic 67 (1):409-437.
Minimal Degrees and the Jump Operator.S. B. Cooper - 1973 - Journal of Symbolic Logic 38 (2):249-271.
Definability of the Jump Operator in the Enumeration Degrees.I. Sh Kalimullin - 2003 - Journal of Mathematical Logic 3 (02):257-267.
A Minimal Pair of Recursively Enumerable Degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
The Degrees of Conditional Problems.Su Gao - 1994 - Journal of Symbolic Logic 59 (1):166-181.
The Degrees Below a 1-Generic Degree $.Christine Ann Haught - 1986 - Journal of Symbolic Logic 51 (3):770 - 777.
Jump Embeddings in the Turing Degrees.Peter G. Hinman & Theodore A. Slaman - 1991 - Journal of Symbolic Logic 56 (2):563-591.
Added to PP index
2010-08-24

Total downloads
6 ( #574,513 of 2,199,426 )

Recent downloads (6 months)
1 ( #299,438 of 2,199,426 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature