A simple proof and some difficult examples for Hindman's theorem

DOI10.1215/00294527-1626518zbMath1253.03033arXiv0906.3885OpenAlexW2962863029MaRDI QIDQ424579

Henry Towsner

Publication date: 1 June 2012

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theoryreverse mathematicsHindman's theorem

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

Effectiveness of Hindman’s Theorem for Bounded Sums ⋮ ON THE STRENGTH OF TWO RECURRENCE THEOREMS ⋮ Transfinite approximation of Hindman's theorem ⋮ A combinatorial proof of the dense Hindman's theorem

Cites Work

• Algebra in the Stone-Čech compactification: theory and applications
• Finite sums from sequences within cells of a partition of N
• A short proof of Hindman's theorem
• Hindman's theorem: an ultrafilter argument in second order arithmetic
• Ultrafilters: Some old and some new results
• Unnamed Item
• Unnamed Item
• Unnamed Item