New bounds on the strength of some restrictions of Hindman’s Theorem
From MaRDI portal
Publication:5131646
DOI10.3233/COM-190264zbMath1485.03023MaRDI QIDQ5131646
Francesco Lepore, Lorenzo Carlucci, Konrad Zdanowski, Leszek Aleksander Kołodziejczyk
Publication date: 9 November 2020
Published in: Computability (Search for Journal in Brave)
Related Items
Thin set versions of Hindman's theorem, Restrictions of Hindman's theorem: an overview, 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