Maximal Chains in the Turing Degrees

Journal of Symbolic Logic 72 (4):1219 - 1227 (2007)
  Copy   BIBTEX

Abstract

We study the problem of existence of maximal chains in the Turing degrees. We show that: 1. ZF+DC+"There exists no maximal chain in the Turing degrees" is equiconsistent with ZFC+"There exists an inaccessible cardinal"; 2. For all a ∈ 2ω.(ω₁)L[a] = ω₁ if and only if there exists a $\Pi _{1}^{1}[a]$ maximal chain in the Turing degrees. As a corollary, ZFC + "There exists an inaccessible cardinal" is equiconsistent with ZFC + "There is no (bold face) $\utilde{\Pi}{}_{1}^{1}$ maximal chain of Turing degrees"

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,607

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Turing degrees and many-one degrees of maximal sets.Manuel Lerman - 1970 - Journal of Symbolic Logic 35 (1):29-40.
Maximal contiguous degrees.Peter Cholak, Rod Downey & Stephen Walk - 2002 - Journal of Symbolic Logic 67 (1):409-437.
Variations on determinacy and ℵω1.Ramez L. Sami - 2022 - Journal of Symbolic Logic 87 (2):721-731.
On the Turing degrees of minimal index sets.Jason Teutsch - 2007 - Annals of Pure and Applied Logic 148 (1):63-80.
On the non-existence of mad families.Haim Horowitz & Saharon Shelah - 2019 - Archive for Mathematical Logic 58 (3-4):325-338.
Hypersimplicity and semicomputability in the weak truth table degrees.George Barmpalias - 2005 - Archive for Mathematical Logic 44 (8):1045-1065.
Maximal chains in the fundamental order.Steven Buechler - 1986 - Journal of Symbolic Logic 51 (2):323-326.
On the existence of strong chains in ℘(ω1)/fin.Piotr Koszmider - 1998 - Journal of Symbolic Logic 63 (3):1055 - 1062.
Lowness for genericity.Liang Yu - 2006 - Archive for Mathematical Logic 45 (2):233-238.
Almost everywhere domination.Natasha L. Dobrinen & Stephen G. Simpson - 2004 - Journal of Symbolic Logic 69 (3):914-922.

Analytics

Added to PP
2010-08-24

Downloads
30 (#740,797)

6 months
10 (#381,237)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Internal cohen extensions.D. A. Martin & R. M. Solovay - 1970 - Annals of Mathematical Logic 2 (2):143-178.
The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Infinite combinatorics and definability.Arnold W. Miller - 1989 - Annals of Pure and Applied Logic 41 (2):179-203.

Add more references