How to win some simple iteration games

&
Annals of Pure and Applied Logic 83 (2):103-164 (1997)
  Copy   BIBTEX

Abstract

We introduce two new iteration games: the game , which is a strengthening of the weak iteration game, and the game , which is somewhat stronger than but weaker than the full iteration game of length ω1. For a countable M elementarily embeddable in some Vη, with two players I and II, we can show that II wins and that I does not win

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(96)00013-9

Links

PhilArchive



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

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

Determinacy for Games Ending at the First Admissible Relative to the Play.Itay Neeman - 2006 - Journal of Symbolic Logic 71 (2):425 - 459.
Building iteration trees.Alessandro Andretta - 1991 - Journal of Symbolic Logic 56 (4):1369-1384.
Hierarchies achievable in simple games.Josep Freixas & Montserrat Pons - 2010 - Theory and Decision 68 (4):393-404.
Mathematical structures of simple voting games.Moshé Machover & Simon D. Terrington - unknown
Imagination and the puzzles of iteration.Shaun Nichols - 2002 - Analysis 62 (3):182-87.
On the logic of informational independence and its applications.Gabriel Sandu - 1993 - Journal of Philosophical Logic 22 (1):29 - 60.
Large cardinals and iteration trees of height ω.Alessandro Andretta - 1991 - Annals of Pure and Applied Logic 54 (1):1-15.
Digraph Competitions and Cooperative Games.René van Den Brink & Peter Borm - 2002 - Theory and Decision 53 (4):327-342.
Almost All Complex Quantifiers are Simple.Jakub Szymanik - 2010 - In C. Ebert, G. Jäger, M. Kracht & J. Michaelis (eds.), Mathematics of Language 10/11, Lecture Notes in Computer Science 6149. Springer.
A weak Dodd-Jensen lemma.Itay Neeman & John Steel - 1999 - Journal of Symbolic Logic 64 (3):1285-1294.
Population monotonic path schemes for simple games.Barış Çiftçi, Peter Borm & Herbert Hamers - 2010 - Theory and Decision 69 (2):205-218.
Ordinal equivalence of power notions in voting games.Lawrence Diffo Lambo & Joël Moulen - 2002 - Theory and Decision 53 (4):313-325.
Games for truth.P. D. Welch - 2009 - Bulletin of Symbolic Logic 15 (4):410-427.
Generalized Dirac Equation with Induced Energy-Dependent Potential via Simple Similarity Transformation and Asymptotic Iteration Methods.T. Barakat & H. A. Alhendi - 2013 - Foundations of Physics 43 (10):1171-1181.

Analytics

Added to PP
2014-01-16

Downloads
8 (#1,249,165)

6 months
2 (#1,157,335)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Strong cardinals in the core model.Kai Hauser & Greg Hjorth - 1997 - Annals of Pure and Applied Logic 83 (2):165-198.

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.
Iteration Trees.D. A. Martin & J. R. Steel - 2002 - Bulletin of Symbolic Logic 8 (4):545-546.
The well-foundedness of the Mitchell order.J. R. Steel - 1993 - Journal of Symbolic Logic 58 (3):931-940.

Add more references