We consider two combinatorial principles, and . Both are easily proved in plus induction. We give two proofs of in , using different methods to eliminate the use of induction. Working in the weakened base system , we prove that is equivalent to induction and is equivalent to induction. We conclude with a Weihrauch analysis of the principles, showing .
V.Brattka and G.Gherardi, Effective choice and boundedness principles in computable analysis, Bull. Symbolic Logic17(1) (2011), 73–117. doi:10.2178/bsl/1294186663.
2.
V.Brattka, G.Gherardi and R.Hölzl, Probabilistic computability and choice, Inform. and Comput.242 (2015), 249–286. doi:10.1016/j.ic.2015.03.005.
3.
V.Brattka, G.Gherardi and A.Pauly, Weihrauch Complexity in Computable Analysis, 2017, 50+xi pages, arXiv:1707.03202.
4.
C.T.Chong, T.A.Slaman and Y.Yang, The metamathematics of stable Ramsey’s theorem for pairs, J. Amer. Math. Soc.27(3) (2014), 863–892. doi:10.1090/S0894-0347-2014-00789-X.
5.
J.Corduan, M.J.Groszek and J.R.Mileti, Reverse mathematics and Ramsey’s property for trees, J. Symbolic Logic75(3) (2010), 945–954. doi:10.2178/jsl/1278682209.
6.
C.Davis, J.Hirst, J.Pardo and T.Ransom, Reverse mathematics and colorings of hypergraphs, Arch. Math. Logic (2018). doi:10.1007/s00153-018-0654-z.
7.
J.L.Hirst, Disguising induction: Proofs of the pigeonhole principle for trees, in: Foundational Adventures, Tributes, Vol. 22, Coll. Publ., London, 2014, pp. 113–123, https://foundationaladventures.wordpress.com.
8.
J.L.Hirst and C.Mummert, Reverse mathematics of matroids, in: Computability and Complexity, Lecture Notes in Comput. Sci., Vol. 10010, Springer, Cham, 2017, pp. 143–159, https://link.springer.com/chapter/10.1007. doi:10.1007/978-3-319-50062-1_12.
9.
E.Neumann and A.Pauly, A topological view on algebraic computation models, J. Complexity44 (2018), 1–22. doi:10.1016/j.jco.2017.08.003.
10.
L.Patey and K.Yokoyama, The proof-theoretic strength of Ramsey’s theorem for pairs and two colors, Adv. Math.330 (2018), 1034–1070. doi:10.1016/j.aim.2018.03.035.
11.
A.Pauly, On the (semi)lattices induced by continuous reducibilities, MLQ Math. Log. Q.56(5) (2010), 488–502. doi:10.1002/malq.200910104.
12.
S.G.Simpson, Subsystems of Second Order Arithmetic, Perspectives in Logic, 2nd edn, Cambridge University Press, Cambridge; Association for Symbolic Logic, Poughkeepsie, NY, 2009, p. 444. ISBN 978-0-521-88439-6. doi:10.1017/CBO9780511581007.
13.
S.G.Simpson and R.L.Smith, Factorization of polynomials and induction, Ann. Pure Appl. Logic31(2–3) (1986), 289–306. doi:10.1016/0168-0072(86)90074-6.