{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T14:57:44Z","timestamp":1648565864741},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,6,27]],"date-time":"2008-06-27T00:00:00Z","timestamp":1214524800000},"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,8]]},"DOI":"10.1007\/s00153-008-0083-5","type":"journal-article","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T10:55:42Z","timestamp":1214477742000},"page":"341-434","source":"Crossref","is-referenced-by-count":3,"title":["On Lachlan\u2019s major sub-degree problem"],"prefix":"10.1007","volume":"47","author":[{"given":"S. Barry","family":"Cooper","sequence":"first","affiliation":[]},{"given":"Angsheng","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,6,27]]},"reference":[{"key":"83_CR1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0168-0072(93)90143-2","volume":"64","author":"K. Ambos-Spies","year":"1993","unstructured":"Ambos-Spies K., Lachlan A.H., Soare R.I.: The continuity of cupping to 0\u2032. Ann. Pure Appl. Log. 64, 195\u2013209 (1993)","journal-title":"Ann. Pure Appl. Log."},{"key":"83_CR2","unstructured":"Cooper, S.B.: On a theorem of C.E.M. Yates (handwritten notes) (1974a)"},{"key":"83_CR3","doi-asserted-by":"crossref","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. Symb. Log. 39, 655\u2013660 (1974b)","journal-title":"J. Symb. Log."},{"key":"83_CR4","volume-title":"Computability Theory","author":"S.B. Cooper","year":"2004","unstructured":"Cooper S.B.: Computability Theory. Chapman & Hall\/CRC Press, London\/West Palm Beach (2004)"},{"issue":"4","key":"83_CR5","doi-asserted-by":"crossref","first-page":"1391","DOI":"10.2178\/jsl\/1190150292","volume":"67","author":"S.B. Cooper","year":"2002","unstructured":"Cooper S.B., Li A.: Splitting and nonsplitting, II: A Low2 c.e. degree above which 0\u2032 is not splittable. J. Symb. Log. 67(4), 1391\u20131430 (2002)","journal-title":"J. Symb. Log."},{"key":"83_CR6","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1073\/pnas.43.2.236","volume":"43","author":"R.M. Friedberg","year":"1957","unstructured":"Friedberg R.M.: Two recursively enumerable sets of incomparable degrees of unsolvability. Proc. Natl. Acad. Sci. USA 43, 236\u2013238 (1957)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"83_CR7","unstructured":"Giorgi, M.B.: Continuity properties of degree structures. Ph.D. Dissertation, University of Leeds (2001)"},{"key":"83_CR8","unstructured":"Harrington, L.: On Cooper\u2019s Proof of a Theorem of Yates, Part I, (handwritten notes) (1976)"},{"key":"83_CR9","unstructured":"Harrington, L.: Understanding Lachlan\u2019s Monster Paper (handwritten notes) (1980)"},{"key":"83_CR10","unstructured":"Harrington, L., Soare, R.I.: Games in recursion theory and continuity properties of capping degrees. In: Proceedings of the Workshop on Set Theory and the Continuum. Mathematical Sciences Research Institute, Berkeley, 16\u201320 Oct 1989"},{"key":"83_CR11","first-page":"599","volume":"275","author":"C.G. Jockusch Jr.","year":"1983","unstructured":"Jockusch C.G. Jr., Shore R.A.: Pseudo jump operators I: the R.E. case. Trans. Am. Math. Soc. 275, 599\u2013609 (1983)","journal-title":"Trans. Am. Math. Soc."},{"key":"83_CR12","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, 537\u2013569 (1966)","journal-title":"Proc. Lond. Math. Soc."},{"key":"83_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0002-9947-1968-0227009-1","volume":"130","author":"A.H. Lachlan","year":"1968","unstructured":"Lachlan A.H.: On the lattice of recursively enumerable sets. Trans. Am. Math. Soc. 130, 1\u201337 (1968)","journal-title":"Trans. Am. Math. Soc."},{"key":"83_CR14","doi-asserted-by":"crossref","unstructured":"Lachlan, A.H.: Embedding nondistributive lattices in the recursively enumerable degrees. In: Hodges, W. (ed.) Conference in mathematical logic, London, 1970. Lecture Notes in Mathematics, vol. 255. Springer, Berlin (1972)","DOI":"10.1007\/BFb0059544"},{"key":"83_CR15","doi-asserted-by":"crossref","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. Log. 9, 307\u2013365 (1975)","journal-title":"Ann. Math. Log."},{"key":"83_CR16","doi-asserted-by":"crossref","first-page":"626","DOI":"10.2307\/2273300","volume":"44","author":"A.H. Lachlan","year":"1979","unstructured":"Lachlan A.H.: Bounding minimal pairs. J. Symb. Log. 44, 626\u2013642 (1979)","journal-title":"J. Symb. Log."},{"key":"83_CR17","doi-asserted-by":"crossref","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: University of Connecticut. Lecture Notes in Mathematics, vol. 859, pp. 230\u2013245. Springer, Berlin (1981)","DOI":"10.1007\/BFb0090950"},{"key":"83_CR18","unstructured":"Muchnik, A.A.: On the unsolvability of the problem of reducibility in the theory of algorithms. Dokl. Akad. Nauk SSSR N.S. 108, 194\u2013197 (Russian) (1956)"},{"key":"83_CR19","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1090\/S0002-9904-1944-08111-1","volume":"50","author":"E.L. Post","year":"1944","unstructured":"Post E.L.: Recursively enumerable sets of positive integers and their decision problems. Bull. Am. Math. Soc. 50, 284\u2013316 (1944)","journal-title":"Bull. Am. Math. Soc."},{"issue":"2","key":"83_CR20","doi-asserted-by":"crossref","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. Math. 93(2), 285\u2013314 (1971)","journal-title":"Ann. Math."},{"key":"83_CR21","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr.","year":"1967","unstructured":"Rogers H. Jr.: Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Company, New York (1967)"},{"issue":"2","key":"83_CR22","doi-asserted-by":"crossref","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\u2032. Ann. Math. 77(2), 211\u2013231 (1963)","journal-title":"Ann. Math."},{"issue":"2","key":"83_CR23","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(2), 300\u2013312 (1964)","journal-title":"Ann. Math."},{"key":"83_CR24","unstructured":"Seetapun, D.: Contributions to recursion theory. Ph.D. Thesis, Trinity College, Cambridge (1991)"},{"key":"83_CR25","unstructured":"Seetapun, D.: Defeating Red, (handwritten notes) (1992)"},{"key":"83_CR26","volume-title":"Symposium on the Theory of Models","author":"J.R. Shoenfield","year":"1965","unstructured":"Shoenfield J.R.: Application of model theory to degrees of unsolvability. In: Addison, J.W., Henkin, L., Tarski, A.(eds) Symposium on the Theory of Models, North-Holland, Amsterdam (1965)"},{"key":"83_CR27","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01621095","volume":"29","author":"R.A. Shore","year":"1990","unstructured":"Shore R.A., Slaman T.A.: Working below low2 recursively enumerable degrees. Arch. Math. Log. 29, 201\u2013211 (1990)","journal-title":"Arch. Math. Log."},{"key":"83_CR28","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1073\/pnas.92.2.617","volume":"92","author":"T.A. Slaman","year":"1995","unstructured":"Slaman T.A., Soare R.I.: Algebraic aspects of the recursively enumerable degrees. Proc. Nat. Acad. Sci. USA 92, 617\u2013621 (1995)","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"83_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees, a Study of Computable Function and Computably Generated Sets","author":"R.I. Soare","year":"1987","unstructured":"Soare R.I.: Recursively Enumerable Sets and Degrees, a Study of Computable Function and Computably Generated Sets. Springer, Berlin (1987)"},{"key":"83_CR30","doi-asserted-by":"crossref","first-page":"159","DOI":"10.2307\/2269807","volume":"31","author":"C.E.M. Yates","year":"1966","unstructured":"Yates C.E.M.: A minimal pair of recursively enumerable degrees. J. Symb. Log. 31, 159\u2013168 (1966)","journal-title":"J. Symb. Log."}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-008-0083-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-008-0083-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-008-0083-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T15:36:42Z","timestamp":1558625802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-008-0083-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,27]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["83"],"URL":"https:\/\/doi.org\/10.1007\/s00153-008-0083-5","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,27]]}}}