Some results concerning the $\mathsf{SRT}^2_2$ vs. $\mathsf{COH}$ problem

TL;DR

This paper explores the relationship between two key principles in computable combinatorics and reverse mathematics, focusing on techniques to understand whether one implies the other within Turing ideals.

Contribution

It develops new methods for analyzing the $ extsf{SRT}^2_2$ and $ extsf{COH}$ principles, advancing understanding of their interrelation and limitations.

Findings

Highlighted the current limits of techniques in the field

Identified new directions for future research

Provided partial results on the $ extsf{SRT}^2_2$ vs. $ extsf{COH}$ problem

Abstract

The $\mathsf{SRT}^2_2$ vs.\ $\mathsf{COH}$ problem is a central problem in computable combinatorics and reverse mathematics, asking whether every Turing ideal that satisfies the principle $\mathsf{SRT}^2_2$ also satisfies the principle $\mathsf{COH}$. This paper is a contribution towards further developing some of the main techniques involved in attacking this problem. We study several principles related to each of $\mathsf{SRT}^2_2$ and $\mathsf{COH}$, and prove results that highlight the limits of our current understanding, but also point to new directions ripe for further exploration.