{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T17:54:46Z","timestamp":1757699686113},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,2,18]],"date-time":"2010-02-18T00:00:00Z","timestamp":1266451200000},"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":[[2010,4]]},"DOI":"10.1007\/s00153-010-0179-6","type":"journal-article","created":{"date-parts":[[2010,2,17]],"date-time":"2010-02-17T12:38:26Z","timestamp":1266410306000},"page":"399-415","source":"Crossref","is-referenced-by-count":5,"title":["Ramsey\u2019s theorem for trees: the polarized tree theorem and notions of stability"],"prefix":"10.1007","volume":"49","author":[{"given":"Damir D.","family":"Dzhafarov","sequence":"first","affiliation":[]},{"given":"Jeffry L.","family":"Hirst","sequence":"additional","affiliation":[]},{"given":"Tamara J.","family":"Lakins","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,18]]},"reference":[{"key":"179_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., Slaman T.A.: On the strength of Ramsey\u2019s theorem for pairs. J. Symbolic Logic 66, 1\u201355 (2001)","journal-title":"J. Symbolic Logic"},{"key":"179_CR2","doi-asserted-by":"crossref","first-page":"1438","DOI":"10.2178\/jsl\/1254748700","volume":"74","author":"P.A. Cholak","year":"2009","unstructured":"Cholak P.A., Jockusch C.G., Slaman T.A.: Corrigendum to: on the strength of Ramsey\u2019s theorem for pairs. J. Symbolic Logic 74, 1438\u20131439 (2009)","journal-title":"J. Symbolic Logic"},{"key":"179_CR3","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1090\/S0002-9939-09-10115-6","volume":"138","author":"C.T. Chong","year":"2010","unstructured":"Chong C.T., Lempp S., Yang Y.: On the role of the collection principle for $${\\Sigma^0_2}$$ -formulas in second-order reverse mathematics. Proc. Amer. Math. Soc. 138, 1093\u20131100 (2010)","journal-title":"Proc. Amer. Math. Soc."},{"key":"179_CR4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.2178\/jsl\/1231082309","volume":"74","author":"J. Chubb","year":"2009","unstructured":"Chubb J., Hirst J.L., McNicholl T.H.: Reverse mathematics, computability, and partitions of trees. J. Symbolic Logic 74, 201\u2013215 (2009)","journal-title":"J. Symbolic Logic"},{"key":"179_CR5","unstructured":"Computability, Reverse Mathematics, and Combinatorics: Open Problems, Banff International Research Station (BIRS), Alberta, Canada (2008) http:\/\/robson.birs.ca\/~08w5019\/problems.pdf . Accessed 7 October 2009"},{"key":"179_CR6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s00153-008-0108-0","volume":"48","author":"D.D. Dzhafarov","year":"2009","unstructured":"Dzhafarov D.D., Hirst J.L.: The polarized Ramsey\u2019s theorem. Arch. Math. Logic 48, 141\u2013157 (2009)","journal-title":"Arch. Math. Logic"},{"key":"179_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, 171\u2013206 (2007)","journal-title":"J. Symbolic Logic"},{"key":"179_CR8","doi-asserted-by":"crossref","first-page":"489","DOI":"10.2307\/2586482","volume":"64","author":"T. Hummel","year":"1999","unstructured":"Hummel T., Jockusch C.G. Jr: Generalized cohesiveness. J. Symbolic Logic 64, 489\u2013516 (1999)","journal-title":"J. Symbolic Logic"},{"key":"179_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, 268\u2013280 (1972)","journal-title":"J. Symbolic Logic"},{"key":"179_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"R.I. Soare","year":"1987","unstructured":"Soare R.I.: Recursively Enumerable Sets and Degrees. Springer, Berlin (1987)"},{"key":"179_CR11","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. Springer, Berlin (1999)"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-010-0179-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-010-0179-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-010-0179-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T19:36:43Z","timestamp":1558640203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-010-0179-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,18]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["179"],"URL":"https:\/\/doi.org\/10.1007\/s00153-010-0179-6","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,18]]}}}