${\Sigma}^0_3$ determinacy and ${\mathbf{\Pi}}^1_2$ monotone induction
Sherwood Hachtman

TL;DR
This paper establishes an equivalence between a specific form of game determinacy and a model-theoretic principle involving monotone induction at a certain descriptive set-theoretic level.
Contribution
It proves that lightface _3 determinacy is equivalent to the existence of a wellfounded model satisfying ^1_2 monotone induction, linking game theory and set theory.
Findings
_3 determinacy is equivalent to ^1_2 monotone induction in a wellfounded model.
The work extends the understanding of the relationship between determinacy and induction principles.
It builds on recent results by Philip Welch to establish this equivalence.
Abstract
Building on recent work of Philip Welch, we prove that (lightface) determinacy is equivalent to the existence of a wellfounded model satisfying the axiom scheme of (boldface) monotone induction.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Economic theories and models
