{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T21:45:00Z","timestamp":1773179100157,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,10,31]],"date-time":"2008-10-31T00:00:00Z","timestamp":1225411200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s00153-008-0108-0","type":"journal-article","created":{"date-parts":[[2008,10,30]],"date-time":"2008-10-30T09:23:42Z","timestamp":1225358622000},"page":"141-157","source":"Crossref","is-referenced-by-count":15,"title":["The polarized Ramsey\u2019s theorem"],"prefix":"10.1007","volume":"48","author":[{"given":"Damir D.","family":"Dzhafarov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffry L.","family":"Hirst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,10,31]]},"reference":[{"issue":"1","key":"108_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2694910","volume":"66","author":"P.A. Cholak","year":"2001","unstructured":"Cholak P.A., Jockusch C.G. Jr, Slaman T.A.: On the strength of Ramsey\u2019s theorem for pairs. J. Symbolic Logic 66(1), 1\u201355 (2001)","journal-title":"J. Symbolic Logic"},{"issue":"3","key":"108_CR2","doi-asserted-by":"crossref","first-page":"1371","DOI":"10.2307\/2695113","volume":"66","author":"R. Downey","year":"2001","unstructured":"Downey R., Hirschfeldt D.R., Lempp S., Solomon R.: A $${\\Delta^0_2}$$ set with no infinite low subset in either it or its complement. J. Symbolic Logic 66(3), 1371\u20131381 (2001)","journal-title":"J. Symbolic Logic"},{"key":"108_CR3","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1090\/S0002-9904-1956-10036-0","volume":"62","author":"P. Erd\u0151s","year":"1965","unstructured":"Erd\u0151s P., Rado R.: A partition calculus in set theory. Bull. Am. Math. Soc. 62, 427\u2013489 (1965)","journal-title":"Bull. Am. Math. Soc."},{"issue":"3","key":"108_CR4","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.2307\/2586708","volume":"65","author":"M. Giusto","year":"2000","unstructured":"Giusto M., Simpson S.G.: Located sets and reverse mathematics. J. Symbolic Logic 65(3), 1451\u20131480 (2000)","journal-title":"J. Symbolic Logic"},{"key":"108_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22156-3","volume-title":"Metamathematics of first-order arithmetic. Perspectives in Mathematical Logic","author":"P. H\u00e1jek","year":"1993","unstructured":"H\u00e1jek P., Pudl\u00e1k P.: Metamathematics of first-order arithmetic. Perspectives in Mathematical Logic. Springer, Berlin (1993)"},{"key":"108_CR6","unstructured":"Hirschfeldt, D.R., Jockusch, C.G., Jr., Kjos-Hanssen, B., Lempp, S., Slaman, T.A.: The strength of some combinatorial principles related to Ramsey\u2019s theorem for pairs. In: Chong, C.T., Feng, Q., Slaman, T., Woodin, H., Yang, Y. (eds.) Proceedings of the Program on Computational Prospects of Infinity, Singapore 2005. World Scientific Press, Singapore (to appear) (2005)"},{"issue":"1","key":"108_CR7","doi-asserted-by":"crossref","first-page":"171","DOI":"10.2178\/jsl\/1174668391","volume":"72","author":"D.R. Hirschfeldt","year":"2007","unstructured":"Hirschfeldt D.R., Shore R.A.: Combinatorial principles weaker than Ramsey\u2019s theorem for pairs. J. Symbolic Logic 72(1), 171\u2013206 (2007)","journal-title":"J. Symbolic Logic"},{"key":"108_CR8","unstructured":"Hirst, J.L.: Combinatorics in subsystems of second order arithmetic, Ph.D. thesis, The Pennsylvania State University (1987)"},{"issue":"2","key":"108_CR9","doi-asserted-by":"crossref","first-page":"268","DOI":"10.2307\/2272972","volume":"37","author":"C.G. Jockusch Jr","year":"1972","unstructured":"Jockusch C.G. Jr: Ramsey\u2019s theorem and recursion theory. J. Symbolic Logic 37(2), 268\u2013280 (1972)","journal-title":"J. Symbolic Logic"},{"issue":"1","key":"108_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.2140\/pjm.1969.30.67","volume":"30","author":"C.G. Jockusch Jr","year":"1969","unstructured":"Jockusch C.G. Jr, McLaughlin T.G.: Countable retracing functions and $${\\Pi^0_2}$$ predicates. Pacific J. Math. 30(1), 67\u201393 (1969)","journal-title":"Pacific J. Math."},{"key":"108_CR11","unstructured":"Mileti, J.R.: Partition theorems and computability theory, Ph.D. thesis, University of Illinois at Urbana-Champaign (2004)"},{"issue":"3","key":"108_CR12","doi-asserted-by":"crossref","first-page":"411","DOI":"10.2178\/bsl\/1122038995","volume":"11","author":"J.R. Mileti","year":"2005","unstructured":"Mileti J.R.: Partition theorems and computability theory. Bull. Symbolic Logic 11(3), 411\u2013427 (2005)","journal-title":"Bull. Symbolic Logic"},{"key":"108_CR13","doi-asserted-by":"crossref","unstructured":"Seetapun, D., Slaman, T.A.: On the strength of Ramsey\u2019s theorem. Notre Dame J. Formal Logic 36(4), 570\u2013582. Special Issue: Models of arithmetic (1995)","DOI":"10.1305\/ndjfl\/1040136917"},{"key":"108_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59971-2","volume-title":"Subsystems of second order arithmetic","author":"S.G. Simpson","year":"1999","unstructured":"Simpson S.G.: Subsystems of second order arithmetic. Perspectives in Mathematical Logic, Springer-Verlag, Berlin (1999)"},{"key":"108_CR15","doi-asserted-by":"crossref","unstructured":"Soare, R.I.: Recursively enumerable sets and degrees. Perspectives in Mathematical Logic, Springer-Verlag, Berlin, A study of computable functions and computably generated sets (1987)","DOI":"10.1007\/978-3-662-02460-7"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-008-0108-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-008-0108-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-008-0108-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T15:36:42Z","timestamp":1558625802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-008-0108-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,31]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["108"],"URL":"https:\/\/doi.org\/10.1007\/s00153-008-0108-0","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,31]]}}}