Splitting and nonsplitting, II: A $low_2$ C.e. Degree above which 0' is not splittable
Journal of Symbolic Logic 67 (4):1391-1430 (2002)
| Abstract | It is shown that there exists a low2 Harrington non-splitting base-that is, a low2 computably enumerable (c.e.) degree a such that for any c.e. degrees x, y, if $0' = x \vee y$ , then either $0' = x \vee a$ or $0' = y \vee a$ . Contrary to prior expectations, the standard Harrington non-splitting construction is incompatible with the $low_{2}-ness$ requirements to be satisfied, and the proof given involves new techniques with potentially wider application | |||||||||
| 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,709 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesCarl F. Craver (2004). Dissociable Realization and Kind Splitting. Philosophy Of Science 71 (5):960-971.
Peter Cholak, Rod Downey & Stephen Walk (2002). Maximal Contiguous Degrees. Journal of Symbolic Logic 67 (1):409-437.
Theodore A. Slaman & John R. Steel (1989). Complementation in the Turing Degrees. Journal of Symbolic Logic 54 (1):160-176.
Angsheng Li & Dongping Yang (1998). Bounding Minimal Degrees by Computably Enumerable Degrees. Journal of Symbolic Logic 63 (4):1319-1347.
Steven D. Leonhardi (1997). Generalized Nonsplitting in the Recursively Enumerable Degrees. Journal of Symbolic Logic 62 (2):397-437.
Marcus Kracht (1993). Splittings and the Finite Model Property. Journal of Symbolic Logic 58 (1):139-157.
Klaus Ambos-Spies & Peter A. Fejer (1988). Degree Theoretical Splitting Properties of Recursively Enumerable Sets. Journal of Symbolic Logic 53 (4):1110-1137.
Mariya I. Soskova & S. Barry Cooper (2008). How Enumeration Reducibility Yields Extended Harrington Non-Splitting. Journal of Symbolic Logic 73 (2):634-655.
Otmar Spinas (2004). Analytic Countably Splitting Families. Journal of Symbolic Logic 69 (1):101-117.
Yong Wang & Angsheng Li (2003). A Hierarchy for the Plus Cupping Turing Degrees. Journal of Symbolic Logic 68 (3):972-988.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #275,053 of 549,699 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
