{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:09Z","timestamp":1725512109355},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_49","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T05:07:56Z","timestamp":1209445676000},"page":"568-578","source":"Crossref","is-referenced-by-count":0,"title":["Total Degrees and Nonsplitting Properties of $\\Sigma_2^0$ Enumeration Degrees"],"prefix":"10.1007","author":[{"given":"M. M.","family":"Arslanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Barry","family":"Cooper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. Sh.","family":"Kalimullin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. I.","family":"Soskova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.2307\/2274914","volume":"50","author":"S. Ahmad","year":"1991","unstructured":"Ahmad, S.: Embedding the diamond in the \u03a3\n                  2 enumeration degrees. J. Symbolic Logic\u00a050, 195\u2013212 (1991)","journal-title":"J. Symbolic Logic"},{"key":"49_CR2","doi-asserted-by":"publisher","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 \n                    \n                      \n                    \n                    $\\Sigma_2^0$\n                   e-degrees properties of \n                    \n                      \n                    \n                    ${\\Sigma}_2^0-$\n                   enumeration degrees. Math. Logic Quarterly\u00a044, 431\u2013449 (1998)","journal-title":"Math. Logic Quarterly"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Arslanov, M.M., Cooper, S.B., Sh. Kalimullin, I.: Splitting properties of total enumeration degrees. Algebra and Logic\u00a042(1) (2003)","DOI":"10.1023\/A:1022660222520"},{"key":"49_CR4","unstructured":"Arslanov, M.M., Cooper, S.B., Sh. Kalimullin, I., Soskova, M.: Splitting and nonsplitting in the \n                    \n                      \n                    \n                    $\\Sigma_2^0$\n                   enumeration degrees (to appear)"},{"key":"49_CR5","volume-title":"Logic Colloquium 1998","author":"M.M. Arslanov","year":"1999","unstructured":"Arslanov, M.M., Sorbi, A.: Relative splittings of \n                    \n                      \n                    \n                    ${\\bf 0}_e^\\prime$\n                   in the \n                    \n                      \n                    \n                    ${\\Delta}_2^0$\n                   enumeration degrees. In: Buss, S., Pudlak, P. (eds.) Logic Colloquium 1998, Springer, Heidelberg (1999)"},{"key":"49_CR6","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BFb0086114","volume-title":"Recursion Theory Week, Oberwolfach 1989","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. Lecture Notes in Mathematics, vol.\u00a01432, pp. 57\u2013110. Springer, Heidelberg (1990)"},{"key":"49_CR7","unstructured":"Cooper, S.B.: Computability Theory. Chapman & Hall\/CRC, Boca Raton, London, New York, Washington, D.C (2004)"},{"key":"49_CR8","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1002\/malq.19880340603","volume":"34","author":"S.B. Cooper","year":"1988","unstructured":"Cooper, S.B., Copestake, C.S.: Properly \u03a3\n                  2 enumeration degrees. Z. Math. Logik Grundlag. Math.\u00a034, 491\u2013522 (1988)","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"49_CR9","doi-asserted-by":"publisher","first-page":"983","DOI":"10.2307\/2273985","volume":"50","author":"K. McEvoy","year":"1985","unstructured":"McEvoy, K., Cooper, S.B.: On minimal pairs of enumeration degrees. J. Symbolic Logic\u00a050, 983\u20131001 (1985)","journal-title":"J. Symbolic Logic"},{"key":"49_CR10","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0003-4843(76)90016-4","volume":"9","author":"A.H. Lachlan","year":"1975","unstructured":"Lachlan, A.H.: A recursively enumerable degree which will not split over all lesser ones. Ann. Math. Logic\u00a09, 307\u2013365 (1975)","journal-title":"Ann. Math. Logic"},{"issue":"1","key":"49_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2307\/2586537","volume":"65","author":"A. Nies","year":"2000","unstructured":"Nies, A., Sorbi, A.: Branching in the enumeration degrees of the \n                    \n                      \n                    \n                    $\\Sigma_2^0$\n                   sets. J. Symb. Log.\u00a065(1), 285\u2013292 (2000)","journal-title":"J. Symb. Log."},{"key":"49_CR12","first-page":"303","volume-title":"Complexity, Logic and Recursion Theory","author":"A. Sorbi","year":"1997","unstructured":"Sorbi, A.: The enumeration degrees of the \n                    \n                      \n                    \n                    $\\Sigma_2^0$\n                   sets. In: Sorbi, A. (ed.) Complexity, Logic and Recursion Theory, pp. 303\u2013330. Marcel Dekker, New York (1997)"},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"Soskova, M.I.: A non-splitting theorem in the enumeration degrees. Annals of Pure and Applied Logic (to appear)","DOI":"10.1016\/j.apal.2009.01.009"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:14:26Z","timestamp":1619522066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_49","relation":{},"subject":[]}}