The reverse mathematics of non-decreasing subsequences
- 53 Downloads
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.
KeywordsReverse mathematics Non-decreasing subsequence Ramsey’s theorem
Mathematics Subject Classification03B30 03F35
Unable to display preview. Download preview PDF.
- 6.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/
- 7.Hirschfeldt, D.R.: Some questions in computable mathematics. In: Computability and Complexity, pp. 22–55. Springer International Publishing (2017)Google Scholar
- 12.Patey, L.: Iterative forcing and hyperimmunity in reverse mathematics. Computability (2015). doi: 10.3233/COM-160062