Abstract
We study existence problems of maximal antichains in the Turing degrees. In particular, we give a characterization of the existence of thin \(\Pi^1_1\) maximal antichains in the Turing degrees in terms of (relatively) constructible reals. A corollary of our main result gives a negative solution to a question of Jockusch under the assumption that every real is constructible.
The research of the authors was respectively supported in part by NUS grant WBS 146-000-054-123, and NSF of China No. 10471060 and No. 10420130638.
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
Barwise, J.: Admissible sets and structures. Springer, Heidelberg (1975)
Boolos, G., Putnam, H.: Degrees of unsolvability of constructible sets of integers. J. Symbolic Logic 33, 497–513 (1968)
Chong, C.T., Yu, L.: Maximal chains in the turing degrees. J. Symbolic Logic (To appear)
Cooper, S.B.: Minimal degrees and the jump operator. J. Symbolic Logic 38, 249–271 (1973)
van Engelen, F., Miller, A.W., Steel, J.: Rigid Borel sets and better quasi-order theory. In: Logic and combinatorics (Arcata, Calif, 1985), volume 65 of Contemp. Math, pp. 199–222. Amer. Math. Soc, Providence, RI (1987)
Jensen, R.B.: The fine structure of the constructible hierarchy. Ann. Math. Logic, 4:229–308; erratum, ibid. 4 (1972), 443 (1972)
Mansfield, R.: Perfect subsets of definable sets of real numbers. Pacific J. Math. 35, 451–457 (1970)
Martin, D.A.: Borel determinacy. Ann. of Math (2) 102(2), 363–371 (1975)
Sacks, G.E.: Measure-theoretic uniformity in recursion theory and set theory. Trans. Amer. Math. Soc. 142, 381–420 (1969)
Sacks, G.E.: Higher recursion theory. In: Perspectives in Mathematical Logic, Springer, Heidelberg (1990)
Solovay, R.M.: On the cardinality of \(\Sigma \sb{2}\sp{1}\) sets of reals. In: Foundations of Mathematics (Symposium Commemorating Kurt Gödel, Columbus, Ohio, 1966), pp. 58–73. Springer, New York (1969)
Yu, L.: Measure theory aspects of locally countable orderings. J. Symbolic Logic 71(3), 958–968 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chong, C.T., Yu, L. (2007). Thin Maximal Antichains in the Turing Degrees. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) Computation and Logic in the Real World. CiE 2007. Lecture Notes in Computer Science, vol 4497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-73001-9_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73000-2
Online ISBN: 978-3-540-73001-9
eBook Packages: Computer ScienceComputer Science (R0)