{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T02:57:47Z","timestamp":1768013867886,"version":"3.49.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,12,12]],"date-time":"2008-12-12T00:00:00Z","timestamp":1229040000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s00153-008-0110-6","type":"journal-article","created":{"date-parts":[[2008,12,11]],"date-time":"2008-12-11T11:52:43Z","timestamp":1228996363000},"page":"7-13","source":"Crossref","is-referenced-by-count":12,"title":["Degree spectra of the successor relation of computable linear orderings"],"prefix":"10.1007","volume":"48","author":[{"given":"Jennifer","family":"Chubb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrey","family":"Frolov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentina","family":"Harizanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,12,12]]},"reference":[{"key":"110_CR1","volume-title":"Computable Structures and the Hyperarithmetical Hierarchy","author":"C.J. Ash","year":"2000","unstructured":"Ash C.J. and Knight J.F. (2000). Computable Structures and the Hyperarithmetical Hierarchy. Elsevier, Amsterdam"},{"key":"110_CR2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0168-0072(93)90075-O","volume":"60","author":"R.G. Downey","year":"1993","unstructured":"Downey R.G. (1993). Every recursive Boolean algebra is isomorphic to one with incomplete atoms. Ann. Pure Appl. Log. 60: 193\u2013206","journal-title":"Ann. Pure Appl. Log."},{"key":"110_CR3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1023\/A:1025971406116","volume":"42","author":"R.G. Downey","year":"2003","unstructured":"Downey R.G., Goncharov S.S. and Hirschfeldt D. (2003). Degree spectra of relations on Boolean algebras. Algebra Log. 42: 105\u2013111","journal-title":"Algebra Log."},{"key":"110_CR4","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1090\/S0002-9947-1991-1005933-2","volume":"326","author":"R.G. Downey","year":"1991","unstructured":"Downey R.G. and Moses M.F. (1991). Recursive linear orders with incomplete successivities. Trans. Am. Math. Soc. 326: 653\u2013668","journal-title":"Trans. Am. Math. Soc."},{"key":"110_CR5","doi-asserted-by":"crossref","unstructured":"Goncharov, S.S., Dzgoev, V.D.: Autostability of models. Algebra Log. 19, 45\u201358 (1980) (Russian), 28\u201337 (English translation)","DOI":"10.1007\/BF01669102"},{"key":"110_CR6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0168-0072(91)90097-6","volume":"55","author":"V.S Harizanov","year":"1991","unstructured":"Harizanov V.S (1991). Some effects of Ash-Nerode and other decidability conditions on degree spectra. Ann. Pure Appl. Log. 55: 51\u201365","journal-title":"Ann. Pure Appl. Log."},{"key":"110_CR7","unstructured":"Harizanov, V.S.: Degree spectrum of a recursive relation on a recursive structure. PhD dissertation, University of Wisconsin, Madison (1987)"},{"key":"110_CR8","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1989","unstructured":"Odifreddi P. (1989). Classical Recursion Theory. North-Holland, Amsterdam"},{"key":"110_CR9","volume-title":"Linear Orderings","author":"J. Rosenstein","year":"1982","unstructured":"Rosenstein J. (1982). Linear Orderings. Academic Press, New York"},{"key":"110_CR10","doi-asserted-by":"crossref","first-page":"572","DOI":"10.2307\/2273757","volume":"46","author":"J.B. Remmel","year":"1981","unstructured":"Remmel J.B. (1981). Recursive isomorphism types of recursive Boolean algebras. J. Symb. Log. 46: 572\u2013594","journal-title":"J. Symb. Log."},{"key":"110_CR11","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1090\/S0002-9939-1981-0624937-1","volume":"83","author":"J.B. Remmel","year":"1981","unstructured":"Remmel J.B. (1981). Recursively categorical linear orderings. Proc. Am. Math. Soc. 83: 387\u2013391","journal-title":"Proc. Am. Math. Soc."},{"key":"110_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets","author":"R.I. Soare","year":"1987","unstructured":"Soare R.I. (1987). Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets. Springer, Berlin"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-008-0110-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-008-0110-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-008-0110-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T15:36:42Z","timestamp":1558625802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-008-0110-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,12]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["110"],"URL":"https:\/\/doi.org\/10.1007\/s00153-008-0110-6","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,12]]}}}