Bi-Isolation in the D.C.E. Degrees
Journal of Symbolic Logic 69 (2):409 - 420 (2004)
| Abstract | In this paper, we study the bi-isolation phenomena in the d.c.e. degrees and prove that there are c.e. degrees c₁ < c₂ and a d.c.e. degree d ∈ (c₁, c₂) such that (c₁, d) and (d, c₂) contain no c.e. degrees. Thus, the c.e. degrees between c₁ and c₂ are all incomparable with d. We also show that there are d.c.e. degrees d₁ < d₂ such that (d₁, d₂) contains a unique c.e. degree | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
|
| Through your library | Configure |
Guohua Wu (2002). Isolation and Lattice Embeddings. Journal of Symbolic Logic 67 (3):1055-1064.
Peter Cholak, Rod Downey & Stephen Walk (2002). Maximal Contiguous Degrees. Journal of Symbolic Logic 67 (1):409-437.
Guohua Wu (2006). Jump Operator and Yates Degrees. Journal of Symbolic Logic 71 (1):252 - 264.
Su Gao (1994). The Degrees of Conditional Problems. Journal of Symbolic Logic 59 (1):166-181.
Paul Shafer (2010). Characterizing the Join-Irreducible Medvedev Degrees. Notre Dame Journal of Formal Logic 52 (1):21-38.
Joseph S. Miller (2004). Degrees of Unsolvability of Continuous Functions. Journal of Symbolic Logic 69 (2):555 - 584.
Franz Huber (2009). Belief and Degrees of Belief. In Franz Huber & Christoph Schmidt-Petri (eds.), Degrees of Belief. Springer.
Michael Stob (1983). Wtt-Degrees and T-Degrees of R.E. Sets. Journal of Symbolic Logic 48 (4):921-930.
Frank Stephan (2001). On the Structures Inside Truth-Table Degrees. Journal of Symbolic Logic 66 (2):731-770.
Theodore A. Slaman & John R. Steel (1989). Complementation in the Turing Degrees. Journal of Symbolic Logic 54 (1):160-176.
Jeanleah Mohrherr (1983). Kleene Index Sets and Functional M-Degrees. Journal of Symbolic Logic 48 (3):829-840.
Rodney G. Downey, Geoffrey L. Laforte & Richard A. Shore (2003). Decomposition and Infima in the Computably Enumerable Degrees. Journal of Symbolic Logic 68 (2):551-579.
Angsheng Li & Dongping Yang (1998). Bounding Minimal Degrees by Computably Enumerable Degrees. Journal of Symbolic Logic 63 (4):1319-1347.
Barbara F. Csima, Johanna N. Y. Franklin & Richard A. Shore (2013). Degrees of Categoricity and the Hyperarithmetic Hierarchy. Notre Dame Journal of Formal Logic 54 (2):215-231.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-08-24Total downloads1 ( #274,982 of 549,500 )Recent downloads (6 months)1 ( #63,397 of 549,500 )How can I increase my downloads? |

