Spencer asked whether the Paris-Harrington version of Hindman's theorem has primitive recursive upper bounds. We give a positive answer to this question.
A Simple Proof and Some Difficult Examples for Hindman's Theorem
Hindman's Theorem, Ellis's Lemma, and Thompson's group $F$
On the orthogonal Grünbaum partition problem in dimension three
![QR code for arXiv:1806.04917 [math.CO]](http://oss.arxitics.com/images/favicon.svg)