{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T21:18:51Z","timestamp":1655068731006},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4611,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1016\/s0168-0072(99)00011-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:56:30Z","timestamp":1027601790000},"page":"1-47","source":"Crossref","is-referenced-by-count":4,"title":["Undecidability and 1-types in intervals of the computably enumerable degrees"],"prefix":"10.1016","volume":"106","author":[{"given":"Klaus","family":"Ambos-Spies","sequence":"first","affiliation":[]},{"given":"Denis R.","family":"Hirschfeldt","sequence":"additional","affiliation":[]},{"given":"Richard A.","family":"Shore","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0168-0072(99)00011-1_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(89)90042-0","article-title":"The recursively enumerable degrees have infinitely many one-types","volume":"44","author":"Ambos-Spies","year":"1989","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0168-0072(99)00011-1_BIB2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0168-0072(93)90206-S","article-title":"Undecidability and 1-types in the recursively enumerable degrees","volume":"63","author":"Ambos-Spies","year":"1993","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0168-0072(99)00011-1_BIB3","unstructured":"Y. Ershov, M.A. Taitslin, The undecidability of certain theories, Algebra Logika 2 (1963) 37\u2013 41 (in Russian)."},{"key":"10.1016\/S0168-0072(99)00011-1_BIB4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0168-0072(83)90028-3","article-title":"The density of the nonbranching degrees","volume":"24","author":"Fejer","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0168-0072(99)00011-1_BIB5","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1090\/S0273-0979-1982-14970-9","article-title":"The undecidability of the recursively enumerable degrees (research announcement)","volume":"6","author":"Harrington","year":"1982","journal-title":"Bull. Amer. Math. Soc. (N.S.)"},{"key":"10.1016\/S0168-0072(99)00011-1_BIB6","doi-asserted-by":"crossref","unstructured":"A.H. Lachlan, Lower bounds for pairs of recursively enumerable degrees, Proc. London Math. Soc. (3) 16 (1966) 537\u2013569.","DOI":"10.1112\/plms\/s3-16.1.537"},{"key":"10.1016\/S0168-0072(99)00011-1_BIB7","doi-asserted-by":"crossref","first-page":"2719","DOI":"10.1090\/S0002-9947-98-01800-5","article-title":"The \u03a03-theory of the computably enumerable Turing degrees is undecidable","volume":"350","author":"Lempp","year":"1998","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0168-0072(99)00011-1_BIB8","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0001-8708(84)90028-8","article-title":"The elementary theory of the recursively enumerable degrees is not \u21350-categorical","volume":"53","author":"Lerman","year":"1984","journal-title":"Adv. Math."},{"key":"10.1016\/S0168-0072(99)00011-1_BIB9","doi-asserted-by":"crossref","unstructured":"A. Nies, R.A. Shore, T.A. Slaman, Interpretability and definability in the recursively enumerable degrees, Proc. London Math. Soc. (3) 77 (1998) 241\u2013291.","DOI":"10.1112\/S002461159800046X"},{"issue":"2","key":"10.1016\/S0168-0072(99)00011-1_BIB10","doi-asserted-by":"crossref","first-page":"300","DOI":"10.2307\/1970393","volume":"80","author":"Sacks","year":"1964","journal-title":"Ann. Math."},{"key":"10.1016\/S0168-0072(99)00011-1_BIB11","unstructured":"G.E. Sacks, Degrees of Unsolvability, revised edition, Ann. of Math. Studies, vol. 55, Princeton Univ. Press, Princeton, NJ, 1966."},{"key":"10.1016\/S0168-0072(99)00011-1_BIB12","series-title":"Degrees of Unsolvability","author":"Shoenfield","year":"1971"},{"key":"10.1016\/S0168-0072(99)00011-1_BIB13","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0168-0072(91)90044-M","article-title":"The density of infima in the recursively enumerable degrees","volume":"52","author":"Slaman","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0168-0072(99)00011-1_BIB14","series-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007299000111?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007299000111?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T09:28:09Z","timestamp":1556184489000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007299000111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["S0168007299000111"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(99)00011-1","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}