(EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE

DOI10.1017/jsl.2022.92arXiv2107.02531OpenAlexW3182110633MaRDI QIDQ6203557

Marta Fiori-Carones, Paul Shafer, Alberto Marcone, Giovanni Soldà

Publication date: 5 April 2024

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theorycomputability theoryreverse mathematicspartial ordersrecursion theorysecond-order arithmetic

Mathematics Subject Classification ID

Partial orders, general (06A06) Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Second- and higher-order arithmetic and fragments (03F35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reverse mathematics, well-quasi-orders, and Noetherian spaces
• Reverse mathematics and initial intervals
• \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
• The inductive strength of Ramsey's theorem for pairs
• The maximal linear extension theorem in second order arithmetic
• On the strength of König's duality theorem for infinite bipartite graphs
• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• On the strength of Ramsey's theorem
• On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains
• On the strength of Ramsey's theorem for pairs
• RT₂² does not imply WKL₀
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
• On the Adjacency of Vertices to the Vertices of an Infinite Subgraph
• An Effective Version of Dilworth's Theorem
• ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM
• Partial orders and immunity in reverse mathematics
• THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS AND ARBITRARILY MANY COLORS
• An inside/outside Ramsey theorem and recursion theory
• SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS
• Cone avoiding closed sets
• A Theorem on Hypersimple Sets

This page was built for publication: (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE