Turing determinacy and the continuum hypothesis
From MaRDI portal
If the axiom of determinacy for Turing closed sets is assumed, then every uncountable set of reals is of cardinality continuum and every subset of \(\omega_ 1\) is constructible from some real. Some interesting open problems are mentioned.
Recommendations
- scientific article; zbMATH DE number 979885
- Turing Determinacy and Suslin sets
- Contiguity and distributivity in the enumerable Turing degrees
- scientific article; zbMATH DE number 1009727
- scientific article; zbMATH DE number 4123711
- Turing Definability in the Ershov Hierarchy
- Decidability and undecidability in the enumerable Turing degrees
- scientific article; zbMATH DE number 5519284
- Continuity, proof systems and the theory of transfinite computations
- On relative enumerability of Turing degrees
Cites work
- A model of set-theory in which every set of reals is Lebesgue measurable
- Analytic determinacy and 0#
- Borel determinacy
- Descriptive set theory
- Determinateness in the low protective hierarchy
- Higher set theory and mathematical practice
- scientific article; zbMATH DE number 3652325 (Why is no real title available?)
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- scientific article; zbMATH DE number 3215740 (Why is no real title available?)
- Measurable cardinals and analytic games
- On the axiom of determinateness
Cited in
(18)- Turing cones and set theory of the reals
- Large cardinals and definable counterexamples to the continuum hypothesis
- The logic of Turing progressions
- Turing Jumps Through Provability
- Inner Model Operators and the Continuum Hypothesis
- Continuous and Exact Sets of Specified Cardinality
- scientific article; zbMATH DE number 58133 (Why is no real title available?)
- scientific article; zbMATH DE number 4123711 (Why is no real title available?)
- scientific article; zbMATH DE number 979885 (Why is no real title available?)
- The Continuum Problem
- Large Turing independent sets
- Turing Determinacy and Suslin sets
- VARIATIONS ON DETERMINACY AND ℵω1
- Tarski’s Undefinability Theorem and the Diagonal Lemma
- Turing invariant sets and the perfect set property
- Uniformity, universality, and computability theory
- Cofinal maximal chains in the Turing degrees
- SOME CONSEQUENCES OF AND
This page was built for publication: Turing determinacy and the continuum hypothesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1824617)