Some results concerning the $\mathsf{SRT}^2_2$ vs. $\mathsf{COH}$ problem
Logic
2020-03-27 v2
Abstract
The vs.\ problem is a central problem in computable combinatorics and reverse mathematics, asking whether every Turing ideal that satisfies the principle also satisfies the principle . 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 and , and prove results that highlight the limits of our current understanding, but also point to new directions ripe for further exploration.
Cite
@article{arxiv.1901.10326,
title = {Some results concerning the $\mathsf{SRT}^2_2$ vs. $\mathsf{COH}$ problem},
author = {Peter A. Cholak and Damir D. Dzhafarov and Denis R. Hirschfeldt and Ludovic Patey},
journal= {arXiv preprint arXiv:1901.10326},
year = {2020}
}