New bounds on the strength of some restrictions of Hindman’s Theorem
From MaRDI portal
Publication:5131646
DOI10.3233/COM-190264zbMATH Open1485.03023MaRDI QIDQ5131646FDOQ5131646
Authors: Lorenzo Carlucci, Francesco Lepore, Konrad Zdanowski, Leszek Aleksander Kołodziejczyk 
Publication date: 9 November 2020
Published in: Computability (Search for Journal in Brave)
Recommendations
- New bounds on the strength of some restrictions of Hindman's theorem
- ``Weak yet strong restrictions of Hindman's finite sums theorem
- Restrictions of Hindman's theorem: an overview
- A new bound for a particular case of the Caccetta-Häggkvist conjecture
- scientific article; zbMATH DE number 741500
- A weak variant of Hindman's theorem stronger than Hilbert's theorem
- New bounds for Ryser’s conjecture and related problems
- A new bound of Mason´s theorem
- A new proof of Halász's theorem, and its consequences
- New bounds in Balog-Szemerédi-Gowers theorem
Cited In (11)
- The reverse mathematics of Hindman's theorem for sums of exactly two elements
- Restrictions of Hindman's theorem: an overview
- ``Weak yet strong restrictions of Hindman's finite sums theorem
- Effectiveness of Hindman’s Theorem for Bounded Sums
- Note on finitary Hindman numbers
- A weak variant of Hindman's theorem stronger than Hilbert's theorem
- New bounds on the strength of some restrictions of Hindman's theorem
- Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees
- Thin set versions of Hindman's theorem
- Title not available (Why is that?)
- Finiteness classes arising from Ramsey-theoretic statements in set theory without choice
This page was built for publication: New bounds on the strength of some restrictions of Hindman’s Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131646)
