Skip to main content
    • Aa
    • Aa

Maximal chains in the Turing degrees

  • C. T. Chong (a1) and Liang Yu (a2)

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ω, (ω1)L[a] = ω1 if and only if there exists a [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) maximal chain of Turing degrees”.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 2 *
Loading metrics...

Abstract views

Total abstract views: 47 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 21st October 2017. This data will be updated every 24 hours.