The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem

DOI10.4171/icm2022/106OpenAlexW4389820301MaRDI QIDQ6119673

Keita Yokoyama

Publication date: 24 March 2024

Published in: International Congress of Mathematicians (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4171/icm2022/106

zbMATH Keywords

proof theoryreverse mathematicsRamsey's theoremParis-Harrington principle

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) 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
• Unnamed Item
• Unnamed Item
• Phase transition results for three Ramsey-like theorems
• On Gödel incompleteness and finite combinatorics
• The self-embedding theorem of \(\text{WKL}_ 0\) and a non-standard method
• Rapidly growing Ramsey functions
• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• On the strength of Ramsey's theorem
• Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
• The strength of infinitary Ramseyan principles can be accessed by their densities
• More on lower bounds for partitioning \(\alpha\)-large sets
• On the strength of Ramsey's theorem for pairs
• RT₂² does not imply WKL₀
• Separating principles below
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• Slicing the Truth
• Partitioning 𝛼–large sets: Some lower bounds
• Some independence results for Peano arithmetic
• A classification of rapidly growing Ramsey functions
• On the logical strengths of partial solutions to mathematical problems
• THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS AND ARBITRARILY MANY COLORS
• Some combinatorics involving ξ-large sets
• Reverse mathematics and a Ramsey-type König's Lemma
• On the strength of Ramsey's theorem without Σ₁‐induction
• On Tao's “finitary” infinite pigeonhole principle
• Ramsey's theorem and recursion theory
• On the restricted ordinal theorem

This page was built for publication: The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem