Optimal proofs of determinacy II

Journal of Mathematical Logic 2 (2):227-258 (2002)
  Copy   BIBTEX

Abstract

We present a general lemma which allows proving determinacy from Woodin cardinals. The lemma can be used in many different settings. As a particular application we prove the determinacy of sets in [Formula: see text], n ≥ 1. The assumption we use to prove [Formula: see text] determinacy is optimal in the base theory of [Formula: see text] determinacy.

Categories

Keywords

Reprint years

DOI

10.1142/s0219061302000175

Links

PhilArchive



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

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

Optimal proofs of determinacy.Itay Neeman - 1995 - Bulletin of Symbolic Logic 1 (3):327-339.
Unraveling Π11 sets.Itay Neeman - 2000 - Annals of Pure and Applied Logic 106 (1-3):151-205.
The strength of Blackwell determinacy.Donald A. Martin, Itay Neeman & Marco Vervoort - 2003 - Journal of Symbolic Logic 68 (2):615-636.
Determinacy for Games Ending at the First Admissible Relative to the Play.Itay Neeman - 2006 - Journal of Symbolic Logic 71 (2):425 - 459.
Representationalism and the determinacy of visual content.Ben Bronner - 2015 - Philosophical Psychology 28 (2):227-239.
The equivalence of determinacy and iterated sharps.Derrick Albert Dubose - 1990 - Journal of Symbolic Logic 55 (2):502-525.
Determinacy and the sharp function on the reals.Derrick Albert DuBose - 1991 - Annals of Pure and Applied Logic 54 (1):59-85.
The Determinacy of Long Games.Itay Neeman - 2006 - Bulletin of Symbolic Logic 12 (2):299-302.
A Metasemantic Challenge for Mathematical Determinacy.Jared Warren & Daniel Waxman - 2020 - Synthese 197 (2):477-495.
An extension of borel determinacy.Donald A. Martin - 1990 - Annals of Pure and Applied Logic 49 (3):279-293.
Intuitionistic Games: Determinacy, Completeness, and Normalization.Paweł Urzyczyn - 2016 - Studia Logica 104 (5):957-1001.
Determinacy and the sharp function on the reals.Derrick Albert DuBose - 1992 - Annals of Pure and Applied Logic 55 (3):237-263.
Progress measures, immediate determinacy, and a subset construction for tree automata.Hiroshi Nakano - 1994 - Annals of Pure and Applied Logic 69 (2-3):243-268.
Progress measures, immediate determinacy, and a subset construction for tree automata.Nils Klarlund - 1994 - Annals of Pure and Applied Logic 69 (2-3):243-268.
Equivalence between Wadge and Lipschitz determinacy.Alessandro Andretta - 2003 - Annals of Pure and Applied Logic 123 (1-3):163-192.

Analytics

Added to PP
2012-09-02

Downloads
32 (#487,332)

6 months
9 (#290,637)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Long games and σ-projective sets.Juan P. Aguilera, Sandra Müller & Philipp Schlicht - 2021 - Annals of Pure and Applied Logic 172 (4):102939.
Note on Implying.Sean Cody - 2024 - Journal of Symbolic Logic 89 (1):211-217.

View all 8 citations / Add more citations

References found in this work

Optimal proofs of determinacy.Itay Neeman - 1995 - Bulletin of Symbolic Logic 1 (3):327-339.
Analytic determinacy and 0#. [REVIEW]Leo Harrington - 1978 - Journal of Symbolic Logic 43 (4):685 - 693.

Add more references