{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T22:48:07Z","timestamp":1649112487991},"reference-count":12,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":1107,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2011,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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.<\/jats:p>","DOI":"10.2178\/jsl\/1294171005","type":"journal-article","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T15:22:35Z","timestamp":1294154555000},"page":"353-360","source":"Crossref","is-referenced-by-count":5,"title":["Hindman's theorem: an ultrafilter argument in second order arithmetic"],"prefix":"10.1017","volume":"76","author":[{"given":"Henry","family":"Towsner","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200002140_ref010","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59971-2"},{"key":"S0022481200002140_ref008","doi-asserted-by":"publisher","DOI":"10.1515\/9783110809220"},{"key":"S0022481200002140_ref007","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(74)90023-5"},{"key":"S0022481200002140_ref006","unstructured":"Shore Richard et al., Computability, reverse mathematics and combinatorics: Open problems, 12 2008, http:\/\/robson.Mrs.ca\/~08w5019\/problems.pdf."},{"key":"S0022481200002140_ref003","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/065\/891245"},{"key":"S0022481200002140_ref002","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(74)90103-4"},{"key":"S0022481200002140_ref012","unstructured":"Towsner Henry , A simple proof of Hindman's theorem, http:\/\/arxiv.org\/abs\/0906.3885."},{"key":"S0022481200002140_ref011","unstructured":"Towsner Henry , A combinatorial proof of the dense Hindman's theorem, http:\/\/arxiv.org\/abs\/1002.0347."},{"key":"S0022481200002140_ref001","doi-asserted-by":"publisher","DOI":"10.1007\/s001530050095"},{"key":"S0022481200002140_ref009","first-page":"65","volume":"69","author":"Hirst","year":"2004","journal-title":"Hindmari's theorem, ultrafilters, and reverse mathematics"},{"key":"S0022481200002140_ref005","volume-title":"Lectures on topological dynamics","author":"Ellis","year":"1969"},{"key":"S0022481200002140_ref004","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1977-14316-4"}],"container-title":["The Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200002140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T15:24:10Z","timestamp":1556378650000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200002140\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["S0022481200002140"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1294171005","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}