Skip to main content

Thin Maximal Antichains in the Turing Degrees

  • Conference paper
Computation and Logic in the Real World (CiE 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4497))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barwise, J.: Admissible sets and structures. Springer, Heidelberg (1975)

    Book  MATH  Google Scholar 

  2. Boolos, G., Putnam, H.: Degrees of unsolvability of constructible sets of integers. J. Symbolic Logic 33, 497–513 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chong, C.T., Yu, L.: Maximal chains in the turing degrees. J. Symbolic Logic (To appear)

    Google Scholar 

  4. Cooper, S.B.: Minimal degrees and the jump operator. J. Symbolic Logic 38, 249–271 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  5. 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)

    Google Scholar 

  6. Jensen, R.B.: The fine structure of the constructible hierarchy. Ann. Math. Logic, 4:229–308; erratum, ibid. 4 (1972), 443 (1972)

    Google Scholar 

  7. Mansfield, R.: Perfect subsets of definable sets of real numbers. Pacific J. Math. 35, 451–457 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  8. Martin, D.A.: Borel determinacy. Ann. of Math (2) 102(2), 363–371 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  9. Sacks, G.E.: Measure-theoretic uniformity in recursion theory and set theory. Trans. Amer. Math. Soc. 142, 381–420 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  10. Sacks, G.E.: Higher recursion theory. In: Perspectives in Mathematical Logic, Springer, Heidelberg (1990)

    Google Scholar 

  11. 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)

    Google Scholar 

  12. Yu, L.: Measure theory aspects of locally countable orderings. J. Symbolic Logic 71(3), 958–968 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics