Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees
From MaRDI portal
Publication:2155503
DOI10.1007/S00153-021-00814-2zbMath1506.03061OpenAlexW4205809420MaRDI QIDQ2155503
Daniele Tavernelli, Lorenzo Carlucci
Publication date: 15 July 2022
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-021-00814-2
Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hilbert versus Hindman
- A weak variant of Hindman's theorem stronger than Hilbert's theorem
- Finite sums from sequences within cells of a partition of N
- New bounds on the strength of some restrictions of Hindman's theorem
- On the strength of Ramsey's theorem for trees
- Effectiveness of Hindman’s Theorem for Bounded Sums
- Open Questions in Reverse Mathematics
- Slicing the Truth
- Reverse mathematics, computability, and partitions of trees
- “Weak yet strong” restrictions of Hindman’s Finite Sums Theorem
- Open Problems in Partition Regularity
- Reverse mathematics and Ramsey's property for trees
- New bounds on the strength of some restrictions of Hindman’s Theorem
- The reverse mathematics of Hindman’s Theorem for sums of exactly two elements
- Ramsey's theorem and recursion theory
This page was built for publication: Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees
