Equivalence of partition properties and determinacy

DOI10.1073/pnas.80.6.1783zbMath0523.03035OpenAlexW2043378229WikidataQ37607222 ScholiaQ37607222MaRDI QIDQ3674640

W. Hugh Woodin, Alexander S. Kechris

Publication date: 1983

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.80.6.1783

zbMATH Keywords

infinite gameaxiom of determinacySuslin setspartition propertiesZF set theoryrelative constructibilityL(R)smallest inner model of set theory containing the reals

Mathematics Subject Classification ID

Descriptive set theory (03E15) Large cardinals (03E55) Other combinatorial set theory (03E05) Determinacy principles (03E60)

Related Items (17)

The Strength of Blackwell determinacy ⋮ OPTIMAL PROOFS OF DETERMINACY II ⋮ Determinacy of Banach games ⋮ The consistency strength of projective absoluteness ⋮ Determinacy from strong reflection ⋮ Turing Determinacy and Suslin sets ⋮ \(\Pi_ 2^ 1\) Wadge degrees ⋮ Choiceless Ramsey theory of linear orders ⋮ Optimal Proofs of Determinacy ⋮ The Jensen Covering Property ⋮ NOTE ON IMPLYING ⋮ PFA and guessing models ⋮ Approximation of analytic by Borel sets and definable countable chain conditions ⋮ Mathias and set theory ⋮ Determined admissible sets ⋮ GAMES AND REFLECTION IN ⋮ GAMES AND INDUCTION ON REALS

This page was built for publication: Equivalence of partition properties and determinacy