{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:33:32Z","timestamp":1725514412267},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_18","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T11:36:39Z","timestamp":1185104199000},"page":"199-211","source":"Crossref","is-referenced-by-count":0,"title":["The Strongest Nonsplitting Theorem"],"prefix":"10.1007","author":[{"given":"Mariya Ivanova","family":"Soskova","sequence":"first","affiliation":[]},{"given":"S. Barry","family":"Cooper","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","first-page":"270","volume":"283","author":"M.M. Arslanov","year":"1985","unstructured":"Arslanov, M.M.: Structural properties of the degrees below 0\u2019. Dokl. Akad. Nauk. SSSR\u00a0283, 270\u2013273 (1985)","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"18_CR2","unstructured":"Cooper, S.B.: On a theorem of C.E.M. Yates (handwritten notes) (1974)"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"527","DOI":"10.2307\/2274867","volume":"54","author":"S.B. Cooper","year":"1989","unstructured":"Cooper, S.B.: The strong anti-cupping property for recursively enumerable degrees. J. Symbolic Logic\u00a054, 527\u2013539 (1989)","journal-title":"J. Symbolic Logic"},{"key":"18_CR4","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BFb0086114","volume-title":"Recursion Theory Week, Proceedings","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.H., Sacks, G.E. (eds.) Recursion Theory Week, Proceedings, Oberwolfach, 1989. Lecture Notes in Mathematics, vol.\u00a01432, pp. 57\u2013110. Springer, Heidelberg (1990)"},{"key":"18_CR5","series-title":"Chapman & Hall\/CRC Mathematics","volume-title":"Computability Theory","author":"S.B. Cooper","year":"2004","unstructured":"Cooper, S.B.: Computability Theory. Chapman & Hall\/CRC Mathematics. Chapman & Hall\/CRC, Boca Raton (2004)"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"741","DOI":"10.2178\/jsl\/1122038912","volume":"70","author":"S.B. Cooper","year":"2005","unstructured":"Cooper, S.B., et al.: Bounding and nonbounding minimal pairs in the enumeration degrees. J. Symbolic Logic\u00a070, 741\u2013766 (2005)","journal-title":"J. Symbolic Logic"},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1215\/ijm\/1256069291","volume":"31","author":"R.G. Downey","year":"1987","unstructured":"Downey, R.G.: $\\Delta^0_2$ degrees and transfer theorems. Illinois J. Math.\u00a031, 419\u2013427 (1987)","journal-title":"Illinois J. Math."},{"key":"18_CR8","unstructured":"Harrington, L.: Understanding Lachlan\u2019s monster paper (handwritten notes) (1980)"},{"key":"18_CR9","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"},{"key":"18_CR10","doi-asserted-by":"publisher","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. Logic\u00a031, 277\u2013285 (1992)","journal-title":"Arch. Math. Logic"},{"key":"18_CR11","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"1979","DOI":"10.1007\/BFb0090974","volume-title":"Logic Year 1979\u201380: University of Connecticut","author":"D. Miller","year":"1981","unstructured":"Miller, D.: High recursively enumerable degrees and the anti-cupping property. In: Lerman, M., Schmerl, J.H., Soare, R.I. (eds.) Logic Year 1979\u201380: University of Connecticut. Lecture Notes in Mathematics, vol.\u00a0859, pp. 1979\u20131980. Springer, Heidelberg (1981)"},{"key":"18_CR12","volume-title":"Classical Recursion Theory, vol. II","author":"P.G. Odifreddi","year":"1999","unstructured":"Odifreddi, P.G.: Classical Recursion Theory, vol. II. Elsevier, Amsterdam (1999)"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"714","DOI":"10.2307\/2273221","volume":"46","author":"D.B. Posner","year":"1981","unstructured":"Posner, D.B., Robinson, R.W.: Degrees joining to 0\u2019. J. Symbolic Logic\u00a046, 714\u2013722 (1981)","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"18_CR14","doi-asserted-by":"publisher","first-page":"211","DOI":"10.2307\/1970214","volume":"77","author":"G.E. Sacks","year":"1963","unstructured":"Sacks, G.E.: On the degrees less than 0\u2019. Ann. of Math.\u00a077(2), 211\u2013231 (1963)","journal-title":"Ann. of Math."},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"160","DOI":"10.2307\/2275022","volume":"54","author":"T.A. Slaman","year":"1989","unstructured":"Slaman, T.A., Steel, J.R.: Complementation in the Turing degrees. J. Symbolic Logic\u00a054, 160\u2013176 (1989)","journal-title":"J. Symbolic Logic"},{"key":"18_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively enumerable sets and degrees","author":"R.I. Soare","year":"1987","unstructured":"Soare, R.I.: Recursively enumerable sets and degrees. Springer, Heidelberg (1987)"}],"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-72504-6_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:38:06Z","timestamp":1619516286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_18","relation":{},"subject":[]}}