{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:00:59Z","timestamp":1725858059143},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319401881"},{"type":"electronic","value":"9783319401898"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40189-8_19","type":"book-chapter","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T11:34:07Z","timestamp":1465817647000},"page":"182-191","source":"Crossref","is-referenced-by-count":0,"title":["Computable Reductions and Reverse Mathematics"],"prefix":"10.1007","author":[{"given":"Reed","family":"Solomon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"unstructured":"Astor, E.P., Dzhafarov, D.D., Solomon, R., Suggs, J.: The uniform content of partial and linear orders (in preparation)","key":"19_CR1"},{"key":"19_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2694910","volume":"66","author":"PA Cholak","year":"2001","unstructured":"Cholak, P.A., Jockusch Jr., C.G., Slaman, T.A.: On the strength of Ramsey\u2019s theorem for pairs. J. Symb. Log. 66, 1\u201355 (2001)","journal-title":"J. Symb. Log."},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1090\/S0002-9939-09-10115-6","volume":"138","author":"CT Chong","year":"2010","unstructured":"Chong, C.T., Lempp, S., Yang, Y.: On the role of collection principles for $$\\Sigma ^0_2$$ \u03a3 2 0 formulas in second-order reverse mathematics. Proc. Am. Math. Soc. 138, 1093\u20131100 (2010)","journal-title":"Proc. Am. Math. Soc."},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1090\/S0894-0347-2014-00789-X","volume":"27","author":"CT Chong","year":"2014","unstructured":"Chong, C.T., Slaman, T.A., Yang, Y.: The metamathematics of stable Ramsey\u2019s theorem for pairs. J. Am. Math Soc. 27, 863\u2013892 (2014)","journal-title":"J. Am. Math Soc."},{"issue":"2","key":"19_CR5","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1090\/tran\/6465","volume":"368","author":"FG Dorais","year":"2016","unstructured":"Dorais, F.G., Dzhafarov, D.D., Hirst, J.L., Mileti, J.R., Shafer, P.: On uniform relationships between combinatorial problems. Trans. Am. Math. Soc. 368(2), 1321\u20131359 (2016)","journal-title":"Trans. Am. Math. Soc."},{"key":"19_CR6","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$$ \u0394 2 0 set with no infinite low set in either it or its complement. J. Symb. Log. 66, 1371\u20131381 (2001)","journal-title":"J. Symb. Log."},{"unstructured":"Dzhafarov, D.D.: Strong reducibilities between combinatorial principles. J. Symb. Log. (to appear)","key":"19_CR7"},{"unstructured":"Dzhafarov, D.D., Patey, L., Solomon, R., Westrick, L.B.: Ramsey\u2019s theorem for singletons and strong computable reducibility (submitted)","key":"19_CR8"},{"unstructured":"Hirschfeldt, D.R., Jockusch Jr., C.G.: On notions of computability theoretic reduction between $$\\Pi ^1_2$$ \u03a0 2 1 principles. J. Math. Logic (to appear)","key":"19_CR9"},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.2178\/jsl\/1174668391","volume":"72","author":"DR Hirschfeldt","year":"2007","unstructured":"Hirschfeldt, D.R., Shore, R.A.: Combinatorial principles weaker than Ramsey\u2019s theorem for pairs. J. Symb. Log. 72, 171\u2013206 (2007)","journal-title":"J. Symb. Log."},{"unstructured":"Patey, L.: The weakness of being cohesive, thin or free in reverse mathematics. Isr. J. Math. (to appear)","key":"19_CR11"},{"unstructured":"Rakotoniaina, T.: The computational strength of Ramsey\u2019s theorem. Ph.D. thesis, University of Cape Town (2015)","key":"19_CR12"}],"container-title":["Lecture Notes in Computer Science","Pursuit of the Universal"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40189-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T12:17:30Z","timestamp":1498306650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40189-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319401881","9783319401898"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40189-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}