On finitary Hindman's numbers
Combinatorics
2018-12-18 v2
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.
Cite
@article{arxiv.1806.04917,
title = {On finitary Hindman's numbers},
author = {Shahram Mohsenipour and Saharon Shelah},
journal= {arXiv preprint arXiv:1806.04917},
year = {2018}
}