{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T13:10:13Z","timestamp":1714396213687},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,9,16]],"date-time":"2012-09-16T00:00:00Z","timestamp":1347753600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s00224-012-9424-1","type":"journal-article","created":{"date-parts":[[2012,9,15]],"date-time":"2012-09-15T11:36:17Z","timestamp":1347708977000},"page":"2-27","source":"Crossref","is-referenced-by-count":10,"title":["Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees"],"prefix":"10.1007","volume":"52","author":[{"given":"Klaus","family":"Ambos-Spies","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Decheng","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Merkle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,16]]},"reference":[{"issue":"3\u20134","key":"9424_CR1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02007561","volume":"25","author":"K. Ambos-Spies","year":"1985","unstructured":"Ambos-Spies, K.: Cupping and noncapping in the r.e. weak truth table and Turing degrees. Arch. Math. Log. Grundl.forsch. 25(3\u20134), 109\u2013126 (1985)","journal-title":"Arch. Math. Log. Grundl.forsch."},{"key":"9424_CR2","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/11494645_2","volume-title":"Computability in Europe","author":"G. Barmpalias","year":"2005","unstructured":"Barmpalias, G.: Computably enumerable sets in the Solovay and the strong weak truth table degrees. In: Computability in Europe, Amsterdam, 2005. Lecture Notes in Comput. Sci., vol.\u00a03526, pp.\u00a08\u201317. Springer, Berlin (2005)"},{"issue":"2","key":"9424_CR3","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1090\/S0002-9947-09-04910-1","volume":"362","author":"G. Barmpalias","year":"2010","unstructured":"Barmpalias, G., Downey, R.G., Greenberg, N.: Working with strong reducibilities above totally \u03c9-c.e. and array computable degrees. Trans. Am. Math. Soc. 362(2), 777\u2013813 (2010)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1\u20132","key":"9424_CR4","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.apal.2005.10.001","volume":"141","author":"G. Barmpalias","year":"2006","unstructured":"Barmpalias, G., Lewis, A.E.M.: The ibT degrees of computably enumerable sets are not dense. Ann. Pure Appl. Log. 141(1\u20132), 51\u201360 (2006)","journal-title":"Ann. Pure Appl. Log."},{"key":"9424_CR5","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-642-03073-4_3","volume-title":"Mathematical Theory and Computational Practice, Proceedings of 5th Conference on Computability in Europe, CiE 2009","author":"D.R. B\u00e9langer","year":"2009","unstructured":"B\u00e9langer, D.R.: Structures of some strong reducibilities. In: Mathematical Theory and Computational Practice, Proceedings of 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, 19\u201324 July 2009. Lecture Notes in Comput. Sci., vol.\u00a05635, pp.\u00a021\u201330. Springer, Berlin (2009)"},{"issue":"12","key":"9424_CR6","doi-asserted-by":"crossref","first-page":"1588","DOI":"10.1016\/j.apal.2010.06.008","volume":"161","author":"A.R. Day","year":"2010","unstructured":"Day, A.R.: The computable Lipschitz degrees of computably enumerable sets are not dense. Ann. Pure Appl. Log. 161(12), 1588\u20131602 (2010)","journal-title":"Ann. Pure Appl. Log."},{"key":"9424_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic Randomness and Complexity","author":"R.G. Downey","year":"2010","unstructured":"Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Springer, Berlin (2010)"},{"key":"9424_CR8","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-44683-4_28","volume-title":"Mathematical Foundations of Computer Science","author":"R.G. Downey","year":"2001","unstructured":"Downey, R.G., Hirschfeldt, D.R., LaForte, G.: Randomness and reducibility. In: Mathematical Foundations of Computer Science, Mari\u00e1nsk\u00e9 L\u00e1zn\u011b, 2001. Lecture Notes in Comput. Sci., vol.\u00a02136, pp.\u00a0316\u2013327. Springer, Berlin (2001)"},{"issue":"1","key":"9424_CR9","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.jcss.2003.07.004","volume":"68","author":"R.G. Downey","year":"2004","unstructured":"Downey, R.G., Hirschfeldt, D.R., LaForte, G.: Randomness and reducibility. J. Comput. Syst. Sci. 68(1), 96\u2013114 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"9424_CR10","series-title":"Lecture Notes in Math.","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BFb0086116","volume-title":"Recursion Theory Week","author":"R.G. Downey","year":"1990","unstructured":"Downey, R.G., Jockusch, C., Stob, M.: Array nonrecursive sets and multiple permitting arguments. In: Recursion Theory Week, Oberwolfach, 1989. Lecture Notes in Math., vol.\u00a01432, pp.\u00a0141\u2013173. Springer, Berlin (1990)"},{"issue":"1","key":"9424_CR11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1017\/S0960129508007275","volume":"19","author":"Y. Fan","year":"2009","unstructured":"Fan, Y.: The method of the Yu-Ding theorem and its application. Math. Struct. Comput. Sci. 19(1), 207\u2013215 (2009)","journal-title":"Math. Struct. Comput. Sci."},{"key":"9424_CR12","first-page":"244","volume":"22","author":"Y. Fan","year":"2005","unstructured":"Fan, Y., Lu, H.: Some properties of sw-reducibility. J. Nanjing Univ., Math. Biq. 22, 244\u2013252 (2005)","journal-title":"J. Nanjing Univ., Math. Biq."},{"issue":"5","key":"9424_CR13","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.apal.2010.10.003","volume":"162","author":"Y. Fan","year":"2011","unstructured":"Fan, Y., Yu, L.: Maximal pairs of c.e. reals in the computably Lipschitz degrees. Ann. Pure Appl. Log. 162(5), 357\u2013366 (2011)","journal-title":"Ann. Pure Appl. Log."},{"key":"9424_CR14","series-title":"de Gruyter Ser. Log. Appl.","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1515\/9783110807486.81","volume-title":"Recursion Theory and Complexity","author":"S. Ishmukhametov","year":"1999","unstructured":"Ishmukhametov, S.: Weak recursive degrees and a problem of Spector. In: Recursion Theory and Complexity, Kazan, 1997. de Gruyter Ser. Log. Appl., vol.\u00a02, pp.\u00a081\u201387. de Gruyter, Berlin (1999)"},{"key":"9424_CR15","series-title":"Lecture Notes in Math.","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BFb0090941","volume-title":"Logic Year 1979\u201380, Proc. Seminars and Conf. Math. Logic","author":"C.G. Jockusch Jr.","year":"1981","unstructured":"Jockusch, C.G. Jr.: Three easy constructions of recursively enumerable sets. In: Logic Year 1979\u201380, Proc. Seminars and Conf. Math. Logic, Univ. Connecticut, Storrs, CT, 1979\/80. Lecture Notes in Math., vol.\u00a0859, pp.\u00a083\u201391. Springer, Berlin (1981)"},{"issue":"3","key":"9424_CR16","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.apal.2006.08.001","volume":"145","author":"A.E.M. Lewis","year":"2007","unstructured":"Lewis, A.E.M., Barmpalias, G.: Randomness and the linear degrees of computability. Ann. Pure Appl. Log. 145(3), 252\u2013257 (2007)","journal-title":"Ann. Pure Appl. Log."},{"key":"9424_CR17","series-title":"Perspectives in Mathematical Logic","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. Perspectives in Mathematical Logic. Springer, Berlin (1987)"},{"issue":"4","key":"9424_CR18","doi-asserted-by":"crossref","first-page":"457","DOI":"10.2178\/bsl\/1102083758","volume":"10","author":"R.I. Soare","year":"2004","unstructured":"Soare, R.I.: Computability theory and differential geometry. Bull. Symb. Log. 10(4), 457\u2013486 (2004)","journal-title":"Bull. Symb. Log."},{"issue":"4","key":"9424_CR19","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.2178\/jsl\/1102022216","volume":"69","author":"L. Yu","year":"2004","unstructured":"Yu, L., Ding, D.: There is no SW-complete c.e. real. J. Symb. Log. 69(4), 1163\u20131170 (2004)","journal-title":"J. Symb. Log."},{"key":"9424_CR20","unstructured":"Zambella, D.: On sequences with simple initial segments. ILLC technical report, ML-1990-05, University of Amsterdam (1990)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9424-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-012-9424-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9424-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T12:28:54Z","timestamp":1714393734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-012-9424-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,16]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["9424"],"URL":"https:\/\/doi.org\/10.1007\/s00224-012-9424-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,16]]}}}