{
  "id": "0906.3882",
  "version": "v1",
  "published": "2009-06-21T18:10:58.000Z",
  "updated": "2009-06-21T18:10:58.000Z",
  "title": "Hindman's Theorem: An Ultrafilter Argument in Second Order Arithmetic",
  "authors": [
    "Henry Towsner"
  ],
  "categories": [
    "math.LO",
    "math.CO"
  ],
  "abstract": "Hindman's Theorem is a prototypical example of a combinatorial theorem with a proof that uses the topology of the ultrafilters. We show how the methods of this proof, including topological arguments about ultrafilters, can be translated into second order arithmetic.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2009-06-21T18:10:58.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "second order arithmetic",
      "hindmans theorem",
      "ultrafilter argument",
      "combinatorial theorem"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0906.3882T"
    }
  }
}