{
  "id": "1806.04917",
  "version": "v1",
  "published": "2018-06-13T09:36:13.000Z",
  "updated": "2018-06-13T09:36:13.000Z",
  "title": "On finitary Hindman's numbers",
  "authors": [
    "Shahram Mohsenipour",
    "Saharon Shelah"
  ],
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-06-13T09:36:13.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "finitary hindmans numbers",
      "hindmans theorem",
      "primitive recursive upper bounds",
      "paris-harrington version",
      "positive answer"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}