Long games and -projective sets
From MaRDI portal
Publication:2659104
Abstract: We prove a number of results on the determinacy of -projective sets of reals, i.e., those belonging to the smallest pointclass containing the open sets and closed under complements, countable unions, and projections. We first prove the equivalence between -projective determinacy and the determinacy of certain classes of games of variable length (Theorem 2.4). We then give an elementary proof of the determinacy of -projective sets from optimal large-cardinal hypotheses (Theorem 4.4). Finally, we show how to generalize the proof to obtain proofs of the determinacy of -projective games of a given countable length and of games with payoff in the smallest -algebra containing the projective sets, from corresponding assumptions (Theorems 5.1 and 5.4).
Recommendations
- scientific article; zbMATH DE number 2222012
- Perfect subsets of generalized Baire spaces and long games
- Projective games on the reals
- Infinite games and \(\sigma\)-porosity
- \(\mu\)-\(\sigma\) games
- Games and Lindström theorems
- Extended concavification and exact games
- Ehrenfeucht-Fraïssé games in finite set theory
- Filtration games and potentially projective modules
Cites work
- An outline of inner model theory
- Analytic determinacy and 0#
- Deconstructing inner model theory
- Descriptive set theory
- GAMES OF LENGTH ω1
- scientific article; zbMATH DE number 567513 (Why is no real title available?)
- scientific article; zbMATH DE number 2222012 (Why is no real title available?)
- Large cardinals from determinacy
- Mice with finitely many Woodin cardinals from optimal determinacy hypotheses
- On the axiom of determinateness
- Optimal Proofs of Determinacy
- OPTIMAL PROOFS OF DETERMINACY II
- Pure and hybrid mice with finitely many Woodin cardinals from levels of determinacy
- The determinacy of long games
Cited in
(10)- Projective games on the reals
- Determinate logic and the axiom of choice
- Long Borel games
- Projective Hausdorff gaps
- On Some σ‐Algebras Containing the Projective Sets I
- SHORTENING CLOPEN GAMES
- GAMES AND INDUCTION ON REALS
- The consistency strength of long projective determinacy
- An undecidable extension of Morley's theorem on the number of countable models
- Determinacy axioms and large cardinals
This page was built for publication: Long games and \(\sigma \)-projective sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2659104)