{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,9]],"date-time":"2026-09-09T03:12:42Z","timestamp":1788923562380,"version":"build-2803163510"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,2,5]],"date-time":"2009-02-05T00:00:00Z","timestamp":1233792000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s00224-009-9175-9","type":"journal-article","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T18:48:29Z","timestamp":1233773309000},"page":"897-916","source":"Crossref","is-referenced-by-count":14,"title":["Enumerations and Completely Decomposable Torsion-Free Abelian Groups"],"prefix":"10.1007","volume":"45","author":[{"given":"Alexander G.","family":"Melnikov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,2,5]]},"reference":[{"key":"9175_CR1","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1215\/S0012-7094-37-00308-9","volume":"3","author":"R. Baer","year":"1937","unstructured":"Baer, R.: Abelian groups without elements of finite order. Duke Math. J. 3, 68\u2013122 (1937)","journal-title":"Duke Math. J."},{"key":"9175_CR2","doi-asserted-by":"crossref","unstructured":"Coles, R., Downey, R., Slaman, T.: Every set has a least jump enumeration. J. Lond. Math. Soc. (2) 62(3), 641\u2013649","DOI":"10.1112\/S0024610700001459"},{"key":"9175_CR3","first-page":"157","volume-title":"Complexity, Logic and Recursion Theory","author":"R. Downey","year":"1997","unstructured":"Downey, R.: On presentations of algebraic structures. In: Sorbi (ed.) Complexity, Logic and Recursion Theory, pp. 157\u2013205. Marcel Dekker, New York (1997)"},{"key":"9175_CR4","volume-title":"Constructive Models","author":"Y. Ershov","year":"1999","unstructured":"Ershov, Y., Goncharov, S.: Constructive Models. Nauchnaya kniga, Novosibirsk (1999)"},{"key":"9175_CR5","volume-title":"Infinite Abelian Groups, vol. II","author":"L. Fuchs","year":"1973","unstructured":"Fuchs, L.: Infinite Abelian Groups, vol. II. Academic Press, New York (1973)"},{"key":"9175_CR6","series-title":"Handbook of Recursive Mathematics","volume-title":"Constructive Abelian Groups","author":"N. Khisamiev","year":"1998","unstructured":"Khisamiev, N.: Constructive Abelian Groups. Handbook of Recursive Mathematics, vol. 139. Elsevier, Amsterdam (1998)"},{"key":"9175_CR7","unstructured":"Mal\u2019tsev, A.I.: On recursive Abelian groups. Soviet Math. Dokl. 3"},{"key":"9175_CR8","doi-asserted-by":"crossref","first-page":"470","DOI":"10.2307\/2695025","volume":"66","author":"R. Miller","year":"2001","unstructured":"Miller, R.: The \u0394 2 0 -spectrum of a linear order. J. Symb. Log. 66, 470\u2013486 (2001)","journal-title":"J. Symb. Log."},{"key":"9175_CR9","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/malq.19710170139","volume":"17","author":"A. Selman","year":"1971","unstructured":"Selman, A.: Arithmetical reducibilities I. Z. Math. Log. Grundlagen Math. 17, 335\u2013370 (1971)","journal-title":"Z. Math. Log. Grundlagen Math."},{"key":"9175_CR10","doi-asserted-by":"crossref","first-page":"2117","DOI":"10.1090\/S0002-9939-98-04307-X","volume":"126","author":"T. Slaman","year":"1998","unstructured":"Slaman, T.: Relative to any non-recursive set. Proc. Am. Math. Soc. 126, 2117\u20132122 (1998)","journal-title":"Proc. Am. Math. Soc."},{"key":"9175_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"R.I. Soare","year":"1987","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Berlin\/Heidelberg (1987)"},{"key":"9175_CR12","doi-asserted-by":"crossref","first-page":"2131","DOI":"10.1090\/S0002-9939-98-04314-7","volume":"126","author":"S. Wehner","year":"1998","unstructured":"Wehner, S.: Enumerations, countable structures and Turing degrees. Proc. Am. Math. Soc. 126, 2131\u20132139 (1998)","journal-title":"Proc. Am. Math. Soc."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9175-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-009-9175-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9175-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:37Z","timestamp":1558698697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-009-9175-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,5]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["9175"],"URL":"https:\/\/doi.org\/10.1007\/s00224-009-9175-9","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,5]]}}}