Some results concerning the SRT22 vs. COH problem.

The SRT 2 2 vs. COH problem is a central problem in computable combinatorics and reverse mathematics, asking whether every Turing ideal that satisfies the principle SRT 2 2 also satisfies the principle 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 SRT 2 2 and COH , and prove results that highlight the limits of our current understanding, but also point to new directions ripe for further exploration. [ABSTRACT FROM AUTHOR]