Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees (Q2155503)

Working in the reverse mathematics framework, the authors analyze weak versions of Hindman's theorem in which the monochromatic sets correspond to sums related to certain paths through the full binary tree. The weakest version, \(\mathsf{HT^{bin}}\), is a consequence of the pigeonhole principle \(\mathsf{RT}^1\). They also consider the principle \(\mathsf{apHT^{bin}}\), which adds an apartness restriction to the monochromatic set, showing that \(\mathsf{apHT^{bin}}\) is equivalent to the induction scheme \(\mathsf{I}\Sigma^0_2\). Adding the same apartness principle to \(\mathsf{TT}^1\), the pigeonhole principle for trees, yields \(\mathsf{apTT}^1\) which is also shown to be equivalent to \(\mathsf{I}\Sigma^0_2\). These results contribute to the short list of combinatorial principles that are equivalent to \(\mathsf{I}\Sigma^0_2\). Additionally, they contribute to the study of variations of Hindman's theorem, including for example work of \textit{L. Carlucci} et al. [Lect. Notes Comput. Sci. 10307, 210--220 (2017; Zbl 1496.03242)], and \textit{D. D. Dzhafarov} et al. [Lect. Notes Comput. Sci. 10010, 134--142 (2017; Zbl 1480.03005)]. Related literature on \(\mathsf{TT}^1\) includes work of \textit{J. Corduan} et al. [J. Symb. Log. 75, No. 3, 945--954 (2010; Zbl 1203.03018)] and \textit{C. T. Chong} et al. [Adv. Math. 369, Article ID 107180, 38 p. (2020; Zbl 1444.03012)].