{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T22:00:23Z","timestamp":1773266423200,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642299513","type":"print"},{"value":"9783642299520","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_56","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T02:14:09Z","timestamp":1336011249000},"page":"604-620","source":"Crossref","is-referenced-by-count":4,"title":["An Application of 1-Genericity in the $\\Pi^0_2$ Enumeration Degrees"],"prefix":"10.1007","author":[{"given":"Liliana","family":"Badillo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles M.","family":"Harris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"56_CR1","unstructured":"Copestake, C.S.: 1-generic enumeration degrees below \n                    \n                      \n                    \n                    ${{\\rm \\bf 0}\\sb e'}$\n                  . Mathematical logic. In: Proc. Summer Sch. Conf. Ded. 90th Anniv. Arend Heyting, Chaika\/Bulg, pp. 257\u2013265 (1988, 1990)"},{"issue":"4","key":"56_CR2","doi-asserted-by":"publisher","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. Journal of Symbolic Logic\u00a050(4), 983\u20131001 (1985)","journal-title":"Journal of Symbolic Logic"},{"key":"56_CR3","doi-asserted-by":"publisher","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 \n                    \n                      \n                    \n                    $\\sigma^0_2$\n                   sets. Annals of Pure and Applied Logic\u00a082, 317\u2013342 (1996)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"3","key":"56_CR4","doi-asserted-by":"publisher","first-page":"741","DOI":"10.2178\/jsl\/1122038912","volume":"70","author":"S.B. Cooper","year":"2005","unstructured":"Cooper, S.B., Li, A., Sorbi, A., Yang, Y.: Bounding and nonbounding minimal pairs in the enumeration degrees. Journal of Symbolic Logic\u00a070(3), 741\u2013766 (2005)","journal-title":"Journal of Symbolic Logic"},{"key":"56_CR5","doi-asserted-by":"publisher","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.\u00a05, 117\u2013125 (1959)","journal-title":"Zeit. Math. Log. Grund. Math."},{"key":"56_CR6","doi-asserted-by":"publisher","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. Archive for Mathematical Logic\u00a042, 553\u2013562 (2003)","journal-title":"Archive for Mathematical Logic"},{"issue":"6","key":"56_CR7","doi-asserted-by":"publisher","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. Archive for Mathematical Logic\u00a049(6), 673\u2013691 (2010)","journal-title":"Archive for Mathematical Logic"},{"key":"56_CR8","doi-asserted-by":"crossref","unstructured":"Harris, C.M.: Noncuppable enumeration degrees via finite injury. Journal of Logic and Computation (2011), doi:10.1093\/logcom\/exq044","DOI":"10.1093\/logcom\/exq044"},{"key":"56_CR9","doi-asserted-by":"publisher","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. Amer. Math. Soc.\u00a0131, 420\u2013436 (1968)","journal-title":"Trans. Amer. Math. Soc."},{"key":"56_CR10","doi-asserted-by":"publisher","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. Archive for Mathematical Logic\u00a031, 277\u2013285 (1992)","journal-title":"Archive for Mathematical Logic"},{"key":"56_CR11","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1093\/logcom\/exm042","volume":"17","author":"M.I. Soskova","year":"2007","unstructured":"Soskova, M.I.: Genericity and Nonbounding. Journal of Logic and Computation\u00a017, 1235\u20131255 (2007)","journal-title":"Journal of Logic and Computation"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:23:07Z","timestamp":1620112987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}