Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-540-73001-9_17
Title: Thin maximal antichains in the turing degrees
Authors: Chong, C.T. 
Yu, L.
Issue Date: 2007
Citation: Chong, C.T.,Yu, L. (2007). Thin maximal antichains in the turing degrees. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4497 LNCS : 162-168. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-540-73001-9_17
Abstract: We study existence problems of maximal antichains in the Turing degrees. In particular, we give a characterization of the existence of thin ∏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. © Springer-Verlag Berlin Heidelberg 2007.
Source Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
URI: http://scholarbank.nus.edu.sg/handle/10635/104645
ISBN: 9783540730002
ISSN: 03029743
DOI: 10.1007/978-3-540-73001-9_17
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.