Sh:1146
- Mohsenipour, S., & Shelah, S. (2019). On finitary Hindman numbers. Combinatorica, 39(5), 1185–1189. arXiv: 1806.04917 DOI: 10.1007/s00493-019-4002-7 MR: 4039607
-
Abstract:
Spencer asked whether the Paris-Harrington version of Hindman’s theorem has primitive recursive upper bounds. We give a positive answer to this question. - published version (5p)
Bib entry
@article{Sh:1146,
author = {Mohsenipour, Shahram and Shelah, Saharon},
title = {{On finitary Hindman numbers}},
journal = {Combinatorica},
fjournal = {Combinatorica. An International Journal on Combinatorics andthe Theory of Computing},
volume = {39},
number = {5},
year = {2019},
pages = {1185--1189},
issn = {0209-9683},
mrnumber = {4039607},
mrclass = {05D10},
doi = {10.1007/s00493-019-4002-7},
note = {\href{https://arxiv.org/abs/1806.04917}{arXiv: 1806.04917}},
arxiv_number = {1806.04917}
}