Weaker cousins of Ramsey's theorem over a weak base theory
From MaRDI portal
Publication:2231700
DOI10.1016/j.apal.2021.103028zbMath1490.03012arXiv2105.11190OpenAlexW3187376792MaRDI QIDQ2231700
Leszek Aleksander Kołodziejczyk, Katarzyna W. Kowalik, Marta Fiori-Carones
Publication date: 30 September 2021
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.11190
First-order arithmetic and fragments (03F30) Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Nonstandard models of arithmetic (03H15) Second- and higher-order arithmetic and fragments (03F35)
Related Items (3)
Primitive recursive reverse mathematics ⋮ HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK? ⋮ In search of the first-order part of Ramsey's theorem for pairs
Cites Work
- Unnamed Item
- \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
- Categorical characterizations of the natural numbers require primitive recursion
- The self-embedding theorem of \(\text{WKL}_ 0\) and a non-standard method
- The degree of a \(\Sigma_ n\) cut
- Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors
- Reverse mathematics and Peano categoricity
- Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
- The uniform content of partial and linear orders
- Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\)
- On the strength of Ramsey's theorem for pairs
- Slicing the Truth
- Partition Theorems and Computability Theory
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- Corrigendum to: “On the strength of Ramsey's Theorem for pairs”
- A cohesive set which is not high
- On the strength of Ramsey's theorem without Σ1‐induction
- Constructing sequences one step at a time
- The jump of a Σ n -cut
- SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS
This page was built for publication: Weaker cousins of Ramsey's theorem over a weak base theory