{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:49:29Z","timestamp":1759146569174,"version":"3.37.3"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,8,16]],"date-time":"2017-08-16T00:00:00Z","timestamp":1502841600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["Alexander P. Kreuzer is supported by the Ministry of EducatiR146-000-184-112 (MOE2013-T2-1-062)"],"award-info":[{"award-number":["Alexander P. Kreuzer is supported by the Ministry of EducatiR146-000-184-112 (MOE2013-T2-1-062)"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001321","name":"National Research Foundation","doi-asserted-by":"publisher","award":["Incentive Funding"],"award-info":[{"award-number":["Incentive Funding"]}],"id":[{"id":"10.13039\/501100001321","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s00224-017-9798-1","type":"journal-article","created":{"date-parts":[[2017,8,16]],"date-time":"2017-08-16T03:08:10Z","timestamp":1502852890000},"page":"1376-1426","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["On the Uniform Computational Content of Computability Theory"],"prefix":"10.1007","volume":"61","author":[{"given":"Vasco","family":"Brattka","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Hendtlass","sequence":"additional","affiliation":[]},{"given":"Alexander P.","family":"Kreuzer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,16]]},"reference":[{"issue":"4","key":"9798_CR1","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.2178\/jsl\/1102022212","volume":"69","author":"K Ambos-Spies","year":"2004","unstructured":"Ambos-Spies, K., Kjos-Hanssen, B., Lempp, S., Slaman, T.A.: Comparing DNR and WWKL. J. Symb. Log. 69(4), 1089\u20131104 (2004)","journal-title":"J. Symb. Log."},{"issue":"part 1","key":"9798_CR2","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.ic.2016.12.008","volume":"253","author":"L Bienvenu","year":"2017","unstructured":"Bienvenu, L., Patey, L.: Diagonally non-computable functions and fireworks. Inf. Comput. 253(part 1), 64\u201377 (2017)","journal-title":"Inf. Comput."},{"key":"9798_CR3","volume-title":"Constructive Analysis volume 279 of Grundlehren der Mathematischen Wissenschaften","author":"E Bishop","year":"1985","unstructured":"Bishop, E., Bridges, D.S.: Constructive Analysis volume 279 of Grundlehren der Mathematischen Wissenschaften. Springer, Berlin (1985)"},{"key":"9798_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(98)00095-4","volume":"210","author":"V Brattka","year":"1999","unstructured":"Brattka, V.: Computable invariance. Theor. Comput. Sci. 210, 3\u201320 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9798_CR5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/malq.200310125","volume":"51","author":"V Brattka","year":"2005","unstructured":"Brattka, V.: Effective Borel measurability and reducibility of functions. Math. Log. Q. 51(1), 19\u201344 (2005)","journal-title":"Math. Log. Q."},{"key":"9798_CR6","doi-asserted-by":"crossref","first-page":"986","DOI":"10.1016\/j.apal.2011.12.020","volume":"163","author":"V Brattka","year":"2012","unstructured":"Brattka, V., de Brecht, M., Pauly, A.: Closed choice and a uniform low basis theorem. Ann. Pure Appl. Logic 163, 986\u20131008 (2012)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"9798_CR7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1093\/logcom\/exn027","volume":"19","author":"V Brattka","year":"2009","unstructured":"Brattka, V., Gherardi, G.: Borel complexity of topological operations on computable metric spaces. J. Log. Comput. 19(1), 45\u201376 (2009)","journal-title":"J. Log. Comput."},{"issue":"1","key":"9798_CR8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2178\/bsl\/1294186663","volume":"17","author":"V Brattka","year":"2011","unstructured":"Brattka, V., Gherardi, G.: Effective choice and boundedness principles in computable analysis. Bull. Symb. Log. 17(1), 73\u2013117 (2011)","journal-title":"Bull. Symb. Log."},{"issue":"1","key":"9798_CR9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.2178\/jsl\/1294170993","volume":"76","author":"V Brattka","year":"2011","unstructured":"Brattka, V., Gherardi, G.: Weihrauch degrees, omniscience principles and weak computability. J. Symb. Log. 76(1), 143\u2013176 (2011)","journal-title":"J. Symb. Log."},{"key":"9798_CR10","unstructured":"Brattka, V., Gherardi, G., H\u00f6lzl, R.: Las Vegas computability and algorithmic randomness. In: Mayr, E.W., Ollinger, N. (eds.) 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015), volume 30 of Leibniz International Proceedings in Informatics (LIPIcs), pages 130\u2013142, Dagstuhl, Germany, 2015. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik"},{"key":"9798_CR11","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.ic.2015.03.005","volume":"242","author":"V Brattka","year":"2015","unstructured":"Brattka, V., Gherardi, G., H\u00f6lzl, R.: Probabilistic computability and choice. Inf. Comput. 242, 249\u2013286 (2015)","journal-title":"Inf. Comput."},{"key":"9798_CR12","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.apal.2011.10.006","volume":"163","author":"V Brattka","year":"2012","unstructured":"Brattka, V., Gherardi, G., Marcone, A.: The Bolzano-Weierstra\u00df theorem is the jump of weak Ko\u030bnig\u2019s lemma. Ann. Pure Appl. Logic 163, 623\u2013655 (2012)","journal-title":"Ann. Pure Appl. Logic"},{"key":"9798_CR13","unstructured":"Brattka, V., Hendtlass, M., Kreuzer, P.: On the uniform computational content of the Baire category theorem. Notre Dame Journal of Formal Logic, (accepted for publication) (2016)"},{"issue":"2","key":"9798_CR14","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0304-3975(01)00066-4","volume":"284","author":"V Brattka","year":"2002","unstructured":"Brattka, V., Hertling, P.: Topological properties of real number representations. Theor. Comput. Sci. 284(2), 241\u2013257 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"9798_CR15","volume-title":"How the World Computes, volume 7318 of Lecture Notes in Computer Science, pages 57\u201367, Berlin, 2012. Springer. Turing Centenary Conference and 8th Conference on Computability in Europe, CiE, 2012, Cambridge, UK, June","author":"V Brattka","year":"2012","unstructured":"Brattka, V., Roux, S.L., Pauly, A.: On the computational content of the Brouwer Fixed Point Theorem. In: Cooper, S.B., Dawar, A., L\u00f6we, B. (eds.) How the World Computes, volume 7318 of Lecture Notes in Computer Science, pages 57\u201367, Berlin, 2012. Springer. Turing Centenary Conference and 8th Conference on Computability in Europe, CiE, 2012, Cambridge, UK, June (2012)"},{"key":"9798_CR16","volume-title":"CCA 2010, Proceedings of the Seventh International Conference on Computability and Complexity in Analysis, Electronic Proceedings in Theoretical Computer Science, pp. 41\u201355","author":"V Brattka","year":"2010","unstructured":"Brattka, V., Pauly, A.: Computation with advice. In: Zheng, X., Zhong, N. (eds.) CCA 2010, Proceedings of the Seventh International Conference on Computability and Complexity in Analysis, Electronic Proceedings in Theoretical Computer Science, pp. 41\u201355 (2010)"},{"key":"9798_CR17","unstructured":"Brattka, V., Pauly, A.: On the algebraic structure of Weihrauch degrees. arXiv: 1604.08348 (2016)"},{"key":"9798_CR18","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0304-3975(02)00693-X","volume":"305","author":"V Brattka","year":"2003","unstructured":"Brattka, V., Presser, G.: Computability on subsets of metric spaces. Theor. Comput. Sci. 305, 43\u201376 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9798_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2694910","volume":"66","author":"PA Cholak","year":"2001","unstructured":"Cholak, P.A., Jockusch, C.G., Slaman, T.A.: On the strength of Ramsey\u2019s theorem for pairs. J. Symb. Log. 66(1), 1\u201355 (2001)","journal-title":"J. Symb. Log."},{"key":"9798_CR20","doi-asserted-by":"crossref","first-page":"249","DOI":"10.2307\/2272061","volume":"38","author":"SB Cooper","year":"1973","unstructured":"Cooper, S.B.: Minimal degrees and the jump operator. J. Symb. Log. 38, 249\u2013271 (1973)","journal-title":"J. Symb. Log."},{"key":"9798_CR21","volume-title":"Computability theory","author":"BS Cooper","year":"2004","unstructured":"Cooper, B.S.: Computability theory. Chapman & Hall\/CRC, Boca Raton (2004)"},{"issue":"2","key":"9798_CR22","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1090\/tran\/6465","volume":"368","author":"FG Dorais","year":"2016","unstructured":"Dorais, F.G., Dzhafarov, D.D., Hirst, J.L., Mileti, J.R., Shafer, P.: On uniform relationships between combinatorial problems. Trans. Am. Math. Soc. 368 (2), 1321\u20131359 (2016)","journal-title":"Trans. Am. Math. Soc."},{"issue":"4","key":"9798_CR23","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1017\/jsl.2015.43","volume":"80","author":"FG Dorais","year":"2015","unstructured":"Dorais, F.G., Hirst, J.L., Shafer, P.: Comparing the strength of diagonally nonrecursive functions in the absence of \u03a3 2 0 ${{\\Sigma }^{0}_{2}}$ induction. J. Symb. Log. 80(4), 1211\u20131235 (2015)","journal-title":"J. Symb. Log."},{"issue":"3","key":"9798_CR24","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s00493-011-2634-3","volume":"31","author":"RG Downey","year":"2011","unstructured":"Downey, R.G., Greenberg, N., Jockusch Jr., C.G., Milans, K.G.: Binary subtrees with few labeled paths. Combinatorica 31(3), 285\u2013303 (2011)","journal-title":"Combinatorica"},{"key":"9798_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic randomness and complexity. Theory and Applications of Computability","author":"RG Downey","year":"2010","unstructured":"Downey, R.G., Hirschfeldt, D.R.: Algorithmic randomness and complexity. Theory and Applications of Computability. Springer, New York (2010)"},{"key":"9798_CR26","doi-asserted-by":"crossref","first-page":"159","DOI":"10.2307\/2964177","volume":"22","author":"R Friedberg","year":"1957","unstructured":"Friedberg, R.: A criterion for completeness of degrees of unsolvability. J. Symb. Logic 22, 159\u2013160 (1957)","journal-title":"J. Symb. Logic"},{"issue":"4","key":"9798_CR27","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1215\/00294527-2009-018","volume":"50","author":"G Gherardi","year":"2009","unstructured":"Gherardi, G., Marcone, A.: How incomputable is the separable Hahn-Banach theorem Notre Dame J. Formal Logic 50(4), 393\u2013425 (2009)","journal-title":"Notre Dame J. Formal Logic"},{"issue":"4","key":"9798_CR28","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1017\/jsl.2016.38","volume":"81","author":"M Hendtlass","year":"2016","unstructured":"Hendtlass, M., Lubarsky, R.: Separating fragments of WLEM, LPO, and MP. J. Symb. Log. 81(4), 12 (2016)","journal-title":"J. Symb. Log."},{"key":"9798_CR29","volume-title":"Unstetigkeitsgrade von Funktionen in der effektiven Analysis. Informatik Berichte 208","author":"P Hertling","year":"1996","unstructured":"Hertling, P.: Unstetigkeitsgrade von Funktionen in der effektiven Analysis. Informatik Berichte 208. FernUniversit\u00e4t Hagen, Hagen (1996). Dissertation"},{"issue":"6","key":"9798_CR30","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1016\/j.apal.2014.03.001","volume":"165","author":"K Higuchi","year":"2014","unstructured":"Higuchi, K., Kihara, T.: Inside the Muchnik degrees II: The degree structures induced by the arithmetical hierarchy of countably continuous functions. Ann. Pure Appl. Logic 165(6), 1201\u20131241 (2014)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2","key":"9798_CR31","doi-asserted-by":"crossref","first-page":"2:02, 17","DOI":"10.2168\/LMCS-9(2:2)2013","volume":"9","author":"K Higuchi","year":"2013","unstructured":"Higuchi, K., Pauly, A.: The degree structure of Weihrauch reducibility. Log. Methods Comput. Sci. 9(2), 2:02, 17 (2013)","journal-title":"Log. Methods Comput. Sci."},{"key":"9798_CR32","volume-title":"Slicing the Truth, On the Computable and Reverse Mathematics of Combinatorial Principles, volume 28 of Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore","author":"DR Hirschfeldt","year":"2015","unstructured":"Hirschfeldt, D.R.: Slicing the Truth, On the Computable and Reverse Mathematics of Combinatorial Principles, volume 28 of Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore. World Scientific, Singapore (2015)"},{"issue":"1","key":"9798_CR33","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/COM-2012-005","volume":"1","author":"M Hoyrup","year":"2012","unstructured":"Hoyrup, M., Rojas, C., Weihrauch, K.: Computability of the Radon-Nikodym derivative. Computability 1(1), 3\u201313 (2012)","journal-title":"Computability"},{"issue":"4","key":"9798_CR34","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1002\/malq.19930390153","volume":"39","author":"C Jockusch","year":"1993","unstructured":"Jockusch, C., Stephan, F.: A cohesive set which is not high. Math. Log. Q. 39(4), 515\u2013530 (1993)","journal-title":"Math. Log. Q."},{"issue":"4","key":"9798_CR35","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1002\/malq.19970430412","volume":"43","author":"C Jockusch","year":"1997","unstructured":"Jockusch, C., Stephan, F.: Correction to A cohesive set which is not high. Math. Log. Q. 43(4), 569 (1997)","journal-title":"Math. Log. Q."},{"key":"9798_CR36","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/BF02787575","volume":"15","author":"CG Jockusch Jr.","year":"1973","unstructured":"Jockusch Jr., C.G.: Upward closure and cohesive degrees. Israel J. Math. 15, 332\u2013335 (1973)","journal-title":"Israel J. Math."},{"key":"9798_CR37","doi-asserted-by":"crossref","unstructured":"Jockusch Jr., C.G.: Degrees of functions with no fixed points. In: Logic, methodology and philosophy of science, VIII (Moscow, 1987), volume 126 of Stud. Logic Found. Math., pages 191\u2013201, Amsterdam, 1989. North-Holland","DOI":"10.1016\/S0049-237X(08)70045-4"},{"issue":"3","key":"9798_CR38","doi-asserted-by":"crossref","first-page":"977","DOI":"10.2178\/jsl.7803150","volume":"78","author":"CG Jockusch Jr.","year":"2013","unstructured":"Jockusch Jr., C.G., Lewis, E.M.A: Diagonally non-computable functions and bi-immunity. J. Symb. Log. 78(3), 977\u2013988 (2013)","journal-title":"J. Symb. Log."},{"key":"9798_CR39","first-page":"33","volume":"173","author":"CG Jockusch Jr.","year":"1972","unstructured":"Jockusch Jr., C.G., Soare, R.I.: \u03c0 1 0 ${\\Pi }^{0}_{1}$ classes and degrees of theories. Trans. Am. Math. Soc. 173, 33\u201356 (1972)","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"9798_CR40","doi-asserted-by":"crossref","first-page":"379","DOI":"10.2307\/1969708","volume":"59","author":"SC Kleene","year":"1954","unstructured":"Kleene, S.C., Post, E.L.: The upper semi-lattice of degrees of recursive unsolvability. Ann. Math. 59(2), 379\u2013407 (1954)","journal-title":"Ann. Math."},{"issue":"3","key":"9798_CR41","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1002\/malq.201010008","volume":"57","author":"AP Kreuzer","year":"2011","unstructured":"Kreuzer, A.P.: The cohesive principle and the Bolzano-Weierstra\u00df principle. Math. Log. Q. 57(3), 292\u2013298 (2011)","journal-title":"Math. Log. Q."},{"issue":"2","key":"9798_CR42","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3233\/COM-12010","volume":"1","author":"AP Kreuzer","year":"2012","unstructured":"Kreuzer, A.P.: On the strength of weak compactness. Computability 1(2), 171\u2013179 (2012)","journal-title":"Computability"},{"key":"9798_CR43","doi-asserted-by":"crossref","unstructured":"Ku\u010dera, A.: Measure, \u03c0 1 0 ${{\\Pi }^{0}_{1}}$ -classes and complete extensions of PA. In: Recursion theory week (Oberwolfach, 1984), volume 1141 of Lecture Notes in Math., pages 245\u2013259, Berlin, 1985. Springer","DOI":"10.1007\/BFb0076224"},{"key":"9798_CR44","volume-title":"Randomness and Genericity in the Degrees of Unsolvability","author":"SA Kurtz","year":"1981","unstructured":"Kurtz, S.A.: Randomness and Genericity in the Degrees of Unsolvability. University of Illinois at Urbana-Champaign, PhD thesis (1981)"},{"key":"9798_CR45","unstructured":"Miller, J.S.: Pi-0-1 Classes in Computable Analysis and Topology. PhD thesis, Cornell University, Ithaca, USA (2002)"},{"key":"9798_CR46","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001","volume-title":"Computability and Randomness, volume 51 of Oxford Logic Guides","author":"A Nies","year":"2009","unstructured":"Nies, A.: Computability and Randomness, volume 51 of Oxford Logic Guides. Oxford University Press, New York (2009)"},{"key":"9798_CR47","volume-title":"Classical Recursion Theory volume 125 of Studies in Logic and the Foundations of Mathematics","author":"P Odifreddi","year":"1989","unstructured":"Odifreddi, P.: Classical Recursion Theory volume 125 of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam (1989)"},{"issue":"18","key":"9798_CR48","first-page":"2686","volume":"16","author":"A Pauly","year":"2010","unstructured":"Pauly, A.: How incomputable is finding Nash equilibria J. Universal Comput. Sci. 16(18), 2686\u20132710 (2010)","journal-title":"J. Universal Comput. Sci."},{"issue":"5","key":"9798_CR49","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1002\/malq.200910104","volume":"56","author":"A Pauly","year":"2010","unstructured":"Pauly, A.: On the (semi)lattices induced by continuous reducibilities. Math. Log. Q. 56(5), 488\u2013502 (2010)","journal-title":"Math. Log. Q."},{"key":"9798_CR50","unstructured":"Pauly, A.: Computable Metamathematics and its Application to Game Theory. PhD thesis, University of Cambridge, Computer Laboratory, Clare College, Cambridge (2011)"},{"key":"9798_CR51","volume-title":"Handbook of Mathematical Logic, volume 90 of Studies in Logic and the Foundations of Mathematics, pages 631\u2013652. North-Holland, Amsterdam","author":"SG Simpson","year":"1977","unstructured":"Simpson, S.G.: Degrees of unsolvability: A survey of results. In: Barwise, J. (ed.) Handbook of Mathematical Logic, volume 90 of Studies in Logic and the Foundations of Mathematics, pages 631\u2013652. North-Holland, Amsterdam (1977)"},{"issue":"4","key":"9798_CR52","doi-asserted-by":"crossref","first-page":"385","DOI":"10.2178\/bsl\/1255526079","volume":"15","author":"SG Simpson","year":"2009","unstructured":"Simpson, S.G.: Mass problems and measure-theoretic regularity. Bull. Symb. Log. 15(4), 385\u2013409 (2009)","journal-title":"Bull. Symb. Log."},{"key":"9798_CR53","volume-title":"Evolving computability, volume 9136 of Lecture Notes in Computer Science, pages 83\u201394. Springer, Cham","author":"SG Simpson","year":"2015","unstructured":"Simpson, S.G.: Degrees of unsolvability: a tutorial. In: Evolving computability, volume 9136 of Lecture Notes in Computer Science, pages 83\u201394. Springer, Cham (2015)"},{"key":"9798_CR54","unstructured":"von Stein, T.: Vergleich nicht konstruktiv l\u00f6sbarer Probleme in der Analysis. PhD thesis, Fachbereich Informatik, FernUniversit\u00e4t Hagen. Diplomarbeit (1989)"},{"issue":"2","key":"9798_CR55","doi-asserted-by":"crossref","first-page":"2:19:21","DOI":"10.2168\/LMCS-7(2:19)2011","volume":"7","author":"NR Tavana","year":"2011","unstructured":"Tavana, N.R., Weihrauch, K.: Turing machines on represented sets, a model of computation for analysis. Log. Methods Comput. Sci. 7(2), 2:19:21 (2011)","journal-title":"Log. Methods Comput. Sci."},{"issue":"3","key":"9798_CR56","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.2307\/2274480","volume":"55","author":"M Lambalgen van","year":"1990","unstructured":"van Lambalgen, M.: The axiomatization of randomness. J. Symb. Log. 55(3), 1143\u20131167 (1990)","journal-title":"J. Symb. Log."},{"key":"9798_CR57","volume-title":"The degrees of discontinuity of some translators between representations of the real numbers. Technical Report TR-92-050","author":"K Weihrauch","year":"1992","unstructured":"Weihrauch, K.: The degrees of discontinuity of some translators between representations of the real numbers. Technical Report TR-92-050. International Computer Science Institute, Berkeley (1992)"},{"key":"9798_CR58","volume-title":"The TTE-interpretation of three hierarchies of omniscience principles. Informatik Berichte 130","author":"K Weihrauch","year":"1992","unstructured":"Weihrauch, K.: The TTE-interpretation of three hierarchies of omniscience principles. Informatik Berichte 130. FernUniversit\u00e4t Hagen, Hagen (1992)"},{"key":"9798_CR59","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"Klaus Weihrauch","year":"2000","unstructured":"Klaus Weihrauch: Computable Analysis. Springer, Berlin (2000)"},{"issue":"2","key":"9798_CR60","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s00153-005-0306-y","volume":"45","author":"Y Liang","year":"2006","unstructured":"Liang, Y.: Lowness for genericity. Arch. Math. Log. 45(2), 233\u2013238 (2006)","journal-title":"Arch. Math. Log."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-017-9798-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9798-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9798-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T08:37:54Z","timestamp":1602751074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-017-9798-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,16]]},"references-count":60,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["9798"],"URL":"https:\/\/doi.org\/10.1007\/s00224-017-9798-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2017,8,16]]}}}