{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T05:48:53Z","timestamp":1774590533273,"version":"3.50.1"},"publisher-location":"Cham","reference-count":77,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319200279","type":"print"},{"value":"9783319200286","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20028-6_9","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:37Z","timestamp":1434708457000},"page":"83-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Degrees of Unsolvability: A Tutorial"],"prefix":"10.1007","author":[{"given":"Stephen G.","family":"Simpson","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Aanderaa, S., Cohen, D.E.: Modular machines I, II. In: [2], pp. 1\u201318, 19\u201328 (1980)","DOI":"10.1016\/S0049-237X(08)71327-2"},{"key":"9_CR2","unstructured":"Adian, S.I., Boone, W.W., Higman, G. (eds.): Word Problems II: The Oxford Book. Studies in Logic and the Foundations of Mathematics, X + 578 p., North-Holland (1980)"},{"key":"9_CR3","doi-asserted-by":"publisher","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. Symbolic Logic 69, 1089\u20131104 (2004)","journal-title":"J. Symbolic Logic"},{"key":"9_CR4","unstructured":"Barwise, J., Keisler, H.J., Kunen, K. (eds.): The Kleene Symposium. Studies in Logic and the Foundations of Mathematics, XX + 425 p., North-Holland (1980)"},{"key":"9_CR5","unstructured":"Basu, S.S., Simpson, S.G.: Mass problems and intuitionistic higher-order logic, 44 p., 12 August 2014. http:\/\/arxiv.org\/abs\/1408.2763"},{"key":"9_CR6","series-title":"Memoirs of the American Mathematical Society","first-page":"72","volume-title":"The Undecidability of the Domino Problem","author":"R Berger","year":"1966","unstructured":"Berger, R.: The Undecidability of the Domino Problem. Memoirs of the American Mathematical Society, vol. 66, p. 72. American Mathematical Society, Providence (1966)"},{"key":"9_CR7","unstructured":"Bienvenu, L., Porter, C.P.: Deep $$\\Pi ^0_1$$ classes, 37 p., 4 June 2014. http:\/\/arxiv.org\/abs\/1403.0450v2"},{"issue":"4","key":"9_CR8","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1002\/malq.200310034","volume":"49","author":"S Binns","year":"2003","unstructured":"Binns, S.: A splitting theorem for the medvedev and muchnik lattices. Math. Logic Q. 49(4), 327\u2013335 (2003)","journal-title":"Math. Logic Q."},{"key":"9_CR9","unstructured":"Binns, S., Shore, R.A., Simpson, S.G.: Mass problems and density, in preparation, 5 p., 1 March 2014"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s00153-003-0195-x","volume":"43","author":"S Binns","year":"2004","unstructured":"Binns, S., Simpson, S.G.: Embeddings into the medvedev and muchnik lattices of $$\\Pi ^0_1$$ classes. Arch. Math. Logic 43, 399\u2013414 (2004)","journal-title":"Arch. Math. Logic"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Chong, C.T., Feng, Q., Slaman, T.A., Woodin, W.H., Yang, Y. (eds.): Computational Prospects of Infinity. In: Proceedings of the Logic Workshop at the Institute for Mathematical Sciences, Part I: Tutorials in Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, World Scientific, 20 June\u201315 August, 2005, no. 14, 264 p. (2008)","DOI":"10.1142\/6769"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"40","DOI":"10.2307\/2269326","volume":"1","author":"A Church","year":"1936","unstructured":"Church, A.: A note on the Entscheidungsproblem. J. Symbolic Logic 1, 40\u201341 (1936)","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1142\/S0219061307000652","volume":"7","author":"JA Cole","year":"2008","unstructured":"Cole, J.A., Simpson, S.G.: Mass problems and hyperarithmeticity. J. Math. Logic 7(2), 125\u2013143 (2008)","journal-title":"J. Math. Logic"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.2307\/2318447","volume":"80","author":"M Davis","year":"1973","unstructured":"Davis, M.: Hilbert\u2019s tenth problem is unsolvable. Am. Math. Mon. 80, 233\u2013269 (1973)","journal-title":"Am. Math. Mon."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Dekker, J.C.E. (ed.): Recursive function theory. In: Proceedings of Symposia in Pure Mathematics, American Mathematical Society, VII + 247 p. (1962)","DOI":"10.1090\/pspum\/005"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Theory and Applications of Computability, XXVIII + 855 p. Springer, New York (2010)","DOI":"10.1007\/978-0-387-68441-3"},{"issue":"3","key":"9_CR17","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/j.jcss.2011.11.001","volume":"78","author":"B Durand","year":"2012","unstructured":"Durand, B., Romashchenko, A., Shen, A.: Fixed-point tile sets and their applications. J. Comput. Syst. Sci. 78(3), 731\u2013764 (2012). doi:10.1016\/j.jcss.2011.11.001","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR18","unstructured":"Fenstad, J.E., Frolov, I.T., Hilpinen, R. (eds.): Logic, Methodology and Philosophy of Science VIII. No. 126 in Studies in Logic and the Foundations of Mathematics, XVII + 702 p., North-Holland (1989)"},{"key":"9_CR19","unstructured":"FOM e-mail list September 1997 to the present. http:\/\/www.cs.nyu.edu\/mailman\/listinfo\/fom\/"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Fourman, M.P., Mulvey, C.J., Scott, D.S. (eds.): Applications of Sheaves, Proceedings, Durham, 1977. No. 753 in Lecture Notes in Mathematics, XIV + 779 p., Springer (1979)","DOI":"10.1007\/BFb0061811"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Fourman, M.P., Scott, D.S.: Sheaves and logic. In: [20], pp. 302\u2013401 (1979)","DOI":"10.1007\/BFb0061824"},{"key":"9_CR22","unstructured":"Gandy, R.O., Kreisel, G., Tait, W.W.: Set existence. In: Bulletin de l\u2019Acad\u00e9mie Polonaise des Sciences, S\u00e9rie des Sciences Math\u00e9matiques, Astronomiques et Physiques, vol. 8, pp. 577\u2013582 (1960)"},{"issue":"4","key":"9_CR23","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1112\/blms\/bdr003","volume":"43","author":"N Greenberg","year":"2011","unstructured":"Greenberg, N., Miller, J.S.: Diagonally non-recursive functions and effective Hausdorff dimension. Bull. Lond. Math. Soc. 43(4), 636\u2013654 (2011)","journal-title":"Bull. Lond. Math. Soc."},{"issue":"1","key":"9_CR24","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1017\/jsl.2013.7","volume":"79","author":"WMP Hudelson","year":"2014","unstructured":"Hudelson, W.M.P.: Mass problems and initial segment complexity. J. Symbolic Logic 79(1), 20\u201344 (2014)","journal-title":"J. Symbolic Logic"},{"key":"9_CR25","unstructured":"Jech, T.: Set Theory, XI + 621 p., Academic Press (1978)"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Jockusch Jr. C.G.: Degrees of functions with no fixed points. In: [18], pp. 191\u2013201 (1989)","DOI":"10.1016\/S0049-237X(08)70045-4"},{"key":"9_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0003-4843(76)90023-1","volume":"10","author":"CG Jockusch Jr","year":"1976","unstructured":"Jockusch Jr. C.G., Simpson, S.G.: A degree-theoretic definition of the ramified analytical hierarchy. Ann. Math. Logic 10, 1\u201332 (1976)","journal-title":"Ann. Math. Logic"},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"605","DOI":"10.2140\/pjm.1972.40.605","volume":"40","author":"CG Jockusch Jr","year":"1972","unstructured":"Jockusch Jr. C.G., Soare, R.I.: Degrees of members of $$\\Pi ^0_1$$ classes. Pac. J. Math. 40, 605\u2013616 (1972)","journal-title":"Pac. J. Math."},{"key":"9_CR29","first-page":"35","volume":"173","author":"CG Jockusch Jr","year":"1972","unstructured":"Jockusch Jr. C.G., Soare, R.I.: $$\\Pi ^0_1$$ classes and degrees of theories. Trans. Am. Math. Soc. 173, 35\u201356 (1972)","journal-title":"Trans. Am. Math. Soc."},{"key":"9_CR30","unstructured":"Khan, M., Kjos-Hanssen, B., Miller, J.S.: The Computability Menagerie (2015). http:\/\/www.math.wisc.edu\/~jmiller\/"},{"key":"9_CR31","unstructured":"Khan, M., Miller, J.S.: Forcing with bushy trees, 18 p., 30 March 2015. http:\/\/arxiv.org\/abs\/1503.08870v1"},{"key":"9_CR32","doi-asserted-by":"publisher","first-page":"5465","DOI":"10.1090\/S0002-9947-2011-05306-7","volume":"363","author":"B Kjos-Hanssen","year":"2011","unstructured":"Kjos-Hanssen, B., Merkle, W., Stephan, F.: Kolmogorov complexity and the recursion theorem. Trans. Am. Math. Soc. 363, 5465\u20135480 (2011)","journal-title":"Trans. Am. Math. Soc."},{"key":"9_CR33","unstructured":"Kleene, S.C.: Introduction to Metamathematics, X + 550 p., Van Nostrand (1952)"},{"key":"9_CR34","doi-asserted-by":"publisher","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, 379\u2013407 (1954)","journal-title":"Ann. Math."},{"key":"9_CR35","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/BF01186549","volume":"35","author":"A Kolmogoroff","year":"1932","unstructured":"Kolmogoroff, A.: Zur Deutung der intuitionistischen Logik. Math. Z. 35, 58\u201365 (1932)","journal-title":"Math. Z."},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Kolmogorov, A.N.: On the interpretation of intuitionistic logic. In: [76], translation of [35] with commentary and additional references, pp. 151\u2013158 and 451\u2013466 (1991)","DOI":"10.1007\/978-94-011-3030-1_19"},{"key":"9_CR37","doi-asserted-by":"crossref","unstructured":"Lerman, M.: Degrees of Unsolvability. Perspectives in Mathematical Logic, XIII + 307 p., Springer, Berlin (1983)","DOI":"10.1007\/978-3-662-21755-9"},{"key":"9_CR38","unstructured":"Lerman, M.: A Framework for Priority Arguments. Lecture Notes in Logic, Association for Symbolic Logic, XVI + 176 p., Cambridge University Press (2010)"},{"key":"9_CR39","first-page":"501","volume":"104","author":"YT Medvedev","year":"1955","unstructured":"Medvedev, Y.T.: Degrees of difficulty of mass problems. Dokl. Akad. Nauk SSSR 104, 501\u2013504 (1955). in Russian","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"9_CR40","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.aim.2010.06.024","volume":"226","author":"JS Miller","year":"2011","unstructured":"Miller, J.S.: Extracting information is hard: a turing degree of non-integral effective Hausdorff dimension. Adv. Math. 226, 373\u2013384 (2011)","journal-title":"Adv. Math."},{"key":"9_CR41","first-page":"1328","volume":"4","author":"AA Muchnik","year":"1963","unstructured":"Muchnik, A.A.: On strong and weak reducibilities of algorithmic problems. Sib. Mat. Zh. 4, 1328\u20131341 (1963). in Russian","journal-title":"Sib. Mat. Zh."},{"key":"9_CR42","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BF01928216","volume":"5","author":"A Nabutovsky","year":"1995","unstructured":"Nabutovsky, A.: Einstein structures: existence versus uniqueness. Geom. Funct. Anal. 5, 76\u201391 (1995)","journal-title":"Geom. Funct. Anal."},{"key":"9_CR43","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.top.2007.02.002","volume":"46","author":"A Nabutovsky","year":"2007","unstructured":"Nabutovsky, A., Weinberger, S.: Betti numbers of finitely presented groups and very rapidly growing functions. Topology 46, 211\u2013233 (2007)","journal-title":"Topology"},{"key":"9_CR44","doi-asserted-by":"crossref","unstructured":"Nies, A.: Computability and Randomness, XV + 433 p., Oxford University Press (2009)","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001"},{"key":"9_CR45","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. Lon. Math. Soc. 77, 241\u2013291 (1998)","journal-title":"Proc. Lon. Math. Soc."},{"key":"9_CR46","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1090\/S0002-9904-1944-08111-1","volume":"50","author":"EL 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."},{"key":"9_CR47","doi-asserted-by":"publisher","first-page":"172","DOI":"10.2307\/1969933","volume":"67","author":"MO Rabin","year":"1958","unstructured":"Rabin, M.O.: Recursive unsolvability of group theoretic problems. Ann. Math. 67, 172\u2013194 (1958)","journal-title":"Ann. Math."},{"key":"9_CR48","doi-asserted-by":"publisher","first-page":"514","DOI":"10.2307\/2271358","volume":"33","author":"D Richardson","year":"1968","unstructured":"Richardson, D.: Some undecidable problems involving elementary functions of a real variable. J. Symbolic Logic 33, 514\u2013520 (1968)","journal-title":"J. Symbolic Logic"},{"key":"9_CR49","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01418780","volume":"12","author":"RM Robinson","year":"1971","unstructured":"Robinson, R.M.: Undecidability and nonperiodicity of tilings of the plane. Inventiones Math. 12, 177\u2013209 (1971)","journal-title":"Inventiones Math."},{"key":"9_CR50","unstructured":"Rogers Jr. H.: Theory of Recursive Functions and Effective Computability, XIX + 482 p.. MIT Press, Cambridge (1967)"},{"key":"9_CR51","unstructured":"Sacks, G.E.: Degrees of Unsolvability. No. 55 in Annals of Mathematics Studies, IX + 174 p., Princeton University Press, London (1963)"},{"key":"9_CR52","doi-asserted-by":"publisher","first-page":"300","DOI":"10.2307\/1970393","volume":"80","author":"GE Sacks","year":"1964","unstructured":"Sacks, G.E.: The recursively enumerable degrees are dense. Ann. Math. 80, 300\u2013312 (1964)","journal-title":"Ann. Math."},{"key":"9_CR53","doi-asserted-by":"crossref","unstructured":"Sacks, G.E.: Higher Recursion Theory. Perspectives in Mathematical Logic, XV + 344 p., Springer (1990)","DOI":"10.1007\/978-3-662-12013-2"},{"key":"9_CR54","doi-asserted-by":"crossref","unstructured":"Scott, D.S.: Algebras of sets binumerable in complete extensions of arithmetic. In: [15], pp. 117\u2013121 (1962)","DOI":"10.1090\/pspum\/005\/0141595"},{"key":"9_CR55","first-page":"242","volume":"7","author":"DS Scott","year":"1960","unstructured":"Scott, D.S., Tennenbaum, S.: On the degrees of complete extensions of arithmetic (abstract). Not. Am. Math. Soc. 7, 242\u2013243 (1960)","journal-title":"Not. Am. Math. Soc."},{"issue":"1","key":"9_CR56","doi-asserted-by":"publisher","first-page":"267","DOI":"10.2178\/jsl\/1294171000","volume":"76","author":"P Shafer","year":"2011","unstructured":"Shafer, P.: Coding true arithmetic in the Medvedev and Muchnik degrees. J. Symbolic Logic 76(1), 267\u2013288 (2011)","journal-title":"J. Symbolic Logic"},{"key":"9_CR57","doi-asserted-by":"publisher","first-page":"233","DOI":"10.2307\/2964680","volume":"25","author":"JR Shoenfield","year":"1960","unstructured":"Shoenfield, J.R.: Degrees of models. J. Symbolic Logic 25, 233\u2013237 (1960)","journal-title":"J. Symbolic Logic"},{"key":"9_CR58","unstructured":"Shoenfield, J.R.: Degrees of Unsolvability. No. 2 in North-Holland Mathematics Studies, VIII + 111 p., North-Holland (1971)"},{"key":"9_CR59","unstructured":"Shore, R.A.: The Turing degrees: an introduction, IV + 77 p. (2012). http:\/\/www.math.cornell.edu\/~shore\/"},{"key":"9_CR60","doi-asserted-by":"crossref","unstructured":"Simpson, S.G.: The hierarchy based on the jump operator. In: [4], pp. 267\u2013276 (1980)","DOI":"10.1016\/S0049-237X(08)71263-1"},{"key":"9_CR61","unstructured":"Simpson, S.G.: FOM: natural r.e. degrees; Pi01 classes. FOM e-mail list [19], 13 August 1999"},{"key":"9_CR62","doi-asserted-by":"crossref","unstructured":"Simpson, S.G.: Subsystems of Second Order Arithmetic. Perspectives in Mathematical Logic, pp. XIV + 445, Second Edition, Springer (1999), Perspectives in Logic, Association for Symbolic Logic, XVI+ 444 p., Cambridge University Press (2009)","DOI":"10.1007\/978-3-642-59971-2"},{"key":"9_CR63","unstructured":"Simpson, S.G.: FOM: natural r.e. degrees. FOM e-mail list [19], 27 February 2005"},{"key":"9_CR64","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2178\/bsl\/1107959497","volume":"11","author":"SG Simpson","year":"2005","unstructured":"Simpson, S.G.: Mass problems and randomness. Bull. Symbolic Logic 11, 1\u201327 (2005)","journal-title":"Bull. Symbolic Logic"},{"issue":"2","key":"9_CR65","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1112\/jlms\/jdl015","volume":"75","author":"SG Simpson","year":"2007","unstructured":"Simpson, S.G.: An extension of the recursively enumerable turing degrees. J. Lond. Math. Soc. 75(2), 287\u2013297 (2007)","journal-title":"J. Lond. Math. Soc."},{"key":"9_CR66","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1002\/malq.200710013","volume":"53","author":"SG Simpson","year":"2007","unstructured":"Simpson, S.G.: Mass problems and almost everywhere domination. Math. Logic Quarterly 53, 483\u2013492 (2007)","journal-title":"Math. Logic Quarterly"},{"key":"9_CR67","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1215\/00294527-2008-002","volume":"49","author":"SG Simpson","year":"2008","unstructured":"Simpson, S.G.: Mass problems and intuitionism. Notre Dame J. Formal Logic 49, 127\u2013136 (2008)","journal-title":"Notre Dame J. Formal Logic"},{"key":"9_CR68","doi-asserted-by":"publisher","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. Symbolic Logic 15, 385\u2013409 (2009)","journal-title":"Bull. Symbolic Logic"},{"issue":"4","key":"9_CR69","doi-asserted-by":"publisher","first-page":"489","DOI":"10.2748\/tmj\/1325886278","volume":"63","author":"SG Simpson","year":"2011","unstructured":"Simpson, S.G.: Mass problems associated with effectively closed sets. Tohoku Math. J. 63(4), 489\u2013517 (2011)","journal-title":"Tohoku Math. J."},{"issue":"2","key":"9_CR70","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1017\/etds.2012.152","volume":"34","author":"SG Simpson","year":"2014","unstructured":"Simpson, S.G.: Medvedev degrees of 2-dimensional subshifts of finite type. Ergodic Theor. Dyn. Syst. 34(2), 665\u2013674 (2014). doi:10.1017\/etds.2012.152","journal-title":"Ergodic Theor. Dyn. Syst."},{"key":"9_CR71","doi-asserted-by":"crossref","unstructured":"Slaman, T.A.: Global properties of the turing degrees and the turing jump. In: [11], pp. 83\u2013101 (2008)","DOI":"10.1142\/9789812794055_0002"},{"key":"9_CR72","doi-asserted-by":"crossref","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic, XVIII + 437 p., Springer (1987)","DOI":"10.1007\/978-3-662-02460-7"},{"key":"9_CR73","doi-asserted-by":"publisher","first-page":"284","DOI":"10.2307\/420992","volume":"2","author":"RI Soare","year":"1996","unstructured":"Soare, R.I.: Computability and recursion. Bull. Symbolic Logic 2, 284\u2013321 (1996)","journal-title":"Bull. Symbolic Logic"},{"key":"9_CR74","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00012-012-0176-1","volume":"67","author":"A Sorbi","year":"2012","unstructured":"Sorbi, A., Terwijn, S.A.: Intuitionistic logic and Muchnik degrees. Algebra Univers. 67, 175\u2013188 (2012). doi:10.1007\/s00012-012-0176-1","journal-title":"Algebra Univers."},{"key":"9_CR75","unstructured":"Tarski, A., Mostowski, A., Robinson, R.M.: Undecidable Theories. Studies in Logic and the Foundations of Mathematics, IX + 98 p., North-Holland (1953)"},{"key":"9_CR76","unstructured":"Tikhomirov, V.M. (ed.): Selected Works of A.N. Kolmogorov, vol. I, Mathematics and Mechanics. Mathematics and its Applications, Soviet Series, XIX + 551 p., Kluwer Academic Publishers (1991)"},{"key":"9_CR77","first-page":"230","volume":"42","author":"AM Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 42, 230\u2013265 (1936)","journal-title":"Proc. Lond. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Evolving Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20028-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:35:25Z","timestamp":1676943325000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20028-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200279","9783319200286"],"references-count":77,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20028-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}