Abstract
Every function over the natural numbers has an infinite subdomain on which the function is non-decreasing. Motivated by a question of Dzhafarov and Schweber, we study the reverse mathematics of variants of this statement. It turns out that this statement restricted to computably bounded functions is computationally weak and does not imply the existence of the halting set. On the other hand, we prove that it is not a consequence of Ramsey’s theorem for pairs. This statement can therefore be seen as an arguably natural principle between the arithmetic comprehension axiom and stable Ramsey’s theorem for pairs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brattka, V., Gherardi, G.: Weihrauch degrees, omniscience principles and weak computability. J. Symb. Log. 76(1), 143–176 (2011). doi:10.2178/jsl/1294170993
Cholak, P.A., Jockusch, C.G., Slaman, T.A.: On the strength of Ramsey’s theorem for pairs. J. Symb. Log. 66(01), 1–55 (2001)
Chong, C., Lempp, S., Yang, Y.: On the role of the collection principle for \(\varSigma ^0_2\)-formulas in second-order reverse mathematics. Proc. Am. Math. Soc. 138(3), 1093–1100 (2010)
Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Springer, New York (2010)
Dzhafarov, D.D., Jockusch, C.G.: Ramsey’s theorem and cone avoidance. J. Symb. Log. 74(2), 557–578 (2009)
Dzhafarov, D.D., Schweber, N.: Finding limit-nondecreasing sets for certain functions (2016). http://mathoverflow.net/questions/227766/finding-limit-nondecreasing-sets-for-certain-functions/
Hirschfeldt, D.R.: Some questions in computable mathematics. In: Computability and Complexity, pp. 22–55. Springer International Publishing (2017)
Hirschfeldt, D.R., Shore, R.A.: Combinatorial principles weaker than Ramsey’s theorem for pairs. J. Symb. Log. 72(1), 171–206 (2007)
Hirschfeldt, D.R., Shore, R.A., Slaman, T.A.: The atomic model theorem and type omitting. Trans. Am. Math. Soc. 361(11), 5805–5837 (2009)
Jockusch, C.G., Soare, R.I.: \(\varPi ^0_1\) classes and degrees of theories. Trans. Am. Math. Soc. 173, 33–56 (1972)
Liu, L.: Cone avoiding closed sets. Trans. Am. Math. Soc. 367(3), 1609–1630 (2015). doi:10.1090/S0002-9947-2014-06049-2
Patey, L.: Iterative forcing and hyperimmunity in reverse mathematics. Computability (2015). doi:10.3233/COM-160062
Simpson, S.G.: Subsystems of Second Order Arithmetic. Cambridge University Press, Cambridge (2009)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Patey, L. The reverse mathematics of non-decreasing subsequences. Arch. Math. Logic 56, 491–506 (2017). https://doi.org/10.1007/s00153-017-0536-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-017-0536-9