{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T02:32:07Z","timestamp":1649125927871},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,6,7]],"date-time":"2008-06-07T00:00:00Z","timestamp":1212796800000},"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":[[2008,7]]},"DOI":"10.1007\/s00153-008-0081-7","type":"journal-article","created":{"date-parts":[[2008,6,6]],"date-time":"2008-06-06T11:08:30Z","timestamp":1212750510000},"page":"221-231","source":"Crossref","is-referenced-by-count":0,"title":["Branching in the $${\\Sigma^0_2}$$ -enumeration degrees: a new perspective"],"prefix":"10.1007","volume":"47","author":[{"given":"Maria L.","family":"Affatato","sequence":"first","affiliation":[]},{"given":"Thomas F.","family":"Kent","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Sorbi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,6,7]]},"reference":[{"key":"81_CR1","unstructured":"Ahmad, S.: Some Results on the Structure of the \u03a32 Enumeration Degrees. Ph.D. Thesis, Simon Fraser University (1989)"},{"issue":"1","key":"81_CR2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.2307\/2274914","volume":"56","author":"S. Ahmad","year":"1991","unstructured":"Ahmad S.: Embedding the diamond in the \u03a32enumeration degrees. J. Symbolic Log. 56(1), 195\u2013212 (1991)","journal-title":"J. Symbolic Log."},{"issue":"4","key":"81_CR3","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1002\/malq.19980440402","volume":"44","author":"S. Ahmad","year":"1998","unstructured":"Ahmad S., Lachlan A.H.: Some special pairs of \u03a32 e-degrees. MLQ Math. Log. Q 44(4), 431\u2013449 (1998)","journal-title":"MLQ Math. Log. Q"},{"key":"81_CR4","doi-asserted-by":"crossref","unstructured":"Arslanov, M.M., Barry Cooper, S., Kalimullin, I.S.: Splitting properties of total enumeration degrees. Algebra Log. 42(1), 3\u201325, 125 (2003)","DOI":"10.1023\/A:1022660222520"},{"issue":"2","key":"81_CR5","doi-asserted-by":"crossref","first-page":"503","DOI":"10.2307\/2274181","volume":"49","author":"S. Barry Cooper","year":"1984","unstructured":"Barry Cooper S.: Partial degrees and the density problem. II. The enumeration degrees of the \u03a32 sets are dense. J. Symbolic Log. 49(2), 503\u2013513 (1984)","journal-title":"J. Symbolic Log."},{"key":"81_CR6","doi-asserted-by":"crossref","unstructured":"Barry Cooper, S.: Enumeration reducibility, nondeterministic computations and relative computability of partial functions. In: Recursion theory week (Oberwolfach, 1989). Lecture Notes in Math., vol. 1432, pp. 57\u2013110. Springer, Berlin (1990)","DOI":"10.1007\/BFb0086114"},{"key":"81_CR7","volume-title":"Computability Theory","author":"S. Barry Cooper","year":"2004","unstructured":"Barry Cooper S.: Computability Theory. Chapman & Hall\/CRC, London\/Boca Raton (2004)"},{"issue":"2","key":"81_CR8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0168-0072(83)90028-3","volume":"24","author":"P.A. Fejer","year":"1983","unstructured":"Fejer P.A.: The density of the nonbranching degrees. Ann. Pure Appl. Log. 24(2), 113\u2013130 (1983)","journal-title":"Ann. Pure Appl. Log."},{"key":"81_CR9","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. Am. Math. Soc. 131, 420\u2013436 (1968)","journal-title":"Trans. Am. Math. Soc."},{"issue":"4","key":"81_CR10","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. Symbolic Log. 72(4), 1405\u20131417 (2007)","journal-title":"J. Symbolic Log."},{"issue":"3","key":"81_CR11","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1112\/plms\/s3-16.1.537","volume":"16","author":"A.H. Lachlan","year":"1966","unstructured":"Lachlan A.H.: Lower bounds for pairs of recursively enumerable degrees. Proc. Lond. Math. Soc. 16(3), 537\u2013569 (1966)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"4","key":"81_CR12","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01794984","volume":"31","author":"A.H. Lachlan","year":"1992","unstructured":"Lachlan A.H., Shore R.A.: The n-rea enumeration degrees are dense. Arch. Math. Log. 31(4), 277\u2013285 (1992)","journal-title":"Arch. Math. Log."},{"key":"81_CR13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02808174","volume":"110","author":"A. Nies","year":"1999","unstructured":"Nies A., Sorbi A.: Branching in the enumeration degrees of the $${\\Sigma^0_2}$$ sets. Israel J. Math. 110, 29\u201359 (1999)","journal-title":"Israel J. Math."},{"key":"81_CR14","doi-asserted-by":"crossref","unstructured":"Slaman, T.A.: The density of infima in the recursively enumerable degrees. In: International Symposium on Mathematical Logic and its Applications (Nagoya, 1988). Ann. Pure Appl. Logic. 52(1-2):155\u2013179 (1991)","DOI":"10.1016\/0168-0072(91)90044-M"},{"key":"81_CR15","doi-asserted-by":"crossref","unstructured":"Soare, R.I.: Recursively enumerable sets and degrees. In: A study of computable functions and computably generated sets. Perspectives in Mathematical Logic. Springer, Berlin (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-008-0081-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-008-0081-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-008-0081-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T19:36:42Z","timestamp":1558640202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-008-0081-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,7]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["81"],"URL":"https:\/\/doi.org\/10.1007\/s00153-008-0081-7","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,7]]}}}