Axiom of projective determinacy
From Wikipedia, the free encyclopedia
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 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 undecidable in ZFC, unlike the full axiom of determinacy (AD), which contradicts the Axiom of Choice. PD follows from certain large cardinal axioms, such as the existence of infinitely many Woodin cardinals.
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.
[edit] References
- Martin, Donald A. and John R. Steel (Jan., 1989). "A Proof of Projective Determinacy". Journal of the American Mathematical Society 2 (1): 71-125.
- Moschovakis, Yiannis N. (1980). Descriptive Set Theory. North Holland. ISBN 0-444-70199-0.
 |
This mathematical logic-related article is a stub. You can help Wikipedia by expanding it. |
