\(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs (Q436224)

This paper solves some important problems in the context of determining the strength, in the sense of reverse mathematics, of Ramsey's theorem for pairs (\(\mathrm{RT}^2_2\)). In more detail, for \(\mathrm{RT}^2_2\) it is known that the \(\Pi^1_1\)-consequences of it relative to the system \(\mathsf{RCA}_0\) lie between \(\Sigma^0_2\)-bounding and \(\Sigma^0_2\)-induction; see [\textit{P. Cholak} et al., J. Symb. Log. 66, No.~1, 1--55 (2001; Zbl 0977.03033)]. In this paper the authors show that the \(\Pi^1_1\)-consequences of the cohesive principles, the ascending-descending principle and the chain-antichain principle -- all consequences of \(\mathrm{RT}^2_2\) -- coincide with those of \(\Sigma^0_2\)-bounding. These results are proven using forcing over nonstandard models.