{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T00:19:42Z","timestamp":1706660382121},"reference-count":15,"publisher":"Duke University Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2008,1,1]]},"DOI":"10.1215\/00294527-2007-001","type":"journal-article","created":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T18:39:58Z","timestamp":1616179198000},"source":"Crossref","is-referenced-by-count":3,"title":["Self-Embeddings of Computable Trees"],"prefix":"10.1215","volume":"49","author":[{"given":"Stephen","family":"Binns","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bj\u00f8rn","family":"Kjos-Hanssen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Lerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James H.","family":"Schmerl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reed","family":"Solomon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"73","reference":[{"key":"1","unstructured":"[1] Cenzer, D., \"$\\pi^0_1$ classes in recursion theory\", pp. 37--88 in <i>Handbook of Computability Theory<\/i>, edited by E. R. Griffor, vol. 140 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland Publishing Co., Amsterdam, 1999."},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Cenzer, D., and J. B. Remmel, \"$\\Pi\\sp 0\\sb 1$\" classes in mathematics\", pp. 623--821 in <i>Handbook of Recursive Mathematics, Vol. 2<\/i>, edited by Yu. L. Ershov, S. S. Goncharov, A. Nerode, and J. B. Remmel, vol. 139 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland, Amsterdam, 1998.","DOI":"10.1016\/S0049-237X(98)80046-3"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Corominas, E., \"On better quasi-ordering countable trees\", <i>Discrete Mathematics<\/i>, vol. 53 (1985), pp. 35--53. Special volume on ordered sets and their applications (L'Arbresle, 1982).","DOI":"10.1016\/0012-365X(85)90127-X"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Downey, R. G., C. Jockusch, and J. S. Miller, \"On self-embeddings of computable linear orderings\", <i>Annals of Pure and Applied Logic<\/i>, vol. 138 (2006), pp. 52--76.","DOI":"10.1016\/j.apal.2005.06.008"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Downey, R. G., and S. Lempp, \"The proof-theoretic strength of the Dushnik-Miller theorem for countable linear orders\", pp. 55--57 in <i>Recursion Theory and Complexity (Kazan, 1997)<\/i>, edited by M. Arslanov and S. Lempp, vol. 2 of <i>de Gruyter Series in Logic and its Applications<\/i>, Walter de Gruyter &amp; Co, Berlin, 1999.","DOI":"10.1515\/9783110807486.55"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] Dushnik, B., and E. W. Miller, \"Concerning similarity transformations of linearly ordered sets\", <i>Bulletin of the American Mathematical Society<\/i>, vol. 46 (1940), pp. 322--26.","DOI":"10.1090\/S0002-9904-1940-07213-1"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Herrmann, E., \"Infinite chains and antichains in computable partial orderings\", <i>The Journal of Symbolic Logic<\/i>, vol. 66 (2001), pp. 923--34.","DOI":"10.2307\/2695053"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Jockusch, C. G., Jr., and R. I. Soare, \"$\\Pi \\sp0\\sb1$\" classes and degrees of theories\", <i>Transactions of the American Mathematical Society<\/i>, vol. 173 (1972), pp. 33--56.","DOI":"10.2307\/1996261"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] Kruskal, J. B., \"Well-quasi-ordering, the Tree Theorem, and Vazsonyi's conjecture\", <i>Transactions of the American Mathematical Society<\/i>, vol. 95 (1960), pp. 210--25.","DOI":"10.2307\/1993287"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Lempp, S., C. McCoy, R. Miller, and R. Solomon, \"Computable categoricity of trees of finite height\", <i>The Journal of Symbolic Logic<\/i>, vol. 70 (2005), pp. 151--215.","DOI":"10.2178\/jsl\/1107298515"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Miller, R., \"The computable dimension of trees of infinite height\", <i>The Journal of Symbolic Logic<\/i>, vol. 70 (2005), pp. 111--41.","DOI":"10.2178\/jsl\/1107298513"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Richter, L. J., \"Degrees of structures\", <i>The Journal of Symbolic Logic<\/i>, vol. 46 (1981), pp. 723--31.","DOI":"10.2307\/2273222"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] Ross, D., \"Tree self-embeddings\", <i>Canadian Mathematical Bulletin<\/i>, vol. 32 (1989), pp. 30--33.","DOI":"10.4153\/CMB-1989-005-7"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] Simpson, S. G., <i>Subsystems of Second Order Arithmetic<\/i>, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1999.","DOI":"10.1007\/978-3-642-59971-2"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] Soare, R. I., <i>Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets<\/i>, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1987.","DOI":"10.1007\/978-3-662-02460-7"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2007-001","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:57:02Z","timestamp":1706648222000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-49\/issue-1\/Self-Embeddings-of-Computable-Trees\/10.1215\/00294527-2007-001.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,1]]},"references-count":15,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2008,1,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2007-001","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2008,1,1]]}}}