Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
From MaRDI portal
Publication:2193942
DOI10.1007/s00029-020-00577-3zbMath1479.05349arXiv1807.00616OpenAlexW3045350351MaRDI QIDQ2193942
Keita Yokoyama, Leszek Aleksander Kołodziejczyk
Publication date: 25 August 2020
Published in: Selecta Mathematica. New Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.00616
First-order arithmetic and fragments (03F30) Generalized Ramsey theory (05C55) Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Second- and higher-order arithmetic and fragments (03F35)
Related Items (4)
HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK? ⋮ The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem ⋮ Weaker cousins of Ramsey's theorem over a weak base theory ⋮ In search of the first-order part of Ramsey's theorem for pairs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The inductive strength of Ramsey's theorem for pairs
- Rapidly growing Ramsey functions
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors
- On the strength of Ramsey's theorem
- The strength of infinitary Ramseyan principles can be accessed by their densities
- More on lower bounds for partitioning \(\alpha\)-large sets
- On interpretations of arithmetic and set theory
- On the strength of Ramsey's theorem for pairs
- Open Questions in Reverse Mathematics
- The metamathematics of Stable Ramsey’s Theorem for Pairs
- Partitioning 𝛼–large sets: Some lower bounds
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- A classification of rapidly growing Ramsey functions
- Some combinatorics involving ξ-large sets
- SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS
This page was built for publication: Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
