{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T03:08:59Z","timestamp":1768014539581,"version":"3.49.0"},"reference-count":19,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":1562,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2009,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We solve a longstanding question of Rosenstein, and make progress toward solving a long-standing open problem in the area of computable linear orderings by showing that every computable<jats:italic>\u03b7<\/jats:italic>-like linear ordering without an infinite strongly<jats:italic>\u03b7<\/jats:italic>-like interval has a computable copy without nontrivial computable self-embedding.<\/jats:p><jats:p>The precise characterization of those computable linear orderings which have computable copies without nontrivial computable self-embedding remains open.<\/jats:p>","DOI":"10.2178\/jsl\/1254748695","type":"journal-article","created":{"date-parts":[[2009,10,5]],"date-time":"2009-10-05T17:05:40Z","timestamp":1254762340000},"page":"1352-1366","source":"Crossref","is-referenced-by-count":7,"title":["On computable self-embeddings of computable linear orderings"],"prefix":"10.1017","volume":"74","author":[{"given":"Rodney G.","family":"Downey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Kastermans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steffen","family":"Lempp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200003194_ref018","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7"},{"key":"S0022481200003194_ref017","first-page":"465","volume-title":"Orders: description and roles (l'Arbresle, 1982)","author":"Rosenstein","year":"1984"},{"key":"S0022481200003194_ref016","volume-title":"Linear orderings","author":"Rosenstein","year":"1982"},{"key":"S0022481200003194_ref014","doi-asserted-by":"publisher","DOI":"10.1007\/s11083-006-9049-6"},{"key":"S0022481200003194_ref012","unstructured":"Lempp Steffen , Lecture notes on priority arguments, preprint available at http:\/\/www.math.wise.edu\/~lempp\/papers\/prio.pdf."},{"key":"S0022481200003194_ref009","first-page":"365","volume":"35","author":"Feiner","year":"1970","journal-title":"Hierarchies of Boolean algebras"},{"key":"S0022481200003194_ref008","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1940-07213-1"},{"key":"S0022481200003194_ref010","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1968-0244049-7"},{"key":"S0022481200003194_ref007","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19890350307"},{"key":"S0022481200003194_ref006","unstructured":"Downey Rodney G. , Lempp Steffen , and Wu Guohua , On the complexity of the successivity relation in computable linear orderings, to appear."},{"key":"S0022481200003194_ref004","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2005.06.008"},{"key":"S0022481200003194_ref003","first-page":"823","volume-title":"Handbook of recursive mathematics","volume":"2","author":"Downey","year":"1998"},{"key":"S0022481200003194_ref001","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1990-0955487-0"},{"key":"S0022481200003194_ref019","first-page":"563","volume":"49","author":"Watnick","year":"1984","journal-title":"A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings"},{"key":"S0022481200003194_ref013","unstructured":"Montalb\u00e1n Antonio , Beyond the arithmetic, Ph.D. thesis, Cornell University, 2005."},{"key":"S0022481200003194_ref005","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1515\/9783110807486.55","volume-title":"Recursion theory and complexity (Kazan, 1997)","author":"Downey","year":"1999"},{"key":"S0022481200003194_ref015","unstructured":"Richter Linda Jean C. , Degrees of unsolvability of models, Ph.D. thesis, University of Illinois at Urbana\u2013Champaign, 1977."},{"key":"S0022481200003194_ref002","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(93)90075-O"},{"key":"S0022481200003194_ref011","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(91)90038-N"}],"container-title":["The Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200003194","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T23:12:20Z","timestamp":1710630740000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200003194\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["S0022481200003194"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1254748695","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12]]}}}