Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-540-73001-9_17
DC FieldValue
dc.titleThin maximal antichains in the turing degrees
dc.contributor.authorChong, C.T.
dc.contributor.authorYu, L.
dc.date.accessioned2014-10-28T02:52:01Z
dc.date.available2014-10-28T02:52:01Z
dc.date.issued2007
dc.identifier.citationChong, 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. <a href="https://doi.org/10.1007/978-3-540-73001-9_17" target="_blank">https://doi.org/10.1007/978-3-540-73001-9_17</a>
dc.identifier.isbn9783540730002
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/104645
dc.description.abstractWe 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/978-3-540-73001-9_17
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1007/978-3-540-73001-9_17
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume4497 LNCS
dc.description.page162-168
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple 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.