{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T03:46:07Z","timestamp":1787024767422,"version":"3.56.0"},"reference-count":10,"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":1837,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2009,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We examine the reverse mathematics and computability theory of a form of Ramsey's theorem in which the linear\n                    <jats:italic>n<\/jats:italic>\n                    -tuples of a binary tree are colored.\n                  <\/jats:p>","DOI":"10.2178\/jsl\/1231082309","type":"journal-article","created":{"date-parts":[[2009,1,4]],"date-time":"2009-01-04T10:18:44Z","timestamp":1231064324000},"page":"201-215","source":"Crossref","is-referenced-by-count":16,"title":["Reverse mathematics, computability, and partitions of trees"],"prefix":"10.1017","volume":"74","author":[{"given":"Jennifer","family":"Chubb","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeffry L.","family":"Hirst","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Timothy H.","family":"McNicholl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200003790_ref008","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(79)90101-8"},{"key":"S0022481200003790_ref004","first-page":"1301","volume":"59","author":"Hummel","year":"1994","journal-title":"Effective versions of Ramsey's theorem: Avoiding the cone above 0\u2032"},{"key":"S0022481200003790_ref010","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59971-2"},{"key":"S0022481200003790_ref001","first-page":"1","volume":"66","author":"Cholak","year":"2001","journal-title":"On the strength of Ramsey's theorem for pairs"},{"key":"S0022481200003790_ref002","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(83)90067-5"},{"key":"S0022481200003790_ref003","unstructured":"Hirst Jeffry L. , Combinatorics in subsystems of second order arithmetic, Ph.D. thesis, The Pennsylvania State University, 1987."},{"key":"S0022481200003790_ref005","first-page":"268","volume":"37","author":"Jockusch","year":"1972","journal-title":"Ramsey's theorem and recursion theory"},{"key":"S0022481200003790_ref006","first-page":"33","article-title":"classes and degrees of theories","volume":"173","author":"Jockusch","year":"1972","journal-title":"Transactions of the American Mathematical Society"},{"key":"S0022481200003790_ref007","unstructured":"McNicnoll Timothy H. , The inclusion problem for generalized frequency classes, Ph.D. thesis, The George Washington University, 1995."},{"key":"S0022481200003790_ref009","volume-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"}],"container-title":["The Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200003790","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T16:00:45Z","timestamp":1556640045000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200003790\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["S0022481200003790"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1231082309","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3]]}}}