Maximal chains in the Turing degrees
From MaRDI portal
Publication:5444697
DOI10.2178/JSL/1203350783zbMATH Open1131.03017OpenAlexW2035431911MaRDI QIDQ5444697FDOQ5444697
Authors: Liang Yu, C. T. 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
Recommendations
Other Turing degree structures (03D28) Descriptive set theory (03E15) Consistency and independence results (03E35) Large cardinals (03E55)
Cites Work
- Borel determinacy
- A model of set-theory in which every set of reals is Lebesgue measurable
- The fine structure of the constructible hierarchy
- Descriptive set theory
- Infinite combinatorics and definability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Internal cohen extensions
- Title not available (Why is that?)
- Degrees of Unsolvability. (AM-55)
- Initial segments of the degrees of size \(\aleph _ 1\)
- Degrees of unsolvability of constructible sets of integers
Cited In (8)
- The computational significance of Hausdorff's maximal chain principle
- Cofinal maximal chains in the Turing degrees
- Separating families and order dimension of Turing degrees
- Thin Maximal Antichains in the Turing Degrees
- Computing maximal chains
- Traces without maximal chains
- A Π¹₁-uniformization principle for reals
- On Martin’s pointed tree theorem
This page was built for publication: Maximal chains in the Turing degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5444697)