{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T02:40:33Z","timestamp":1777516833744,"version":"3.51.4"},"reference-count":12,"publisher":"SAGE Publications","issue":"3-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["COM"],"published-print":{"date-parts":[[2020,8,3]]},"DOI":"10.3233\/com-180244","type":"journal-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:18:37Z","timestamp":1565093917000},"page":"219-229","source":"Crossref","is-referenced-by-count":3,"title":["Combinatorial principles equivalent to weak induction"],"prefix":"10.1177","volume":"9","author":[{"given":"Caleb","family":"Davis","sequence":"first","affiliation":[{"name":"Department of Mathematical Sciences, Appalachian State University, NC, USA. davisc3@appstate.edu"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis\u00a0R.","family":"Hirschfeldt","sequence":"additional","affiliation":[{"name":"Department of Mathematics, The University of Chicago, IL, USA. drh@math.uchicago.edu"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffry","family":"Hirst","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Appalachian State University, NC, USA. hirstjl@appstate.edu"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jake","family":"Pardo","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Appalachian State University, NC, USA. pardo@alumni.nd.edu"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arno","family":"Pauly","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Swansea University, United Kingdom. arno.m.pauly@gmail.com"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keita","family":"Yokoyama","sequence":"additional","affiliation":[{"name":"School of Information Science, Japan Advanced Institute of Science and Technology, Japan. y-keita@jaist.ac.jp"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"issue":"1","key":"10.3233\/COM-180244_ref1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.2178\/bsl\/1294186663","article-title":"Effective choice and boundedness principles in computable analysis","volume":"17","author":"Brattka","year":"2011","journal-title":"Bull. Symbolic Logic"},{"key":"10.3233\/COM-180244_ref2","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.ic.2015.03.005","article-title":"Probabilistic computability and choice","volume":"242","author":"Brattka","year":"2015","journal-title":"Inform. and Comput."},{"issue":"3","key":"10.3233\/COM-180244_ref4","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1090\/S0894-0347-2014-00789-X","article-title":"The metamathematics of stable Ramsey\u2019s theorem for pairs","volume":"27","author":"Chong","year":"2014","journal-title":"J. Amer. Math. Soc."},{"issue":"3","key":"10.3233\/COM-180244_ref5","doi-asserted-by":"publisher","first-page":"945","DOI":"10.2178\/jsl\/1278682209","article-title":"Reverse mathematics and Ramsey\u2019s property for trees","volume":"75","author":"Corduan","year":"2010","journal-title":"J. Symbolic Logic"},{"key":"10.3233\/COM-180244_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00153-018-0654-z"},{"key":"10.3233\/COM-180244_ref7","unstructured":"J.L.\u00a0Hirst, Disguising induction: Proofs of the pigeonhole principle for trees, in: Foundational Adventures, Tributes, Vol.\u00a022, Coll. Publ., London, 2014, pp.\u00a0113\u2013123, https:\/\/foundationaladventures.wordpress.com."},{"key":"10.3233\/COM-180244_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50062-1_12"},{"key":"10.3233\/COM-180244_ref9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jco.2017.08.003","article-title":"A topological view on algebraic computation models","volume":"44","author":"Neumann","year":"2018","journal-title":"J. Complexity"},{"key":"10.3233\/COM-180244_ref10","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1016\/j.aim.2018.03.035","article-title":"The proof-theoretic strength of Ramsey\u2019s theorem for pairs and two colors","volume":"330","author":"Patey","year":"2018","journal-title":"Adv. Math."},{"issue":"5","key":"10.3233\/COM-180244_ref11","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1002\/malq.200910104","article-title":"On the (semi)lattices induced by continuous reducibilities","volume":"56","author":"Pauly","year":"2010","journal-title":"MLQ Math. Log. Q."},{"key":"10.3233\/COM-180244_ref12","isbn-type":"print","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1017\/CBO9780511581007","volume-title":"Subsystems of Second Order Arithmetic, Perspectives in Logic","author":"Simpson","year":"2009","ISBN":"https:\/\/id.crossref.org\/isbn\/9780521884396"},{"issue":"2\u20133","key":"10.3233\/COM-180244_ref13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0168-0072(86)90074-6","article-title":"Factorization of polynomials and \u03a3 1 0 induction","volume":"31","author":"Simpson","year":"1986","journal-title":"Ann. Pure Appl. Logic"}],"container-title":["Computability"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/COM-180244","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T16:00:14Z","timestamp":1777392014000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/COM-180244"}},"subtitle":[],"editor":[{"given":"Vasco","family":"Brattka","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Damir D.","family":"Dzhafarov","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Alberto","family":"Marcone","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Arno","family":"Pauly","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2020,8,3]]},"references-count":12,"journal-issue":{"issue":"3-4"},"URL":"https:\/\/doi.org\/10.3233\/com-180244","relation":{},"ISSN":["2211-3576","2211-3568"],"issn-type":[{"value":"2211-3576","type":"electronic"},{"value":"2211-3568","type":"print"}],"subject":[],"published":{"date-parts":[[2020,8,3]]}}}