Thin set versions of Hindman's theorem

DOI10.1215/00294527-2022-0027OpenAlexW4311896176MaRDI QIDQ2108578

Sarah C. Reitzes, Denis R. Hirschfeldt

Publication date: 19 December 2022

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

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

zbMATH Keywords

reverse mathematicsHindman's theoremthin set theorem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite sums from sequences within cells of a partition of N
• On the strength of Ramsey's theorem
• Restrictions of Hindman's theorem: an overview
• Some logically weak Ramseyan theorems
• RT₂² does not imply WKL₀
• Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma
• Effectiveness of Hindman’s Theorem for Bounded Sums
• Open Problems in Partition Regularity
• 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
• Cone avoiding closed sets
• Ramsey's theorem and recursion theory

This page was built for publication: Thin set versions of Hindman's theorem