{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T20:58:30Z","timestamp":1698181110048},"reference-count":5,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"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":8143,"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":[[1991,4]]},"DOI":"10.1016\/0168-0072(91)90044-m","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"155-179","source":"Crossref","is-referenced-by-count":24,"title":["The density of infima in the recursively enumerable degrees"],"prefix":"10.1016","volume":"52","author":[{"given":"Theodore A.","family":"Slaman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(91)90044-M_BIB1","series-title":"Ph.D. Dissertation","article-title":"The structure of definable subclasses of the recursively enumerable degrees","author":"Fejer","year":"1980"},{"key":"10.1016\/0168-0072(91)90044-M_BIB2","unstructured":"L.A. Harrington, Understanding Lachlan's monster paper, Handwritten notes."},{"key":"10.1016\/0168-0072(91)90044-M_BIB3","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1090\/S0002-9939-1980-0572317-9","article-title":"Decomposition of recursively enumerable degrees","volume":"79","author":"Lachlan","year":"1980","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0168-0072(91)90044-M_BIB4","doi-asserted-by":"crossref","first-page":"300","DOI":"10.2307\/1970393","article-title":"The recursively enumerable degrees are dense","volume":"80","author":"Sacks","year":"1964","journal-title":"Ann. of Math."},{"key":"10.1016\/0168-0072(91)90044-M_BIB5","series-title":"Perspectives in Mathematical Logic","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:016800729190044M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729190044M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:52:41Z","timestamp":1555141961000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016800729190044M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":5,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["016800729190044M"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(91)90044-m","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}