{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T17:18:34Z","timestamp":1648919914026},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2012,2,21]],"date-time":"2012-02-21T00:00:00Z","timestamp":1329782400000},"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":[[2012,5]]},"DOI":"10.1007\/s00153-012-0268-9","type":"journal-article","created":{"date-parts":[[2012,2,20]],"date-time":"2012-02-20T15:14:52Z","timestamp":1329750892000},"page":"373-406","source":"Crossref","is-referenced-by-count":0,"title":["Badness and jump inversion in the enumeration degrees"],"prefix":"10.1007","volume":"51","author":[{"given":"Charles M.","family":"Harris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,21]]},"reference":[{"issue":"1","key":"268_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1022660222520","volume":"42","author":"M.M. Arslanov","year":"2003","unstructured":"Arslanov M.M., Cooper S.B., Kalimullin I.S.: Splitting properties of total enumeration degrees. Algebra Log. 42(1), 1\u201313 (2003)","journal-title":"Algebra Log."},{"issue":"18","key":"268_CR2","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.1016\/j.tcs.2010.12.042","volume":"412","author":"M.M. Arslanov","year":"2011","unstructured":"Arslanov M.M., Cooper S.B., Kalimullin I.S., Soskova M.I.: Splitting and nonsplitting in the $${\\Sigma^{0}_{2}}$$ enumeration degrees. Theor. Comput. Sci. 412(18), 1669\u20131685 (2011). doi: 10.1016\/j.tcs.2010.12.042","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"268_CR3","doi-asserted-by":"crossref","first-page":"983","DOI":"10.2307\/2273985","volume":"50","author":"S.B. Cooper","year":"1985","unstructured":"Cooper S.B., McEvoy K.: On minimal pairs of enumeration degrees. J. Symb. Log. 50(4), 983\u20131001 (1985)","journal-title":"J. Symb. Log."},{"key":"268_CR4","doi-asserted-by":"crossref","unstructured":"Cooper, S.B.: Enumeration reducibility, nondeterministic computations and relative computability of partial functions. In: Ambos-Spies, K., M\u00fcller, G., Sacks, G.E. (eds.) Recursion Theory Week, Oberwolfach 1989, Lecture Notes in Mathematics, vol. 1432, pp. 57\u2013110. Springer, Heidelberg (1989)","DOI":"10.1007\/BFb0086114"},{"key":"268_CR5","volume-title":"Computability Theory","author":"S.B. Cooper","year":"2004","unstructured":"Cooper S.B.: Computability Theory. Chapman and Hall, London (2004)"},{"issue":"4","key":"268_CR6","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.2307\/2275821","volume":"61","author":"W.C. Calhoun","year":"1996","unstructured":"Calhoun W.C., Slaman T.A.: The $${{\\Pi^{0}_{2}}}$$ enumeration degrees are not dense. J. Symb. Log. 61(4), 1364\u20131379 (1996)","journal-title":"J. Symb. Log."},{"key":"268_CR7","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^{0}_{2}}$$ sets. Ann. Pure Appl. Log. 82, 317\u2013342 (1996)","journal-title":"Ann. Pure Appl. Log."},{"key":"268_CR8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1002\/malq.19590050703","volume":"5","author":"R.M. Friedberg","year":"1959","unstructured":"Friedberg R.M., Rogers H.: Reducibilities and completeness for sets of integers. Zeit. Math. Log. Grund. Math. 5, 117\u2013125 (1959)","journal-title":"Zeit. Math. Log. Grund. Math."},{"key":"268_CR9","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/s00153-002-0161-z","volume":"42","author":"E.J. Griffith","year":"2003","unstructured":"Griffith E.J.: Limit lemmas and jump inversion in the enumeration degrees. Arch. Math. Log. 42, 553\u2013562 (2003)","journal-title":"Arch. Math. Log."},{"issue":"6","key":"268_CR10","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1007\/s00153-010-0192-9","volume":"49","author":"C.M. Harris","year":"2010","unstructured":"Harris C.M.: Goodness in the enumeration and singleton degrees. Arch. Math. Log. 49(6), 673\u2013691 (2010)","journal-title":"Arch. Math. Log."},{"key":"268_CR11","unstructured":"Harris, C.M.: Low2 Turing Bounds in the Local Enumeration Degrees. Unpublished Note (2010)"},{"key":"268_CR12","doi-asserted-by":"crossref","unstructured":"Harris, C.M.: Noncuppable enumeration degrees via finite injury. J. Log. Comput. doi: 10.1093\/logcom\/exq044 (2011)","DOI":"10.1093\/logcom\/exq044"},{"issue":"1","key":"268_CR13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.2178\/jsl\/1294170994","volume":"76","author":"C.M. Harris","year":"2011","unstructured":"Harris C.M.: On the jump classes of noncuppable enumeration degrees. J. Symb. Log. 76(1), 177\u2013197 (2011)","journal-title":"J. Symb. Log."},{"key":"268_CR14","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1090\/S0002-9947-1968-0220595-7","volume":"131","author":"C.G. Jockusch","year":"1968","unstructured":"Jockusch C.G.: Semirecursive sets and positive reducibility. Trans. Am. Math. Soc. 131, 420\u2013436 (1968)","journal-title":"Trans. Am. Math. Soc."},{"key":"268_CR15","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01794984","volume":"31","author":"H. Lachlan","year":"1992","unstructured":"Lachlan H., Shore R.A.: The n-rea enumeration degrees are dense. Arch. Math. Log. 31, 277\u2013285 (1992)","journal-title":"Arch. Math. Log."},{"key":"268_CR16","unstructured":"McEvoy, K.: The Structure of the Enumeration Degrees. PhD thesis, The University of Leeds, UK (1984)"},{"key":"268_CR17","volume-title":"Classical Recursion Theory","author":"P.G. Odifreddi","year":"1989","unstructured":"Odifreddi P.G.: Classical Recursion Theory. Elsevier Science B.V., Amsterdam (1989)"},{"key":"268_CR18","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":"268_CR19","first-page":"303","volume-title":"The Enumeration Degrees of the $${\\Sigma^{0}_{2}}$$ Sets","author":"A. Sorbi","year":"1997","unstructured":"Sorbi A.: The Enumeration Degrees of the $${\\Sigma^{0}_{2}}$$ Sets, pp. 303\u2013330. Marcel Dekker, New York (1997)"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-012-0268-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-012-0268-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-012-0268-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T21:05:50Z","timestamp":1561323950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-012-0268-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,21]]},"references-count":19,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["268"],"URL":"https:\/\/doi.org\/10.1007\/s00153-012-0268-9","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,21]]}}}