Abstract
Spencer asked whether the Paris-Harrington version of the Folkman-Sanders theorem has primitive recursive upper bounds. We give a positive answer to this question.
Original language | English |
---|---|
Pages (from-to) | 1185-1189 |
Number of pages | 5 |
Journal | Combinatorica |
Volume | 39 |
Issue number | 5 |
DOIs |
|
State | Published - 1 Nov 2019 |
Bibliographical note
Publisher Copyright:© 2019, János Bolyai Mathematical Society and Springer-Verlag.