{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T15:04:46Z","timestamp":1648739086317},"reference-count":22,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":6310,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1996,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We prove that there exists a noncappable enumeration degree strictly below <jats:bold>0<\/jats:bold><jats:sub arrange=\"stack\"><jats:italic>e<\/jats:italic><\/jats:sub><jats:sup arrange=\"stack\">\u2032<\/jats:sup>.<\/jats:p>","DOI":"10.2307\/2275820","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T22:59:54Z","timestamp":1146956394000},"page":"1347-1363","source":"Crossref","is-referenced-by-count":3,"title":["Noncappable enumeration degrees below <b>0<\/b><sub><i>e<\/i><\/sub><sup>\u2032<\/sup>"],"prefix":"10.1017","volume":"61","author":[{"given":"S. Barry","family":"Cooper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Sorbi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200016935_ref022","first-page":"159","volume":"31","author":"Yates","year":"1966","journal-title":"A minimal pair of recursively enumerable degrees"},{"key":"S0022481200016935_ref020","volume-title":"Theory of recursive functions and effective computability","author":"Rogers","year":"1967"},{"key":"S0022481200016935_ref018","volume-title":"Classical recursion theory","author":"Odifreddi","year":"1989"},{"key":"S0022481200016935_ref015","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21755-9"},{"key":"S0022481200016935_ref012","unstructured":"Gutteridge L. , Some results on enumeration reducibility, Ph.D. thesis , Simon Fraser University, 1971."},{"key":"S0022481200016935_ref014","unstructured":"Lagemann J. , Embedding theorems in the reducibility ordering of the partial degrees, Ph.D. thesis , MIT, 1972."},{"key":"S0022481200016935_ref009","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19880340603"},{"key":"S0022481200016935_ref008","first-page":"57","volume-title":"Recursion Theory Week","author":"Cooper","year":"1989"},{"key":"S0022481200016935_ref007","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19870330608"},{"key":"S0022481200016935_ref005","first-page":"854","volume":"47","author":"Cooper","year":"1982","journal-title":"Partial degrees and the density problem"},{"key":"S0022481200016935_ref004","doi-asserted-by":"publisher","DOI":"10.1016\/0003-4843(71)90003-9"},{"key":"S0022481200016935_ref001","first-page":"195","volume":"56","author":"Ahmad","year":"1991","journal-title":"Embedding the diamond in the \u03a32 enumeration degrees"},{"key":"S0022481200016935_ref019","first-page":"705","volume":"46","author":"Posner","year":"1981","journal-title":"The upper semilattice of degrees \u2264 0\u2032 is complemented"},{"key":"S0022481200016935_ref006","first-page":"503","volume":"49","author":"Cooper","year":"1984","journal-title":"Partial degrees and the density problem. Part 2: The enumeration degrees of the \u03a32 sets are dense"},{"key":"S0022481200016935_ref003","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1984-0737882-5"},{"key":"S0022481200016935_ref021","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7"},{"key":"S0022481200016935_ref002","unstructured":"Ambos-Spies K. , On the structure of the recursively enumerable degrees, Ph.D. thesis , University of Munich, 1980."},{"key":"S0022481200016935_ref017","first-page":"983","volume":"50","author":"McEvoy","year":"1985","journal-title":"On minimal pairs of enumeration degrees"},{"key":"S0022481200016935_ref011","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19590050703"},{"key":"S0022481200016935_ref013","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1968-0220595-7"},{"key":"S0022481200016935_ref010","unstructured":"Cooper S. B. , Slaman T. A. , and Yi X. , The \u03a32 theory of the recursively enumerable degrees, to appear."},{"key":"S0022481200016935_ref016","first-page":"839","volume":"50","author":"McEvoy","year":"1985","journal-title":"Jumps of quasi-minimal enumeration degrees"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200016935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T19:59:32Z","timestamp":1557691172000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200016935\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["S0022481200016935"],"URL":"https:\/\/doi.org\/10.2307\/2275820","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}