The consistency strength of long projective determinacy
From MaRDI portal
Abstract: We determine the consistency strength of determinacy for projective games of length . Our main theorem is that -determinacy for games of length implies the existence of a model of set theory with Woodin cardinals. In a first step, we show that this hypothesis implies that there is a countable set of reals such that , the canonical inner model for Woodin cardinals constructed over , satisfies and the Axiom of Determinacy. Then we argue how to obtain a model with Woodin cardinal from this. We also show how the proof can be adapted to investigate the consistency strength of determinacy for games of length with payoff in or with -projective payoff.
Recommendations
Cites work
- HODas a core model
- A criterion for coarse iterability
- A Proof of Projective Determinacy
- A theorem of Woodin on mouse sets
- An outline of inner model theory
- Analytic determinacy and 0#
- Borel determinacy
- Deconstructing inner model theory
- Descriptive set theory
- Determinacy in \(L(\mathbb{R}, \mu)\)
- Determinacy in L(ℝ)
- Higher set theory and mathematical practice
- HOD in inner models with Woodin cardinals
- scientific article; zbMATH DE number 5504385 (Why is no real title available?)
- scientific article; zbMATH DE number 5521841 (Why is no real title available?)
- scientific article; zbMATH DE number 5521846 (Why is no real title available?)
- scientific article; zbMATH DE number 5521848 (Why is no real title available?)
- scientific article; zbMATH DE number 567513 (Why is no real title available?)
- scientific article; zbMATH DE number 5785892 (Why is no real title available?)
- Iteration Trees
- Long games and \(\sigma \)-projective sets
- Measurable cardinals and analytic games
- Mice with finitely many Woodin cardinals from optimal determinacy hypotheses
- On the determinacy of games on ordinals
- On the prewellorderings associated with the directed systems of mice
- On the Relative Consistency Strength of Determinacy Hypothesis
- Optimal Proofs of Determinacy
- Projective games on the reals
- Projectively well-ordered inner models
- Pure and hybrid mice with finitely many Woodin cardinals from levels of determinacy
- Scales in \({\mathbf K}(\mathbb R)\)
- Structure theory of \(L(\mathbb{R},\mu)\) and its applications
- The axiom of determinacy implies dependent choice in mice
- The axiom of determinacy implies dependent choices in L(R)
- The determinacy of long games
- The higher infinite. Large cardinals in set theory from their beginnings.
- The mouse set conjecture for sets of reals
- The self-iterability of L[E]
Cited in
(13)- Determinacy and extended sharp functions on the reals. II: Obtaining sharps from determinacy
- The consistency strength of projective absoluteness
- Projective games on the reals
- Long Borel games
- Games of length 2
- Pure and hybrid mice with finitely many Woodin cardinals from levels of determinacy
- GAMES OF LENGTH ω1
- A Proof of Projective Determinacy
- scientific article; zbMATH DE number 1390275 (Why is no real title available?)
- Mice with finitely many Woodin cardinals from optimal determinacy hypotheses
- Determinacy for games ending at the first admissible relative to the play
- GAMES AND REFLECTION IN
- Determinacy axioms and large cardinals
This page was built for publication: The consistency strength of long projective determinacy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5107234)