Maximal chains in the Turing degrees
From MaRDI portal
Publication:5444697
Recommendations
Cites work
- scientific article; zbMATH DE number 3861137 (Why is no real title available?)
- scientific article; zbMATH DE number 3861143 (Why is no real title available?)
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- A model of set-theory in which every set of reals is Lebesgue measurable
- Borel determinacy
- Degrees of Unsolvability. (AM-55)
- Degrees of unsolvability of constructible sets of integers
- Descriptive set theory
- Infinite combinatorics and definability
- Initial segments of the degrees of size \(\aleph _ 1\)
- Internal cohen extensions
- The fine structure of the constructible hierarchy
Cited in
(8)- Traces without maximal chains
- A Π¹₁-uniformization principle for reals
- Separating families and order dimension of Turing degrees
- Thin Maximal Antichains in the Turing Degrees
- Cofinal maximal chains in the Turing degrees
- The computational significance of Hausdorff's maximal chain principle
- On Martin’s pointed tree theorem
- Computing maximal chains
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)