Mathematical logic and foundations Definition
Projective determinacy
Builds on DeterminacyProjective hierarchyBaire space of sequences
Definition
Projective determinacy (PD) is the following statement in the language of set theory. For every projective set , that is, every set in some level of the projective hierarchy, the game is determined.
Remarks
Example: every Borel set of the Baire space is projective, and its game is determined in ZFC by the Borel determinacy theorem. So the Borel instances of PD are theorems of ZFC.
Non-example: the axiom of choice gives a set whose game is not determined. PD does not cover this set, and under PD such a set is not projective.
For each , the statement that all games are determined is a separate hypothesis, and PD is the conjunction of all of them. The statement that all analytic games, the case , are determined follows from the existence of a measurable cardinal.
Reading path
To understand this page from the ground up, read these 10 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Baire space concept
- Complete metric space concept
- Determinacy concept
- Irrational number concept
- Natural numbers object
- Product topology concept
- Projective hierarchy concept
- Separable space concept
- Baire space of sequences object
- Projective determinacy definition
Further reading
About this page
| Tag | C5MA8PA2Q5 |
|---|---|
| URI | m2://C5MA8PA2Q5 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 03E60, 03E15, 03E55 |
| Defines | Projective determinacy |
| Uses | Determinacy, Projective hierarchy, Baire space of sequences |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.