New bounds on the strength of some restrictions of Hindman's theorem

DOI10.1007/978-3-319-58741-7_21zbMath1496.03242arXiv1701.06095OpenAlexW2963872185MaRDI QIDQ2011655

Leszek Aleksander Kołodziejczyk, Francesco Lepore, Lorenzo Carlucci, Konrad Zdanowski

Publication date: 4 August 2017

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

Mathematics Subject Classification ID

Ramsey theory (05D10) Second- and higher-order arithmetic and fragments (03F35)

Related Items (2)

Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees ⋮ A weak variant of Hindman's theorem stronger than Hilbert's theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Hilbert versus Hindman
• The polarized Ramsey's theorem
• A weak variant of Hindman's theorem stronger than Hilbert's theorem
• Finite sums from sequences within cells of a partition of N
• On the strength of Ramsey's theorem for pairs
• THE STRENGTH OF RAMSEY’S THEOREM FOR COLORING RELATIVELY LARGE SETS
• Effectiveness of Hindman’s Theorem for Bounded Sums
• Open Questions in Reverse Mathematics
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• Slicing the Truth
• On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
• Open Problems in Partition Regularity
• Cohesive avoidance and strong reductions
• The Existence of Certain Ultrafilters on N and a Conjecture of Graham and Rothschild

This page was built for publication: New bounds on the strength of some restrictions of Hindman's theorem