Determinacy of Refinements to the Difference Hierarchy of Co-analytic Sets
Chris Le Sueur

TL;DR
This paper develops a technique to prove the determinacy of certain classes within the difference hierarchy of co-analytic sets, establishing bounds and bridging gaps in the understanding of their determinacy strength.
Contribution
It introduces a new method for proving determinacy of classes in the difference hierarchy of co-analytic sets from weak principles, extending previous results.
Findings
Established upper bounds for determinacy of classes ^2-\u03a0^1_1+\u03a3^0_lpha for all computable alpha
Proved determinacy for ^2-^1_1+\u2206^1_1 classes
Bridged the gap between known hypotheses for determinacy in this hierarchy.
Abstract
In this paper we develop a technique for proving determinacy of classes of the form (a refinement of the difference hierarchy on the co-analytic sets lying between and ) from weak principles, establishing upper bounds for the determinacy-strength of the classes for all computable and of . This bridges the gap between previously known hypotheses implying determinacy in this region.
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.
