A parametrised choice principle and Martin's conjecture on Blackwell determinacy

Mathematical Logic Quarterly 52 (2):187-189 (2006)
  Copy   BIBTEX

Abstract

We define a parametrised choice principle PCP which is equivalent to the Axiom of Determinacy. PCP describes the difference between these two axioms and could serve as a means of proving Martin's conjecture on the equivalence of these axioms

Categories

Keywords

Reprint years

DOI

10.1002/malq.200410059

Links

PhilArchive



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

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

The strength of Blackwell determinacy.Donald A. Martin, Itay Neeman & Marco Vervoort - 2003 - Journal of Symbolic Logic 68 (2):615-636.
The axiom of real Blackwell determinacy.Daisuke Ikegami, David de Kloet & Benedikt Löwe - 2012 - Archive for Mathematical Logic 51 (7-8):671-685.
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.
Can Theories of Meaning and Reference Solve the Problem of Legal Determinacy?Brian H. Bix - 2003 - Ratio Juris 16 (3):281-295.
Determinacy and extended sharp functions on the reals, Part II: obtaining sharps from determinacy.Derrick Albert DuBose - 1992 - Annals of Pure and Applied Logic 58 (1):1-28.
Determinacy and the sharp function on objects of type K.Derrick Albert Dubose - 1995 - Journal of Symbolic Logic 60 (4):1025-1053.
Review: Donald A. Martin, John R. Steel, Projective Determinacy; W. Hugh Woodin, Supercompact Cardinals, Sets of Reals, and Weakly Homogeneous Trees; Donald A. Martin, John R. Steel, A Proof of Projective Determinacy. [REVIEW]Matthew D. Foreman - 1992 - Journal of Symbolic Logic 57 (3):1132-1136.
Determinacy of Wadge classes and subsystems of second order arithmetic.Takako Nemoto - 2009 - Mathematical Logic Quarterly 55 (2):154-176.
On the determinacy of valuation.John F. Post - 1984 - Philosophical Studies 45 (May):315-33.
Borel-amenable reducibilities for sets of reals.Luca Motto Ros - 2009 - Journal of Symbolic Logic 74 (1):27-49.
Variations of the Martin-Solovay tree.Greg Hjorth - 1996 - Journal of Symbolic Logic 61 (1):40-51.
Turing cones and set theory of the reals.Benedikt Löwe - 2001 - Archive for Mathematical Logic 40 (8):651-664.
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.

Analytics

Added to PP
2013-12-01

Downloads
9 (#1,176,028)

6 months
2 (#1,114,623)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Benedikt Löwe
University of Amsterdam

Citations of this work

No citations found.

Add more citations

References found in this work

The Determinacy of Blackwell Games.Donald A. Martin - 1998 - Journal of Symbolic Logic 63 (4):1565-1581.
The strength of Blackwell determinacy.Donald A. Martin, Itay Neeman & Marco Vervoort - 2003 - Journal of Symbolic Logic 68 (2):615-636.

Add more references