On the determinacy of games on ordinals

DOI10.1016/0003-4843(81)90001-2zbMATH Open0489.03018OpenAlexW2014244506MaRDI QIDQ3950554FDOQ3950554

Authors: Alexander S. Kechris, Leo Harrington 

Publication date: 1981

Published in: Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0003-4843(81)90001-2

zbMATH Keywords

ordinal gamesprojective setsaxiom of projective determinacyprojective ordinalscoding games on ordinals by games on natural numbersMoschovakis conjecture

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) Descriptive set theory (03E15) Determinacy principles (03E60)

Cited In (20)

• On the concept of 𝑃𝑖₁¹-completeness
• The axiom of determinacy and the modern development of descriptive set theory
• Ramsey theory without pigeonhole principle and the adversarial Ramsey principle
• Extended ultrapowers and the Vopěnka-Hrbáček theorem without choice
• Complexity of Ramsey null sets
• Hod mice and the Mouse Set Conjecture
• On the quasi-ordering of Borel linear orders under embeddability
• THE CONSISTENCY STRENGTH OF LONG PROJECTIVE DETERMINACY
• A Property Equivalent to the Existence of Scales
• On ⅁Γ-complete sets
• On the prewellorderings associated with the directed systems of mice
• Supercompactness within the projective hierarchy
• Iterated extended ultrapowers and supercompactness without choice
• Inner Models and Ultrafilters In L(ℝ)
• Partition properties and well-ordered sequences
• On the Ramsey property for sets of reals
• Determinacy implies that \(\aleph_ 2\) is supercompact
• The weak square property
• The uniform Martin’s conjecture for many-one degrees
• On supercompactness of \(\omega_1\)

This page was built for publication: On the determinacy of games on ordinals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3950554)