{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T19:37:57Z","timestamp":1649101077949},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":6225,"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":[[1996,7]]},"DOI":"10.1016\/0168-0072(95)00055-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:04:08Z","timestamp":1027613048000},"page":"55-67","source":"Crossref","is-referenced-by-count":1,"title":["\u22115-completeness of index sets arising from the lattice of recursively enumerable sets"],"prefix":"10.1016","volume":"80","author":[{"given":"Michael A.","family":"Jahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(95)00055-0_BIB1","article-title":"The index set of the cuppable sets","author":"Jahn","year":"1993"},{"key":"10.1016\/0168-0072(95)00055-0_BIB2","unstructured":"M.A. Jahn, \u22115-completeness of index sets arising from the recursively enumerable Turing degrees, this journal."},{"key":"10.1016\/0168-0072(95)00055-0_BIB3","doi-asserted-by":"crossref","first-page":"1288","DOI":"10.2307\/2274816","article-title":"Recursively enumerated sets modulo iterated jumps and extensions of Arslanov's completeness criterion","volume":"54","author":"Jockusch","year":"1989","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(95)00055-0_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0002-9947-1968-0227009-1","article-title":"On the lattice of recursively enumerable sets","volume":"130","author":"Lachlan","year":"1968","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0168-0072(95)00055-0_BIB5","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1090\/S0002-9947-1987-0902785-2","article-title":"Hyperarithmetical index sets in recursion theory","volume":"303","author":"Lempp","year":"1987","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0168-0072(95)00055-0_BIB6","series-title":"Proc. Recursion Theory Week","first-page":"277","article-title":"Priority arguments using iterated trees of strategies","volume":"Vol. 1432","author":"Lempp","year":"1990"},{"key":"10.1016\/0168-0072(95)00055-0_BIB7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7_3","article-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:0168007295000550?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007295000550?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T12:52:30Z","timestamp":1556283150000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0168007295000550"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0168007295000550"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(95)00055-0","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}