A weak variant of Hindman's theorem stronger than Hilbert's theorem

DOI10.1007/s00153-017-0576-1zbMath1384.03094arXiv1610.05445OpenAlexW2532759974MaRDI QIDQ1745357

Lorenzo Carlucci

Publication date: 17 April 2018

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

reverse mathematicsRamsey's theoremHindman's theoremcomputable combinatorics

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Second- and higher-order arithmetic and fragments (03F35)

Related Items (4)

Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees ⋮ The Adjacent Hindman’s Theorem for uncountable groups ⋮ New bounds on the strength of some restrictions of Hindman's theorem ⋮ Restrictions of Hindman's theorem: an overview

Cites Work

• Unnamed Item
• Unnamed Item
• Hilbert versus Hindman
• The polarized Ramsey's theorem
• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• 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 pairs
• Effectiveness of Hindman’s Theorem for Bounded Sums
• Open Questions in Reverse Mathematics
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
• “Weak yet strong” restrictions of Hindman’s Finite Sums Theorem
• Open Problems in Partition Regularity
• The Logical Strength of Büchi's Decidability Theorem
• The Existence of Certain Ultrafilters on N and a Conjecture of Graham and Rothschild

This page was built for publication: A weak variant of Hindman's theorem stronger than Hilbert's theorem