Ramsey's theorem and products in the Weihrauch degrees
Damir D. Dzhafarov, Jun Le Goh, Denis R. Hirschfeldt, Ludovic Patey, and Arno Pauly

TL;DR
This paper investigates the structure of the Weihrauch lattice concerning combinatorial principles related to Ramsey's theorem, revealing new relationships between these principles and their computational strengths.
Contribution
It provides new insights into the Weihrauch degrees of Ramsey-type principles, including answering an open question about the relative strength of RT^2_2.
Findings
RT^2_2 is strictly below the product of SRT^2_2 and COH in the Weihrauch lattice.
The paper clarifies the computational complexity relationships among Ramsey's theorem variants.
It advances understanding of the Weihrauch degrees of combinatorial principles.
Abstract
We study the positions in the Weihrauch lattice of parallel products of various combinatorial principles related to Ramsey's theorem. Among other results, we obtain an answer to a question of Brattka, by showing that Ramsey's theorem for pairs () is strictly Weihrauch below the parallel product of the stable Ramsey's theorem for pairs and the cohesive principle ().
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
