{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T01:51:47Z","timestamp":1768009907819,"version":"3.49.0"},"reference-count":13,"publisher":"Duke University Press","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2011,7,1]]},"DOI":"10.1215\/00294527-1435465","type":"journal-article","created":{"date-parts":[[2011,7,28]],"date-time":"2011-07-28T17:56:37Z","timestamp":1311875797000},"source":"Crossref","is-referenced-by-count":4,"title":["The Block Relation in Computable Linear Orders"],"prefix":"10.1215","volume":"52","author":[{"given":"Michael","family":"Moses","sequence":"first","affiliation":[]}],"member":"73","reference":[{"key":"1","unstructured":"[1] Ash, C. J., and A. Nerode, \"Intrinsically recursive relations\", pp. 26\u201341 in <i>Aspects of Effective Algebra (Clayton, 1979)<\/i>, edited by J. N. Crossley, Upside Down A Book Co., Yarra Glen, 1981."},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Coles, R. J., R. Downey, and B. Khoussainov, \"On initial segments of computable linear orders\", <i>Order<\/i>, vol. 14 (1997\/98), pp. 107\u201324.","DOI":"10.1023\/A:1006031314563"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Downey, R. G., B. Kastermans, and S. Lempp, \"On computable self-embeddings of computable linear orderings\", <i>The Journal of Symbolic Logic<\/i>, vol. 74 (2009), pp. 1352\u201366.","DOI":"10.2178\/jsl\/1254748695"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] 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\u201326.","DOI":"10.1090\/S0002-9904-1940-07213-1"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] Feiner, L., \"Hierarchies of Boolean algebras\", <i>The Journal of Symbolic Logic<\/i>, vol. 35 (1970), pp. 365\u201374.","DOI":"10.2307\/2270692"},{"key":"6","unstructured":"[6] Fellner, S. M., <i>Recursiveness and Finite Axiomatizability of Linear Orderings<\/i>, ProQuest LLC, Ann Arbor, 1976. Ph.D. thesis, Rutgers The State University of New Jersey, New Brunswick."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] Gon\u010darov, S. S., and A. T. Nurtazin, \"Constructive models of complete decidable theories\", <i>Algebra i Logika<\/i>, vol. 12 (1973), pp. 125\u201342, 243.","DOI":"10.1007\/BF02219289"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] Jockusch, C. G., Jr., and R. I. Soare, \"Degrees of orderings not isomorphic to recursive linear orderings, (International Symposium on Mathematical Logic and its Applications, Nagoya, 1988)\", <i>Annals of Pure and Applied Logic<\/i>, vol. 52 (1991), pp. 39\u201364.","DOI":"10.1016\/0168-0072(91)90038-N"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Kierstead, H. A., \"On $\\Pi_1$\"-automorphisms of recursive linear orders, <i>The Journal of Symbolic Logic<\/i>, vol. 52 (1987), pp. 681\u201388.","DOI":"10.2307\/2274356"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Moses, M., \"Decidable discrete linear orders\", <i>The Journal of Symbolic Logic<\/i>, vol. 53 (1988), pp. 531\u201339.","DOI":"10.2307\/2274522"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Moses, M., \"Relations intrinsically recursive in linear orders\", <i>Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik<\/i>, vol. 32 (1986), pp. 467\u201372.","DOI":"10.1002\/malq.19860322514"},{"key":"13","unstructured":"[13] Rosenstein, J. G., <i>Linear Orderings<\/i>, vol. 98 of <i>Pure and Applied Mathematics<\/i>, Academic Press Inc. [Harcourt Brace Jovanovich Publishers], New York, 1982."},{"key":"8","unstructured":"[8] Jockusch, C. G., Jr., <i>Reducibilities in Recursive Function Theory<\/i>, Ph.D. thesis, MIT, Cambridge, 1966."}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-1435465","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:57:42Z","timestamp":1706648262000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-52\/issue-3\/The-Block-Relation-in-Computable-Linear-Orders\/10.1215\/00294527-1435465.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,1]]},"references-count":13,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2011,7,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-1435465","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2011,7,1]]}}}