The reverse mathematics of non-decreasing subsequences

DOI10.1007/s00153-017-0536-9zbMath1431.03021arXiv1603.08833OpenAlexW2962677447MaRDI QIDQ2402955

Ludovic Patey

Publication date: 15 September 2017

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.08833

zbMATH Keywords

reverse mathematicsRamsey's theoremnon-decreasing subsequence

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)

Uses Software

• MathOverflow

Cites Work

• Unnamed Item
• On the strength of Ramsey's theorem for pairs
• Some Questions in Computable Mathematics
• Weihrauch degrees, omniscience principles and weak computability
• Algorithmic Randomness and Complexity
• Iterative Forcing and Hyperimmunity in Reverse Mathematics
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
• Ramsey's theorem and cone avoidance
• The atomic model theorem and type omitting
• Cone avoiding closed sets
• ∏ 0 1 Classes and Degrees of Theories

This page was built for publication: The reverse mathematics of non-decreasing subsequences