Strong Reductions between Relatives of the Stable Ramsey's Theorem
David Nichols

TL;DR
This paper thoroughly analyzes the computable reductions among various variants of the Stable Ramsey's Theorem, establishing precise relationships and non-reducibility results between them.
Contribution
It provides a complete characterization of the reducibility relations between different stable Ramsey-type principles.
Findings
Established strict non-reducibility between certain principles.
Mapped the reducibility hierarchy among the variants.
Clarified the computational strength differences between the principles.
Abstract
A complete analysis is given of the computable reductions that hold between , , and . In particular, while , it is shown that .
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
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory · semigroups and automata theory
