Maximal chains in the Turing degrees

DOI10.2178/JSL/1203350783zbMath1131.03017OpenAlexW2035431911MaRDI QIDQ5444697

Liang Yu, Chi Tat Chong

Publication date: 25 February 2008

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1203350783

zbMATH Keywords

inaccessible cardinalTuring degreesmaximal chainsequiconsistency

Mathematics Subject Classification ID

Descriptive set theory (03E15) Consistency and independence results (03E35) Large cardinals (03E55) Other Turing degree structures (03D28)

Related Items (3)

A Π¹₁-uniformization principle for reals ⋮ Cofinal maximal chains in the Turing degrees ⋮ On Martin’s pointed tree theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinite combinatorics and definability
• Descriptive set theory
• Borel determinacy
• Initial segments of the degrees of size \(\aleph _ 1\)
• A model of set-theory in which every set of reals is Lebesgue measurable
• Degrees of Unsolvability. (AM-55)
• Degrees of unsolvability of constructible sets of integers
• Internal cohen extensions
• The fine structure of the constructible hierarchy

This page was built for publication: Maximal chains in the Turing degrees