{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T01:10:21Z","timestamp":1718241021524},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2015,12,12]],"date-time":"2015-12-12T00:00:00Z","timestamp":1449878400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s00153-015-0471-6","type":"journal-article","created":{"date-parts":[[2015,12,12]],"date-time":"2015-12-12T05:58:39Z","timestamp":1449899919000},"page":"405-414","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A note on the enumeration degrees of 1-generic sets"],"prefix":"10.1007","volume":"55","author":[{"given":"Liliana","family":"Badillo","sequence":"first","affiliation":[]},{"given":"Caterina","family":"Bianchini","sequence":"additional","affiliation":[]},{"given":"Hristo","family":"Ganchev","sequence":"additional","affiliation":[]},{"given":"Thomas F.","family":"Kent","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Sorbi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,12]]},"reference":[{"key":"471_CR1","doi-asserted-by":"crossref","unstructured":"Badillo, L., Harris, C.M.: An application of 1-genericity in the $${\\Pi^{0}_{2}}$$ \u03a0 2 0 enumeration degrees. In: Agrawal, M., Cooper, S.B., Li, A. (eds.) Theory and Applications of Models of Computation. Lecture Notes in Computer Science, vol. 7287, pp. 604\u2013620. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-29952-0_56"},{"key":"471_CR2","unstructured":"Badillo, L., Harris, C.M., Soskova, M.I.: Enumeration 1-genericity in the local enumeration degrees. Preprint. http:\/\/www.maths.bris.ac.uk\/~hh12242\/papers\/pdfversions\/genericityPaperModified.pdf (2012)"},{"key":"471_CR3","unstructured":"Bianchini, C.: Bounding Enumeration Degrees. PhD thesis, University of Siena (2000)"},{"key":"471_CR4","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."},{"key":"471_CR5","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 $${\\Sigma_{2}}$$ \u03a3 2 sets are dense. J. Symb. Log. 49, 503\u2013513 (1984)","journal-title":"J. Symb. Log."},{"key":"471_CR6","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., Sacksm, G.E. (eds.) Recursion Theory Week, Oberwolfach 1989. Lecture Notes in Mathematics vol. 1432, pp. 57\u2013110. Springer, Heidelberg (1990)","DOI":"10.1007\/BFb0086114"},{"key":"471_CR7","volume-title":"Computability Theory","author":"S.B. Cooper","year":"2004","unstructured":"Cooper S.B.: Computability Theory. Chapman & Hall\/CRC Mathematics, Boca Raton (2004)"},{"key":"471_CR8","doi-asserted-by":"crossref","first-page":"878","DOI":"10.2307\/2274578","volume":"53","author":"K. Copestake","year":"1988","unstructured":"Copestake K.: 1-genericity in the enumeration degrees. J. Symb. Log. 53, 878\u2013887 (1988)","journal-title":"J. Symb. Log."},{"key":"471_CR9","doi-asserted-by":"crossref","unstructured":"Copestake, K.: 1-generic enumeration degrees below $${\\mathbf{0}'_e}$$ 0 e \u2032 . In: Proceedings of the Conference dedicated to the 90th Anniversary of Arend Heyting, Chaika, Bulgaria, 1988, pp. 257\u2013265 (1990)","DOI":"10.1007\/978-1-4613-0609-2_17"},{"key":"471_CR10","unstructured":"Feferman, S.: Some applications of the notions of forcing and generic sets. In: Addison, J.W., Henkin, L., Tarski, A. (eds.) The Theory of Models. Proceedings of the 1963 International Symposium at Berkeley, Studies in Logic and the Foundations of Mathematics, pp. 89\u201395. North\u2013Holland Publishing Co., Amsterdam (1965)"},{"key":"471_CR11","doi-asserted-by":"crossref","first-page":"770","DOI":"10.2307\/2274030","volume":"51","author":"C.A. Haught","year":"1986","unstructured":"Haught C.A.: The degrees below a 1-generic degree and less than 0\u2032. J. Symb. Log. 51, 770\u2013777 (1986)","journal-title":"J. Symb. Log."},{"key":"471_CR12","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1002\/malq.19690152004","volume":"15","author":"P.G. Hinman","year":"1969","unstructured":"Hinman P.G.: Some applications of forcing to hierarchy problems in arithmetic. Z. Math. Log. Grund. Math. 15, 341\u2013352 (1969)","journal-title":"Z. Math. Log. Grund. Math."},{"key":"471_CR13","doi-asserted-by":"crossref","unstructured":"Jockusch, C.G. Jr.: Degrees of generic sets. In: Drake, F.R., Wainer, S.S. (eds.) Recursion Theory: Its Generalizations and Applications. Proceedings of Logic Colloquium \u201979, Leeds, August 1979, pp. 110\u2013139. Cambridge University Press, Cambridge (1980)","DOI":"10.1017\/CBO9780511629181.004"},{"issue":"4","key":"471_CR14","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.2178\/jsl\/1203350795","volume":"72","author":"T.F. Kent","year":"2007","unstructured":"Kent T.F., Sorbi A.: Bounding nonsplitting enumeration degrees. J. Symb. Log. 72(4), 1405\u20131417 (2007)","journal-title":"J. Symb. Log."},{"key":"471_CR15","unstructured":"Posner, D.: High Degrees. PhD thesis, University of California, Berkeley (1977)"},{"key":"471_CR16","doi-asserted-by":"crossref","first-page":"300","DOI":"10.2307\/1970393","volume":"80","author":"G.E. Sacks","year":"1964","unstructured":"Sacks G.E.: The recursively enumerable degrees are dense. Ann. Math. 80, 300\u2013312 (1964)","journal-title":"Ann. Math."},{"key":"471_CR17","doi-asserted-by":"crossref","unstructured":"Slaman, T.A.: Mathematical definability. In: Dales, H.G., Oliveri, G. (eds.) Truth in Mathematics (Mussomeli, 1995), pp. 233\u2013251. Oxford University Press, New York (1998)","DOI":"10.1093\/oso\/9780198514763.003.0013"},{"key":"471_CR18","doi-asserted-by":"crossref","unstructured":"Soare, R.I.: Recursively enumerable sets and degrees. In: Dales, H.G., Oliveri, G. (eds.) Perspectives in Mathematical Logic, Omega Series. Springer, Heidelberg (1987)","DOI":"10.1007\/978-3-662-02460-7"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-015-0471-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-015-0471-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-015-0471-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T00:36:00Z","timestamp":1718238960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-015-0471-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,12]]},"references-count":18,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["471"],"URL":"https:\/\/doi.org\/10.1007\/s00153-015-0471-6","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,12]]}}}