No label defined (Q3804698)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4072961
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4072961 |
Statements
1988
0 references
definable determinateness
0 references
games of length \(\omega _ 1\)
0 references
game quantifiers
0 references
inner model
0 references
determinacy
0 references
long games
0 references
higher type games
0 references
0.857969343662262
0 references
0.8507073521614075
0 references
0.8128339648246765
0 references
0.797167956829071
0 references
[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.
0 references