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 | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,701 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesTheodore A. Slaman & John R. Steel (1989). Complementation in the Turing Degrees. Journal of Symbolic Logic 54 (1):160-176.
Guohua Wu (2004). Bi-Isolation in the D.C.E. Degrees. Journal of Symbolic Logic 69 (2):409 - 420.
Steffen Lempp & Theodore A. Slaman (1989). A Limit on Relative Genericity in the Recursively Enumerable Sets. Journal of Symbolic Logic 54 (2):376-395.
C. E. M. Yates (1970). Initial Segments of the Degrees of Unsolvability Part II: Minimal Degrees. Journal of Symbolic Logic 35 (2):243-266.
P. D. Welch (2000). Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals. Journal of Symbolic Logic 65 (3):1193-1203.
Peter Cholak, Marcia Groszek & Theodore Slaman (2001). An Almost Deep Degree. Journal of Symbolic Logic 66 (2):881-901.
Antonio Montalbán (2003). Embedding Jump Upper Semilattices Into the Turing Degrees. Journal of Symbolic Logic 68 (3):989-1014.
Harold T. Hodes (1982). Jumping to a Uniform Upper Bound. Proceedings of the American Mathematical Society 85 (4):600-602.
Peter Cholak, Rod Downey & Stephen Walk (2002). Maximal Contiguous Degrees. Journal of Symbolic Logic 67 (1):409-437.
S. B. Cooper (1973). Minimal Degrees and the Jump Operator. Journal of Symbolic Logic 38 (2):249-271.
I. Sh Kalimullin (2003). Definability of the Jump Operator in the Enumeration Degrees. Journal of Mathematical Logic 3 (02):257-267.
C. E. M. Yates (1966). A Minimal Pair of Recursively Enumerable Degrees. Journal of Symbolic Logic 31 (2):159-168.
Su Gao (1994). The Degrees of Conditional Problems. Journal of Symbolic Logic 59 (1):166-181.
Christine Ann Haught (1986). The Degrees Below a 1-Generic Degree $. Journal of Symbolic Logic 51 (3):770 - 777.
Peter G. Hinman & Theodore A. Slaman (1991). Jump Embeddings in the Turing Degrees. Journal of Symbolic Logic 56 (2):563-591.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-08-24Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
