{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T08:10:01Z","timestamp":1775463001397,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"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":6072,"URL":"http:\/\/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,12]]},"DOI":"10.1016\/s0168-0072(96)00009-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T16:11:55Z","timestamp":1049731915000},"page":"317-342","source":"Crossref","is-referenced-by-count":24,"title":["Cupping and noncupping in the enumeration degrees of \u221120 sets"],"prefix":"10.1016","volume":"82","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"}]},{"given":"Xiaoding","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0168-0072(96)00009-7_BIB1","article-title":"Some results on the structure of the \u22112 enumeration degrees","volume":"38","author":"Ahmad","year":"1989","journal-title":"Recursive Function Theory Newsletter"},{"key":"10.1016\/S0168-0072(96)00009-7_BIB2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.2307\/2274914","article-title":"Embedding the diamond in the \u22112 enumeration degrees","volume":"50","author":"Ahmad","year":"1991","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0168-0072(96)00009-7_BIB3","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/0003-4843(71)90003-9","article-title":"Enumeration reducibility and partial degrees","volume":"2","author":"Case","year":"1971","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/S0168-0072(96)00009-7_BIB4","author":"Cooper","year":"1974","journal-title":"On a theorem of C.E.M. Yates, handwritten notes"},{"key":"10.1016\/S0168-0072(96)00009-7_BIB5","doi-asserted-by":"crossref","first-page":"503","DOI":"10.2307\/2274181","article-title":"Partial degrees and the density problem. part 2: The enumeration degrees of the \u22112 sets are dense","volume":"49","author":"Cooper","year":"1984","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0168-0072(96)00009-7_BIB6","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1002\/malq.19870330608","article-title":"Enumeration reducibility using bounded information: counting minimal covers","volume":"33","author":"Cooper","year":"1987","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/S0168-0072(96)00009-7_BIB7","series-title":"Recursion Theory Week, Oberwolfach 1989","first-page":"57","article-title":"Enumeration reducibility, nondeterministic computations and relative computability of partial functions","volume":"Vol. 1432","author":"Cooper","year":"1990"},{"key":"10.1016\/S0168-0072(96)00009-7_BIB8","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1002\/malq.19880340603","article-title":"Properly \u22112 enumeration degrees","volume":"34","author":"Cooper","year":"1988","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/S0168-0072(96)00009-7_BIB9","doi-asserted-by":"crossref","first-page":"839","DOI":"10.2307\/2274335","article-title":"On minimal pairs of enumeration degrees","volume":"50","author":"Cooper","year":"1985","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0168-0072(96)00009-7_BIB10","unstructured":"S.B. Cooper and A. Sorbi, Noncuppable enumeration degrees below 0\u2032e, J. Symbolic Logic, to appear."},{"key":"10.1016\/S0168-0072(96)00009-7_BIB11","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1002\/malq.19590050703","article-title":"Reducibility and completeness for sets of integers","volume":"5","author":"Friedberg","year":"1959","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/S0168-0072(96)00009-7_BIB12","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1090\/S0002-9947-1968-0220595-7","article-title":"Semirecursive sets and positive reducibility","volume":"131","author":"Jockusch","year":"1968","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0168-0072(96)00009-7_BIB13","doi-asserted-by":"crossref","first-page":"839","DOI":"10.2307\/2274335","article-title":"Jumps of quasi-minimal enumeration degrees","volume":"50","author":"McEvoy","year":"1985","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0168-0072(96)00009-7_BIB14","series-title":"Logic Year 1979\u20131980: University of Connecticut","first-page":"230","article-title":"High recursively enumerable degrees and the anticupping property","author":"Miller","year":"1981"},{"key":"10.1016\/S0168-0072(96)00009-7_BIB15","volume":"Volume I","author":"Odifreddi","year":"1989"},{"key":"10.1016\/S0168-0072(96)00009-7_BIB16","doi-asserted-by":"crossref","first-page":"705","DOI":"10.2307\/2273220","article-title":"The upper semilattice of degrees below 0\u2032 is complemented","volume":"46","author":"Posner","year":"1981","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0168-0072(96)00009-7_BIB17","doi-asserted-by":"crossref","first-page":"714","DOI":"10.2307\/2273221","article-title":"Degrees joining to 0\u2032","volume":"46","author":"Posner","year":"1981","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0168-0072(96)00009-7_BIB18","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/S0168-0072(96)00009-7_BIB19","series-title":"Perspectives in Mathematical Logic, Omega Series","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:S0168007296000097?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007296000097?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T21:46:45Z","timestamp":1583963205000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007296000097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["S0168007296000097"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(96)00009-7","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}