Determinacy for games ending at the first admissible relative to the play

Neeman, Itay

Neeman, Itay

J. Symbolic Logic, Tome 71 (2006) no. 1, p. 425-459 / Harvested from Project Euclid

Résumé

Let o(κ) denote the Mitchell order of κ. We show how to reduce long games which run to the first ordinal admissible in the play, to iteration games on models with a cardinal κ so that (1) κ is a limit of Woodin cardinals; and (2) o(κ)=κ⁺⁺. We use the reduction to derive several optimal determinacy results on games which run to the first admissible in the play.

Publié le : 2006-06-14
Classification:

@article{1146620151,
     author = {Neeman, Itay},
     title = {Determinacy for games ending at the first admissible relative to the play},
     journal = {J. Symbolic Logic},
     volume = {71},
     number = {1},
     year = {2006},
     pages = { 425-459},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1146620151}
}

Neeman, Itay. Determinacy for games ending at the first admissible relative to the play. J. Symbolic Logic, Tome 71 (2006) no. 1, pp.  425-459. http://gdmltest.u-ga.fr/item/1146620151/