On the determinacy of games on ordinals

DOI10.1016/0003-4843(81)90001-2zbMath0489.03018OpenAlexW2014244506MaRDI QIDQ3950554

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

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

Related Items

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