{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T00:17:06Z","timestamp":1706660226956},"reference-count":19,"publisher":"Duke University Press","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2018,1,1]]},"DOI":"10.1215\/00294527-2018-0008","type":"journal-article","created":{"date-parts":[[2018,10,13]],"date-time":"2018-10-13T02:01:24Z","timestamp":1539396084000},"source":"Crossref","is-referenced-by-count":1,"title":["Enumeration 1-Genericity in the Local Enumeration Degrees"],"prefix":"10.1215","volume":"59","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"}]},{"given":"Mariya I.","family":"Soskova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"73","reference":[{"key":"17","unstructured":"[17] Shore, R., \u201cLecture notes on the Turing degrees,\u201d preprint, <a href=\"http:\/\/pi.math.cornell.edu\/Shore\/papers\/pdf\/SingLect2NS.pdf\">http:\/\/pi.math.cornell.edu\/Shore\/papers\/pdf\/SingLect2NS.pdf<\/a> (accessed 23June 2018)."},{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Ahmad, S., and A. H. Lachlan, \u201cSome special pairs of $\\Sigma^{0}_{2}$ e-degrees,\u201d <i>Mathematical Logic Quarterly<\/i>, vol. 44 (1998), pp. 431\u201349.","DOI":"10.1002\/malq.19980440402"},{"key":"2","unstructured":"[2] Badillo, L., \u201cGenericity in the enumeration degrees,\u201d Ph.D. dissertation, University of Leeds, Leeds, United Kingdom, 2013."},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Badillo, L., C. Bianchini, H. Ganchev, T. F. Kent, and A. Sorbi, \u201cA note on the enumeration degrees of $1$-generic sets,\u201d <i>Archive for Mathematical Logic<\/i>, vol. 55 (2016), pp. 405\u201314.","DOI":"10.1007\/s00153-015-0471-6"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Badillo, L., and C. M. Harris, \u201cAn application of $1$-genericity in the ${\\Pi}^{0}_{2}$ enumeration degrees,\u201d pp. 604\u201320 in <i>Theory and Applications of Models of Computation (Beijing, 2012)<\/i>, edited by M. Agrawal, S. Cooper, and A. Li, vol. 7287 of <i>Lecture Notes in Computer Science<\/i>, Springer, Heidelberg, 2012.","DOI":"10.1007\/978-3-642-29952-0_56"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Cooper, S. B., and C. S. Copestake, \u201cProperly $\\Sigma_{2}$ enumeration degrees,\u201d <i>Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik<\/i>, vol. 34 (1988), pp. 491\u2013522.","DOI":"10.1002\/malq.19880340603"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] Cooper, S. B., A. Sorbi, and X. Yi, \u201cCupping and noncupping in the enumeration degrees of $\\Sigma^{0}_{2}$ sets,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 82 (1996), pp. 317\u201342.","DOI":"10.1016\/S0168-0072(96)00009-7"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Copestake, K., \u201c$1$-Genericity in the enumeration degrees,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 53 (1988), pp. 878\u201387.","DOI":"10.2307\/2274578"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Friedberg, R. M., and H. Rogers, Jr., \u201cReducibility and completeness for sets of integers,\u201d <i>Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik<\/i>, vol. 5 (1959), pp. 117\u201325.","DOI":"10.1002\/malq.19590050703"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] Ganchev, H., and A. Sorbi, \u201cInitial segments of the $\\Sigma^{2}_{0}$ enumeration degrees,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 81 (2016), pp. 316\u201325.","DOI":"10.1017\/jsl.2014.84"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Harris, C. M., \u201cGoodness in the enumeration and singleton degrees,\u201d <i>Archive for Mathematical Logic<\/i>, vol. 49 (2010), pp. 673\u201391.","DOI":"10.1007\/s00153-010-0192-9"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Jockusch, C. G., Jr., \u201cSemirecursive sets and positive reducibility,\u201d <i>Transactions of the American Mathematical Society<\/i>, vol. 131 (1968), pp. 420\u201336.","DOI":"10.1090\/S0002-9947-1968-0220595-7"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] Kent, T. F., \u201cs-Degrees within e-degrees,\u201d pp. 579\u201387 in <i>Theory and Applications of Models of Computation<\/i>, edited by M. Agrawal and D. Du, vol. 4978 of <i>Lecture Notes in Computer Science<\/i>, Springer, Berlin, 2008.","DOI":"10.1007\/978-3-540-79228-4_50"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] Kent, T. F., and A. Sorbi, \u201cBounding nonsplitting enumeration degrees,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 72 (2007), pp. 1405\u201317.","DOI":"10.2178\/jsl\/1203350795"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] Lachlan, A. H., and R. A. Shore, \u201cThe $n$-rea enumeration degrees are dense,\u201d <i>Archive for Mathematical Logic<\/i>, vol. 31 (1992), pp. 277\u201385.","DOI":"10.1007\/BF01794984"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] McEvoy, K., \u201cJumps of quasiminimal enumeration degrees,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 50 (1985) pp. 839\u201348.","DOI":"10.2307\/2274335"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] McEvoy, K., and S. B. Cooper, \u201cOn minimal pairs of enumeration degrees,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 50 (1985), pp. 983\u20131001.","DOI":"10.2307\/2273985"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] Shore, R., and A. Sorbi, \u201cJumps of $\\Sigma^{0}_{2}$-high $e$-degrees and properly $\\Sigma^{0}_{2}$ $e$-degrees,\u201d pp. 157\u201372 in <i>Recursion Theory and Complexity (Kazan, 1997)<\/i>, edited by M. Arslanov and S. Lempp, vol. 2 of <i>De Gruyter Series in Logic and its Applications<\/i>, De Gruyter, Berlin, 1999.","DOI":"10.1515\/9783110807486.157"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] Soare, R. I., <i>Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets<\/i>, in <i>Perspectives in Mathematical Logic<\/i>, Springer, Berlin, 1987.","DOI":"10.1007\/978-3-662-02460-7"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2018-0008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:59:31Z","timestamp":1706648371000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-59\/issue-4\/Enumeration-1-Genericity-in-the-Local-Enumeration-Degrees\/10.1215\/00294527-2018-0008.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,1]]},"references-count":19,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2018,1,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2018-0008","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2018,1,1]]}}}