Determinacy for Games Ending at the First Admissible Relative to the Play

Journal of Symbolic Logic 71 (2):425 - 459 (2006)
  Copy   BIBTEX

Abstract

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

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1146620151

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,752

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Bounds on the Strength of Ordinal Definable Determinacy in Small Admissible Sets.Diego Rojas-Rebolledo - 2012 - Notre Dame Journal of Formal Logic 53 (3):351-371.
Games authors play.Peter Hutchinson - 1983 - New York: Methuen.
HC of an admissible set.Sy D. Friedman - 1979 - Journal of Symbolic Logic 44 (1):95-102.
Omniscience and omnipotence: How they may help - or hurt - in a game.Steven J. Brams - 1982 - Inquiry: An Interdisciplinary Journal of Philosophy 25 (2):217 – 231.
The strength of Blackwell determinacy.Donald A. Martin, Itay Neeman & Marco Vervoort - 2003 - Journal of Symbolic Logic 68 (2):615-636.
Game cultures: computer games as new media.Jon Dovey - 2006 - New York, NY: Open University Press. Edited by Helen W. Kennedy.
9. traditional games as new games: Towards an educational philosophy of play.Kit N.⊘Rgaard - 2009 - Sport, Ethics and Philosophy 3 (2):253 – 273.
More on cichoń's diagram and infinite games.Masaru Kada - 2000 - Journal of Symbolic Logic 65 (4):1713-1724.
Congestion models and weighted Bayesian potential games.Giovanni Facchini, Freek van Megen, Peter Borm & Stef Tijs - 1997 - Theory and Decision 42 (2):193-206.
Logic games are complete for game logics.Johan van Benthem - 2003 - Studia Logica 75 (2):183-203.
The largest countable inductive set is a mouse set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.

Analytics

Added to PP
2010-08-24

Downloads
17 (#865,183)

6 months
9 (#302,300)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Inner models with many Woodin cardinals.J. R. Steel - 1993 - Annals of Pure and Applied Logic 65 (2):185-209.
The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Unraveling Π11 sets.Itay Neeman - 2000 - Annals of Pure and Applied Logic 106 (1-3):151-205.
Determinacy in the Mitchell models.John R. Steel - 1982 - Annals of Mathematical Logic 22 (2):109.

Add more references