Article contents
Determinacy for games ending at the first admissible relative to the play
Published online by Cambridge University Press: 12 March 2014
Abstract
Let o(k) denote the Mitchell order of k. 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 k so that (1) k is a limit of Woodin cardinals: and (2) o(k) = k++. We use the reduction to derive several optimal determinacy results on games which run to the first admissible in the play.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2006
References
REFERENCES
- 2
- Cited by