Hindman's theorem: an ultrafilter argument in second order arithmetic. Towsner, H. *J. Symbolic Logic*, 76(1):353–360, 2011. Journal Arxiv doi abstract bibtex 56 downloads 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.

@article {MR2791353,
AUTHOR = {Towsner, Henry},
TITLE = {Hindman's theorem: an ultrafilter argument in second order
arithmetic},
JOURNAL = {J. Symbolic Logic},
FJOURNAL = {Journal of Symbolic Logic},
VOLUME = {76},
YEAR = {2011},
NUMBER = {1},
PAGES = {353--360},
ISSN = {0022-4812},
CODEN = {JSYLA6},
MRCLASS = {03F35 (54D80)},
MRNUMBER = {2791353 (2012b:03165)},
MRREVIEWER = {M. Yasuhara},
DOI = {10.2178/jsl/1294171005},
URLJOURNAL= {http://dx.doi.org/10.2178/jsl/1294171005},
urlarxiv={http://arxiv.org/abs/0906.3882},
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.},
}

Downloads: 56

{"_id":{"_str":"51f58c5128e84a503b000007"},"__v":145,"authorIDs":["3GEPwq9joMrcxxoCw","4KQet7uefuvLzwtpx","545832462abc8e9f37000b09","5c8vhjzWNNjGW4qbh","5decfea43d02efdf010000be","5def8c8545114dde01000167","5df216ace4cb4ede0100016b","5e04f7d6fff612df01000139","5e07fc92cdee3adf0100003b","5e0b8c33ca6111df010000a2","5e0fd5b12cfae9df010000b2","5e10e8e545c12cde01000086","5e15529bedfb1ede01000156","5e1ae0065f3d2cdf01000075","5e25e33da6f19fde010000f0","5e2ecddbc2015cde01000106","5e2f2e7378a7cedf01000043","5e2f7d669ca24fdf010001e9","5e31874200e4e5de010000f3","5e349b4753b794de01000107","5e3871a21f8af9e0010000f6","5e3d9a82f33211df01000085","5e3daa13f33211df01000192","5e405ccaaeea22df0100009b","5e442d87e5a34dde010000ac","5e4a4b925675c1de01000107","5e51554afe5af9df01000104","5e52ae476a3abede0100003e","5e599979ad6c7fde0100004a","5e5c8dfa9933dade01000017","5e5d5d37ad47bcde010000c0","5e5e8a77c0a53dde01000054","5e5e9e03c0a53dde0100025f","5e64727de1ac00de010000d6","8eyEAbrHsTiQjrh7m","9xwKHbohnMHpGd326","AKhMye69vFo9ZBkJn","B8ktHCTYohgyN3zHd","BeL58hABvbynGFvkM","E6dySSeKcY8eAMMJB","EHJuZpHSt5bw4erqn","EjhY4z5ziCGtFZAAp","Fr8xk6h7QLy2uc6qT","HGCndpBQapLkeXcCv","JXPiBhJhKZpboe3cv","KYQ2gtq5nH4r2yEXs","M5pdPBbKqC9YYHd6n","PKNH7m7rTTAWiLt3x","Pz5HyZqksZg56dyuD","QJDeWCekzoGrAH7hG","QWy8CzoFcY4jkh9XS","RWoRfxCmeqb6fsA7N","RiWhh5sCAejRxYRtr","TdZKmjjXfpX5riMhc","W8K2TwaE7YMfqQquc","W9X6jnrT5WndXxz4f","WJ4bEb9E3XqnkvyCX","XMaQnCeR8pCaxKwS6","ZB6i2RZxTFGTnNJcr","ZfXCGDcjZMeE4QSqP","b9AcCuxsqzpiCMFsG","cNR3H4e3QEnD3WkbJ","cnQY9tt7BQH92KkyP","fDCSEz7FfSCxERX9L","fkakjW7HDbgrSiTnc","g2bZv9uHbxMAPTro2","mgLyDAsFS9g7HNyuT","n6SFWyWp7WHG5YnrG","nDtKTAspawBCun8X8","nJTiiRRLbohMDGYgA","nvTYkDHXvRYJbiLqm","o6p92SSgdiePc5yu8","oNpdLEjNerjoioXTr","qTYgvoePYaSXGnmPe","t9d9TPHkaTGkNr5RP","tYHK4CxbC8KJ8CgMF","vymEvveSkq34uS28E","wm9ugGRCbkcFjNxF5","xJZc77uii7zQDbato","xvWPite86SqosFSo5"],"author_short":["Towsner, H."],"bibbaseid":"towsner-hindmanstheoremanultrafilterargumentinsecondorderarithmetic-2011","bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Towsner"],"firstnames":["Henry"],"suffixes":[]}],"title":"Hindman's theorem: an ultrafilter argument in second order arithmetic","journal":"J. Symbolic Logic","fjournal":"Journal of Symbolic Logic","volume":"76","year":"2011","number":"1","pages":"353–360","issn":"0022-4812","coden":"JSYLA6","mrclass":"03F35 (54D80)","mrnumber":"2791353 (2012b:03165)","mrreviewer":"M. Yasuhara","doi":"10.2178/jsl/1294171005","urljournal":"http://dx.doi.org/10.2178/jsl/1294171005","urlarxiv":"http://arxiv.org/abs/0906.3882","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.","bibtex":"@article {MR2791353,\n AUTHOR = {Towsner, Henry},\n TITLE = {Hindman's theorem: an ultrafilter argument in second order\n arithmetic},\n JOURNAL = {J. Symbolic Logic},\n FJOURNAL = {Journal of Symbolic Logic},\n VOLUME = {76},\n YEAR = {2011},\n NUMBER = {1},\n PAGES = {353--360},\n ISSN = {0022-4812},\n CODEN = {JSYLA6},\n MRCLASS = {03F35 (54D80)},\n MRNUMBER = {2791353 (2012b:03165)},\nMRREVIEWER = {M. Yasuhara},\n DOI = {10.2178/jsl/1294171005},\n URLJOURNAL= {http://dx.doi.org/10.2178/jsl/1294171005},\nurlarxiv={http://arxiv.org/abs/0906.3882},\nabstract={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.},\n}\n\n\n\n","author_short":["Towsner, H."],"key":"MR2791353","id":"MR2791353","bibbaseid":"towsner-hindmanstheoremanultrafilterargumentinsecondorderarithmetic-2011","role":"author","urls":{"Journal":"http://dx.doi.org/10.2178/jsl/1294171005","Arxiv":"http://arxiv.org/abs/0906.3882"},"metadata":{"authorlinks":{"towsner, h":"https://www.sas.upenn.edu/~htowsner/index.html"}},"downloads":56,"html":""},"bibtype":"article","biburl":"www.sas.upenn.edu/~htowsner/papers.bib","downloads":56,"keywords":[],"search_terms":["hindman","theorem","ultrafilter","argument","second","order","arithmetic","towsner"],"title":"Hindman's theorem: an ultrafilter argument in second order arithmetic","title_words":["hindman","theorem","ultrafilter","argument","second","order","arithmetic"],"year":2011,"dataSources":["6NR8bS3FWz4thtH6K","HbyKaYarx2Kg7vovB"]}