The following pages link to (Q3370069):
Displaying 6 items.
- A weak variant of Hindman's theorem stronger than Hilbert's theorem (Q1745357) (← links)
- New bounds on the strength of some restrictions of Hindman's theorem (Q2011655) (← links)
- Restrictions of Hindman's theorem: an overview (Q2117769) (← links)
- Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees (Q2155503) (← links)
- Finiteness classes arising from Ramsey-theoretic statements in set theory without choice (Q2662702) (← links)
- “Weak yet strong” restrictions of Hindman’s Finite Sums Theorem (Q4596010) (← links)
