Some Results Concerning the SRT22 vs. COH Problem

by Peter A. Cholak, Damir D. Dzhafarov, Denis R. Hirschfeldt, and Ludovic Patey



Status: Computability 9 (2020) 193 - 217

Availability: online journal version and preprint

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



drh@math.uchicago.edu