Abstract
It is shown that Th(H 1) ≠ Th (H n ) holds for every n > 1, where H m is the upper semi-lattice of all high m computably enumerable (c.e.) degrees for m > 0, giving a first elementary difference among the highness hierarchies of the c.e. degrees.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cooper, S.B.: On a theorem of C.E.M. Yates (handwritten notes) (1974a)
Cooper, S.B.: Minimal pairs and high recursively enumerable degrees. J. Symbolic Logic 39, 655–660 (1974b)
Cooper, S.B., Li, A.: Splitting and nonsplitting, II: A low2 c.e. degree above which 0′ is not splittable. The Journal of Symbolic Logic 67(4) (2002)
Downey, R.G., Lempp, S., Shore, R.A.: Highness and bounding minimal pairs. Math. Logic Quarterly 39, 475–491 (1993)
Harrington, L.: On Cooper’s proof of a theorem of Yates, Parts I and II (handwritten notes) (1976)
Carl, G., et al.: A join theorem for the computably enumerable degrees. Transactions of the American Mathematical Society 356(7), 2557–2568 (2004)
Harrington, L.: Plus cupping in the recursively enumerable degrees (handwritten notes) (1978)
Lachlan, A.H.: On a problem of G.E. Sacks. Proc. Amer. Math. Soc. 16, 972–979 (1965)
Lachlan, A.H.: A recursively enumerable degree which will not split over all lesser ones. Ann. Math. Logic 9, 307–365 (1975)
Lachlan, A.H.: Bounding minimal pairs. J. Symbolic Logic 44, 626–642 (1979)
Martin, D.A.: On a question of G.E. Sacks. J. Symbolic Logic 31, 66–69 (1966a)
Martin, D.A.: Classes of recursively enumerable sets and degrees of unsolvability, 2. Math. Logik Grundlag. Math. 12, 295–310 (1966b)
Miller, D.: High recursively enumerable degrees and the anti-cupping property. In: Lerman, M., Schmerl, J.H., Soare, R.I. (eds.) Logic Year 1979–1980. Lecture Notes in Mathematics, vol. 859, Springer, Heidelberg (1981)
Nies, A., Shore, R.A., Slaman, T.A.: Interpretability and definability in the recursively enumerable degrees. Proc. London Math. (3) 77(2), 241–291 (1998)
Robinson, R.W.: Interpolation and embedding in the recursively enumerable degrees. Ann. of Math. (2) 93, 285–314 (1971a)
Robinson, R.W.: Jump restricted interpolation in the recursively enumerable degrees. Ann. of Math. (2) 93, 586–596 (1971b)
Sacks, G.E.: Recursive enumerability and the jump operator. Tran. Amer. Math. Soc. 108, 223–239 (1963)
Sacks, G.E.: The recursively enumerable degrees are dense. Ann. of Math. (2) 80, 300–312 (1964)
Sacks, G.E.: On a theorem of Lachlan and Martin. Proc. Amer. Math. Soc. 18, 140–141 (1967)
Shore, R.A.: The low m and low n r.e. degrees are not elementarily equivalent. Science in China, Series A (2004)
Shore, R.A., Slaman, T.A.: Working below a low2 recursively enumerable degree. Archive for Math. Logic 29, 201–211 (1990)
Shore, R.A., Slaman, T.A.: Working below a high recursively enumerable degree. J. Symbolic Logic 58(3), 824–859 (1993)
Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Heidelberg (1987)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, A. (2007). Elementary Differences Among Jump Hierarchies. In: Cai, JY., Cooper, S.B., Zhu, H. (eds) Theory and Applications of Models of Computation. TAMC 2007. Lecture Notes in Computer Science, vol 4484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72504-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-72504-6_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72503-9
Online ISBN: 978-3-540-72504-6
eBook Packages: Computer ScienceComputer Science (R0)