{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:33:41Z","timestamp":1725514421304},"publisher-location":"Berlin, Heidelberg","reference-count":23,"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_7","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T11:36:39Z","timestamp":1185104199000},"page":"79-88","source":"Crossref","is-referenced-by-count":0,"title":["Elementary Differences Among Jump Hierarchies"],"prefix":"10.1007","author":[{"given":"Angsheng","family":"Li","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Cooper, S.B.: On a theorem of C.E.M. Yates (handwritten notes) (1974a)"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"655","DOI":"10.2307\/2272849","volume":"39","author":"S.B. Cooper","year":"1974","unstructured":"Cooper, S.B.: Minimal pairs and high recursively enumerable degrees. J. Symbolic Logic\u00a039, 655\u2013660 (1974b)","journal-title":"J. Symbolic Logic"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Cooper, S.B., Li, A.: Splitting and nonsplitting, II: A low2 c.e. degree above which 0\u2032 is not splittable. The Journal of Symbolic Logic\u00a067(4) (2002)","DOI":"10.2178\/jsl\/1190150292"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1002\/malq.19930390151","volume":"39","author":"R.G. Downey","year":"1993","unstructured":"Downey, R.G., Lempp, S., Shore, R.A.: Highness and bounding minimal pairs. Math. Logic Quarterly\u00a039, 475\u2013491 (1993)","journal-title":"Math. Logic Quarterly"},{"key":"7_CR5","unstructured":"Harrington, L.: On Cooper\u2019s proof of a theorem of Yates, Parts I and II (handwritten notes) (1976)"},{"issue":"7","key":"7_CR6","doi-asserted-by":"publisher","first-page":"2557","DOI":"10.1090\/S0002-9947-04-03585-8","volume":"356","author":"G. Carl","year":"2004","unstructured":"Carl, G., et al.: A join theorem for the computably enumerable degrees. Transactions of the American Mathematical Society\u00a0356(7), 2557\u20132568 (2004)","journal-title":"Transactions of the American Mathematical Society"},{"key":"7_CR7","unstructured":"Harrington, L.: Plus cupping in the recursively enumerable degrees (handwritten notes) (1978)"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"972","DOI":"10.2307\/2035595","volume":"16","author":"A.H. Lachlan","year":"1965","unstructured":"Lachlan, A.H.: On a problem of G.E. Sacks. Proc. Amer. Math. Soc.\u00a016, 972\u2013979 (1965)","journal-title":"Proc. Amer. Math. Soc."},{"key":"7_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":"7_CR10","doi-asserted-by":"publisher","first-page":"626","DOI":"10.2307\/2273300","volume":"44","author":"A.H. Lachlan","year":"1979","unstructured":"Lachlan, A.H.: Bounding minimal pairs. J. Symbolic Logic\u00a044, 626\u2013642 (1979)","journal-title":"J. Symbolic Logic"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.2307\/2270620","volume":"31","author":"D.A. Martin","year":"1966","unstructured":"Martin, D.A.: On a question of G.E. Sacks. J. Symbolic Logic\u00a031, 66\u201369 (1966a)","journal-title":"J. Symbolic Logic"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/malq.19660120125","volume":"12","author":"D.A. Martin","year":"1966","unstructured":"Martin, D.A.: Classes of recursively enumerable sets and degrees of unsolvability, 2. Math. Logik Grundlag. Math.\u00a012, 295\u2013310 (1966b)","journal-title":"Math. Logik Grundlag. Math."},{"key":"7_CR13","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0090950","volume-title":"Logic Year 1979\u20131980","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\u20131980. Lecture Notes in Mathematics, vol.\u00a0859, Springer, Heidelberg (1981)"},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1112\/S002461159800046X","volume":"77","author":"A. Nies","year":"1998","unstructured":"Nies, A., Shore, R.A., Slaman, T.A.: Interpretability and definability in the recursively enumerable degrees. Proc. London Math. (3)\u00a077(2), 241\u2013291 (1998)","journal-title":"Proc. London Math."},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2307\/1970776","volume":"93","author":"R.W. Robinson","year":"1971","unstructured":"Robinson, R.W.: Interpolation and embedding in the recursively enumerable degrees. Ann. of Math.\u00a0(2) 93, 285\u2013314 (1971a)","journal-title":"Ann. of Math."},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"586","DOI":"10.2307\/1970889","volume":"93","author":"R.W. Robinson","year":"1971","unstructured":"Robinson, R.W.: Jump restricted interpolation in the recursively enumerable degrees. Ann. of Math.\u00a0(2) 93, 586\u2013596 (1971b)","journal-title":"Ann. of Math."},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2307\/1993604","volume":"108","author":"G.E. Sacks","year":"1963","unstructured":"Sacks, G.E.: Recursive enumerability and the jump operator. Tran. Amer. Math. Soc.\u00a0108, 223\u2013239 (1963)","journal-title":"Tran. Amer. Math. Soc."},{"key":"7_CR18","doi-asserted-by":"publisher","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. of Math.\u00a0(2) 80, 300\u2013312 (1964)","journal-title":"Ann. of Math."},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"140","DOI":"10.2307\/2035242","volume":"18","author":"G.E. Sacks","year":"1967","unstructured":"Sacks, G.E.: On a theorem of Lachlan and Martin. Proc. Amer. Math. Soc.\u00a018, 140\u2013141 (1967)","journal-title":"Proc. Amer. Math. Soc."},{"key":"7_CR20","unstructured":"Shore, R.A.: The low\n                    m\n                   and low\n                    n\n                   r.e. degrees are not elementarily equivalent. Science in China, Series A (2004)"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF01621095","volume":"29","author":"R.A. Shore","year":"1990","unstructured":"Shore, R.A., Slaman, T.A.: Working below a low2 recursively enumerable degree. Archive for Math. Logic\u00a029, 201\u2013211 (1990)","journal-title":"Archive for Math. Logic"},{"issue":"3","key":"7_CR22","doi-asserted-by":"publisher","first-page":"824","DOI":"10.2307\/2275099","volume":"58","author":"R.A. Shore","year":"1993","unstructured":"Shore, R.A., Slaman, T.A.: Working below a high recursively enumerable degree. J. Symbolic Logic\u00a058(3), 824\u2013859 (1993)","journal-title":"J. Symbolic Logic"},{"key":"7_CR23","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_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:38:31Z","timestamp":1619516311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_7","relation":{},"subject":[]}}