{
  "id": "1610.07500",
  "version": "v1",
  "published": "2016-10-24T17:22:15.000Z",
  "updated": "2016-10-24T17:22:15.000Z",
  "title": "\"Weak yet strong\" restrictions of Hindman's Finite Sums Theorem",
  "authors": [
    "Lorenzo Carlucci"
  ],
  "categories": [
    "math.LO",
    "math.CO"
  ],
  "abstract": "We present a natural restriction of Hindman's Finite Sums Theorem that admits a simple combinatorial proof (one that does not also prove the full Finite Sums Theorem) and low computability-theoretic and proof-theoretic upper bounds, yet implies the existence of the Turing Jump, thus realizing the only known lower bound for the full Finite Sums Theorem. This is the first example of this kind. In fact we isolate a rich family of similar restrictions of Hindman's Theorem with analogous properties.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-10-24T17:22:15.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "hindmans finite sums theorem",
      "full finite sums theorem",
      "simple combinatorial proof",
      "proof-theoretic upper bounds",
      "natural restriction"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}