Abstract
We study existence problems of maximal antichains in the Turing degrees. In particular, we give a characterization of the existence of thin ∏11 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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Chong, C. T., & Yu, L. (2007). Thin maximal antichains in the turing degrees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4497 LNCS, pp. 162–168). https://doi.org/10.1007/978-3-540-73001-9_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
