{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T11:28:22Z","timestamp":1772450902570,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2010,6,19]],"date-time":"2010-06-19T00:00:00Z","timestamp":1276905600000},"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,8]]},"DOI":"10.1007\/s00153-010-0192-9","type":"journal-article","created":{"date-parts":[[2010,6,17]],"date-time":"2010-06-17T22:09:08Z","timestamp":1276812548000},"page":"673-691","source":"Crossref","is-referenced-by-count":10,"title":["Goodness in the enumeration and singleton degrees"],"prefix":"10.1007","volume":"49","author":[{"given":"Charles M.","family":"Harris","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,6,19]]},"reference":[{"key":"192_CR1","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/0003-4843(71)90003-9","volume":"2","author":"J. Case","year":"1971","unstructured":"Case J.: Enumeration reducibility and partial degrees. Ann. Math. Log. 2, 419\u2013439 (1971)","journal-title":"Ann. Math. Log."},{"issue":"4","key":"192_CR2","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. Symbolic Log. 50(4), 983\u20131001 (1985)","journal-title":"J. Symbolic Log."},{"key":"192_CR3","doi-asserted-by":"crossref","first-page":"854","DOI":"10.2307\/2273104","volume":"47","author":"S.B. Cooper","year":"1982","unstructured":"Cooper S.B.: Partial degrees and the density problem. J. Symbolic Log. 47, 854\u2013859 (1982)","journal-title":"J. Symbolic Log."},{"key":"192_CR4","first-page":"57","volume-title":"Recursion Theory Week, Oberwolfach 1989, volume 1432 of Lecture notes in Mathematics","author":"S.B. Cooper","year":"1990","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, volume 1432 of Lecture notes in Mathematics, pp. 57\u2013110. Springer, Heidelberg (1990)"},{"key":"192_CR5","volume-title":"Computability Theory","author":"S.B. Cooper","year":"2004","unstructured":"Cooper S.B.: Computability Theory. Chapman and Hall, Boca Raton (2004)"},{"key":"192_CR6","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."},{"key":"192_CR7","unstructured":"Harris, C.M.: On the jump classes of noncuppable enumeration degrees. To appear in the J. Symbolic Log"},{"key":"192_CR8","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. Amer. Math. Soc. 131, 420\u2013436 (1968)","journal-title":"Trans. Amer. Math. Soc."},{"key":"192_CR9","doi-asserted-by":"crossref","unstructured":"Kent, T.F.: s-degrees within e-degrees. In: Theory and Applications of Models of Computation, volume 4978 of Lecture Notes in Computer Science, pp. 579\u2013587 (2008)","DOI":"10.1007\/978-3-540-79228-4_50"},{"key":"192_CR10","doi-asserted-by":"crossref","first-page":"379","DOI":"10.2307\/1969708","volume":"59","author":"S.C. Kleene","year":"1954","unstructured":"Kleene S.C., Post E.L.: The upper semi-lattice of degrees of unsolvability. Ann. Math. 59, 379\u2013407 (1954)","journal-title":"Ann. Math."},{"key":"192_CR11","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":"192_CR12","unstructured":"McEvoy, K.: The Structure of the Enumeration Degrees. PhD thesis, The University of Leeds, UK (1984)"},{"key":"192_CR13","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":"192_CR14","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1007\/s00153-006-0012-4","volume":"45","author":"R. Sh. Omanadze","year":"2006","unstructured":"Omanadze R. Sh., Sorbi A.: Strong enumeration reducibilities. Arch. Math. Log. 45, 869\u2013912 (2006)","journal-title":"Arch. Math. Log."},{"key":"192_CR15","volume-title":"Degrees of Unsolvability","author":"G.E. Sacks","year":"1963","unstructured":"Sacks G.E.: Degrees of Unsolvability. Princeton University Press, Princeton (1963)"},{"key":"192_CR16","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":"192_CR17","volume-title":"The Enumeration Degrees of the $${\\Sigma^0_2}$$ sets, pp. 303\u2013330","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)"},{"key":"192_CR18","doi-asserted-by":"crossref","unstructured":"Shore, R., Sorbi, A.: Jumps of $${\\Sigma^0_2}$$ -high e-degrees and properly $${\\Sigma^0_2}$$ e-degrees. In: Arslanov, M.M., Lempp, S. (eds) Recursion Theory and Complexity, volume 2 of De Gruyter Series in Logic and its Applications, pp. 157\u2013172. De Gruyter (1999)","DOI":"10.1515\/9783110807486.157"},{"key":"192_CR19","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF02071787","volume":"23","author":"S.D. Zacharov","year":"1984","unstructured":"Zacharov S.D.: e- and s- degrees. Algebra Log. 23, 273\u2013281 (1984)","journal-title":"Algebra Log."}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-010-0192-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-010-0192-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-010-0192-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T19:10:18Z","timestamp":1635534618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-010-0192-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,19]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["192"],"URL":"https:\/\/doi.org\/10.1007\/s00153-010-0192-9","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,19]]}}}