The reverse mathematics of Hindman’s Theorem for sums of exactly two elements

DOI10.3233/COM-180094zbMath1448.03007arXiv1804.09809OpenAlexW2962887429MaRDI QIDQ5211065

Damir D. Dzhafarov, Carl G. jun. Jockusch, Denis R. Hirschfeldt, Linda Brown Westrick, Barbara F. Csima, D. Reed Solomon

Publication date: 17 January 2020

Published in: Computability (Search for Journal in Brave)

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

zbMATH Keywords

reverse mathematicsLovász local lemmaHindman's theoremaddition-like functions

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 (5)

Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees ⋮ Finiteness classes arising from Ramsey-theoretic statements in set theory without choice ⋮ A computable analysis of variable words theorems ⋮ Thin set versions of Hindman's theorem ⋮ Restrictions of Hindman's theorem: an overview

This page was built for publication: The reverse mathematics of Hindman’s Theorem for sums of exactly two elements