In mathematical logic, projective determinacy is the special case of the axiom of determinacy applying only to projective sets.

The axiom of projective determinacy, abbreviated PD, states that for any two-player infinite game of perfect information of length ω in which the players play natural numbers, if the victory set (for either player, since the projective sets are closed under complementation) is projective, then one player or the other has a winning strategy.

The axiom is not a theorem of ZFC (assuming ZFC is consistent), but unlike the full axiom of determinacy (AD), which contradicts the axiom of choice, it is not known to be inconsistent with ZFC. PD follows from certain large cardinal axioms, such as the existence of infinitely many Woodin cardinals.

Consequences

PD implies that all projective sets are Lebesgue measurable (in fact, universally measurable) and have the perfect set property and the property of Baire. It also implies that every projective binary relation may be uniformized by a projective set.

PD implies that for all positive integers , there is a largest countable set.[1]

References

  • Martin, Donald A.; Steel, John R. (Jan 1989). "A Proof of Projective Determinacy". Journal of the American Mathematical Society. 2 (1): 71–125. doi:10.2307/1990913. JSTOR 1990913.
  • Moschovakis, Yiannis N. (2009). Descriptive set theory (PDF) (2nd ed.). Providence, R.I.: American Mathematical Society. ISBN 978-0-8218-4813-5. Archived from the original on 2014-11-12.((cite book)): CS1 maint: bot: original URL status unknown (link)

Citations

  1. ^ Donald A. Martin, "The largest countable this, that, and the other". Cabal seminar 79–81, Proceedings, Caltech-UCLA Logic Seminar 1979–81, edited by A. S. Kechris, D. A. Martin, and Y. N. Moschovakis, Lecture notes in mathematics, vol. 1019, Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1983, pp. 97–106.


Categories