Properly $\Sigma _{2}^{0}$ Enumeration Degrees and the High/Low Hierarchy
Journal of Symbolic Logic 71 (4):1125 - 1144 (2006)
| Abstract | We show that there exist downwards properly $\Sigma _{2}^{0}$ (in fact noncuppable) e-degrees that are not high. We also show that every high e-degree bounds a noncuppable e-degree. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,875 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesMatthew Giorgi, Andrea Sorbi & Yue Yang (2006). Properly Σ⁰₂ Enumeration Degrees and the High/Low Hierarchy. Journal of Symbolic Logic 71 (4):1125-1144.
S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang (2005). Bounding and Nonbounding Minimal Pairs in the Enumeration Degrees. Journal of Symbolic Logic 70 (3):741 - 766.
Thomas F. Kent (2006). The Π₃-Theory of the $\Sigma _{2}^{0}$ -Enumeration Degrees Is Undecidable. Journal of Symbolic Logic 71 (4):1284 - 1302.
André Nies & Andrea Sorbi (2000). Structural Properties and Σ02 Enumeration Degrees. Journal of Symbolic Logic 65 (1):285 - 292.
Stanislaw Bereznyuk, Richard Coles & Andrea Sorbi (2000). The Distribution of Properly Σ02 E-Degrees. Journal of Symbolic Logic 65 (1):19 - 32.
Steffen Lempp & Andrea Sorbi (2002). Embedding Finite Lattices Into the {$\Sigma\Sp 0\Sb 2$} Enumeration Degrees. Journal of Symbolic Logic 67 (1):69-90.
Steffen Lempp & Theodore A. Slaman (1989). A Limit on Relative Genericity in the Recursively Enumerable Sets. Journal of Symbolic Logic 54 (2):376-395.
Theodore A. Slaman (1986). On the Kleene Degrees of Π11 Sets. Journal of Symbolic Logic 51 (2):352 - 359.
Chengling Fang & Guohua Wu (2012). Nonhemimaximal Degrees and the High/Low Hierarchy. Journal of Symbolic Logic 77 (2):433-446.
Steffen Lempp & Andrea Sorbi (2002). Embedding Finite Lattices Into the Σ02 Enumeration Degrees. Journal of Symbolic Logic 67 (1):69 - 90.
S. Barry Cooper & Andrea Sorbi (1996). Noncappable Enumeration Degrees Below 0'e. Journal of Symbolic Logic 61 (4):1347 - 1363.
Michael E. Mytilinaios & Theodore A. Slaman (1988). Σ2-Collection and the Infinite Injury Priority Method. Journal of Symbolic Logic 53 (1):212 - 221.
Liang Yu & Yue Yang (2005). On the Definable Ideal Generated by Nonbounding C.E. Degrees. Journal of Symbolic Logic 70 (1):252 - 270.
Yue Yang & Liang Yu (2006). On Σ₁-Structural Differences Among Finite Levels of the Ershov Hierarchy. Journal of Symbolic Logic 71 (4):1223 - 1236.
André Nies, Frank Stephan & Sebastiaan A. Terwijn (2005). Randomness, Relativization and Turing Degrees. Journal of Symbolic Logic 70 (2):515 - 535.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2011-05-29Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
