scientific article; zbMATH DE number 4072961
[For the entire collection see Zbl 0638.00008.] The author investigates strong forms of definable determinateness for games of length \(\omega_ 1\) which are clopen (decided after countably many moves). In particular he shows that the game quantifiers associated to these games propagate scales and that the games have canonical winning strategies. These results are used to obtain the existence of an inner model in which all games of length \(<\omega_ 1\) on \({\mathbb{R}}\) are determined, assuming the determinacy of games of length \(\omega_ 1\) with payoff \({\underset \tilde{} \Pi}^ 1_ 1\) in the codes. Partial results are obtained concerning the problem of proving the author's strong determinacy hypotheses from large cardinal assumptions by reducing long games to higher type games. The paper ends with several open questions leading to a ``maximum determinacy principle allowing games of any ordinal length.
- The determinacy of long games
- Determinacy separations for class games
- Games of length 2
- GAMES OF LENGTH ω1
- scientific article; zbMATH DE number 5521851 (Why is no real title available?)
- Excess games
- Reflection of Long Game Formulas
- scientific article; zbMATH DE number 1390275 (Why is no real title available?)
- SHORTENING CLOPEN GAMES
- Open determinacy for class games
- Determinacy for games ending at the first admissible relative to the play
- Provably _1 games
- Determinacy axioms and large cardinals
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3804698)