{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:00:19Z","timestamp":1649030419221},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,12,10]],"date-time":"2009-12-10T00:00:00Z","timestamp":1260403200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s00153-009-0171-1","type":"journal-article","created":{"date-parts":[[2009,12,9]],"date-time":"2009-12-09T14:35:59Z","timestamp":1260369359000},"page":"169-193","source":"Crossref","is-referenced-by-count":1,"title":["The limitations of cupping in the local structure of the enumeration degrees"],"prefix":"10.1007","volume":"49","author":[{"given":"Mariya I.","family":"Soskova","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,10]]},"reference":[{"key":"171_CR1","unstructured":"Arslanov, M.M., Sorbi, A.: Relative splittings of $${0'_e}$$ in the \u03942 enumeration degrees. In: Buss, S., Pudlak, P. (eds.) Logic Colloquium \u201998, pp. 44\u201356. Lecture Notes in Logic 13 (1999)"},{"key":"171_CR2","doi-asserted-by":"crossref","first-page":"503","DOI":"10.2307\/2274181","volume":"49","author":"S.B. Cooper","year":"1984","unstructured":"Cooper S.B.: Partial Degrees and the density problem. Part 2: The enumeration degrees of the \u03a3 2 sets are dense. J Symb Log 49, 503\u2013513 (1984)","journal-title":"J Symb Log"},{"key":"171_CR3","doi-asserted-by":"crossref","unstructured":"Cooper, S.B.: Enumeration reducibility, nondeterminitsic computations and relative computability of partial functions. In: Ambos-Spies, K., Muller, G.H., Sacks G.E. (eds.) Recursion Theory Week, Proceedings Oberwolfach 1989, pp. 57\u2013110. Lecture Notes in Mathematics 1432 (1990)","DOI":"10.1007\/BFb0086114"},{"key":"171_CR4","volume-title":"Computability Theory","author":"S.B. Cooper","year":"2004","unstructured":"Cooper S.B.: Computability Theory. Chapman & Hall\/CRC Mathematics, Boca Raton, FL (2004)"},{"key":"171_CR5","unstructured":"Cooper, S.B.: On a theorem of C.E.M. Yates. Handwritten notes (1973)"},{"key":"171_CR6","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0168-0072(96)00009-7","volume":"82","author":"S.B. Cooper","year":"1996","unstructured":"Cooper S.B., Sorbi A., Yi X.: Cupping and noncupping in the enumeration degrees of $${\\Sigma_2^0}$$ sets. Ann. Pure Appl. Log. 82, 317\u2013342 (1996)","journal-title":"Ann. Pure Appl. Log."},{"key":"171_CR7","first-page":"47","volume":"7.1","author":"Y.L. Ershov","year":"1968","unstructured":"Ershov Y.L.: A hierarchy of sets. I. Algebra i Logika 7.1, 47\u201374 (1968)","journal-title":"Algebra i Logika"},{"key":"171_CR8","first-page":"15","volume":"7.4","author":"Y.L. Ershov","year":"1968","unstructured":"Ershov Y.L.: On a hierarchy of sets, II. Algebra i Logika 7.4, 15\u201347 (1968)","journal-title":"Algebra i Logika"},{"key":"171_CR9","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1090\/S0002-9947-1968-0220595-7","volume":"131","author":"C.G. Jockusch Jr","year":"1968","unstructured":"Jockusch C.G. Jr: Semirecursive sets and positive reducibility. Trans. Am. Math. Soc. 131, 420\u2013436 (1968)","journal-title":"Trans. Am. Math. Soc."},{"key":"171_CR10","unstructured":"Kent, T.F.: Decidability and definability in the $${\\Sigma^0_2}$$ -enumeration degrees. PhD thesis, University of Wisconsin - Madison (2005)"},{"key":"171_CR11","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01794984","volume":"31","author":"A.H. Lachlan","year":"1992","unstructured":"Lachlan A.H., Shore R.A.: The n-rea enumeration degrees are dense. Arch. Math. Log. 31, 277\u2013285 (1992)","journal-title":"Arch. Math. Log."},{"key":"171_CR12","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1007\/s00153-004-0215-5","volume":"43","author":"A.E.M. Lewis","year":"2004","unstructured":"Lewis A.E.M.: Finite cupping sets. Arch. Math. Log. 43, 845\u2013858 (2004)","journal-title":"Arch. Math. Log."},{"key":"171_CR13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02808174","volume":"110","author":"A. Nies","year":"1999","unstructured":"Nies A., Sorbi A.: Branching in the \u03a3 2 enumeration degrees. Isr. J. Math. 110, 29\u201359 (1999)","journal-title":"Isr. J. Math."},{"key":"171_CR14","doi-asserted-by":"crossref","first-page":"714","DOI":"10.2307\/2273221","volume":"46","author":"D. Posner","year":"1981","unstructured":"Posner D., Robinson R.: Degrees joining to 0\u2032. J. Symb. Log. 46, 714\u2013722 (1981)","journal-title":"J. Symb. Log."},{"key":"171_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"R.I. Soare","year":"1987","unstructured":"Soare R.I.: Recursively Enumerable Sets and Degrees. Springer, Berlin (1987)"},{"key":"171_CR16","unstructured":"Soskova, M.I.: Cupping classes of $${\\Sigma^0_2}$$ enumeration degrees. In: Beckmann, Costas Dimitracopoulos, Benedikt L\u00f6we (eds.) Logic and Theory of Algorithms, Fourth Conference on Computability in Europe, CiE 2008, Athens, Greece, June 2008, Proceedings, pp. 554\u2013566. Lecture Notes in Computer Science 5028 (2008)"},{"key":"171_CR17","doi-asserted-by":"crossref","unstructured":"Soskova, M.I., Wu, G.: Cupping $${\\Delta^0_2}$$ enumeration degrees to 0\u2032. In: Cooper, S., L\u00f6we, B., Sorbi, A. (eds.) Computation and Logic in the Real World, pp. 727\u2013738. Lecture Notes in Computer Science 4497 (2007)","DOI":"10.1007\/978-3-540-73001-9_77"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-009-0171-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-009-0171-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-009-0171-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:21:38Z","timestamp":1558696898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-009-0171-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,10]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["171"],"URL":"https:\/\/doi.org\/10.1007\/s00153-009-0171-1","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,10]]}}}