{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:26:11Z","timestamp":1725823571886},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200279"},{"type":"electronic","value":"9783319200286"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"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_23","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:37Z","timestamp":1434708457000},"page":"226-235","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Rice\u2019s Theorem in Effectively Enumerable Topological Spaces"],"prefix":"10.1007","author":[{"given":"Margarita","family":"Korovina","sequence":"first","affiliation":[]},{"given":"Oleg","family":"Kudinov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"4","key":"23_CR1","first-page":"13","volume":"29","author":"MM Arslanov","year":"1985","unstructured":"Arslanov, M.M.: Families of recursively enumerable sets and their degrees of unsolvability. Sov. Math. 29(4), 13\u201321 (1985)","journal-title":"Sov. Math."},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0168-0072(93)90038-F","volume":"60","author":"U Berger","year":"1993","unstructured":"Berger, U.: Total sets and objects in domain theory. Ann. Pure Appl. Logic. 60(2), 91\u2013117 (1993)","journal-title":"Ann. Pure Appl. Logic."},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-44683-4_20","volume-title":"Mathematical Foundations of Computer Science 2001","author":"V Brattka","year":"2001","unstructured":"Brattka, V.: Computable versions of baire\u2019s category theorem. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 224\u2013235. Springer, Heidelberg (2001)"},{"issue":"4","key":"23_CR4","doi-asserted-by":"publisher","first-page":"1418","DOI":"10.2178\/jsl\/1203350796","volume":"72","author":"W Calvert","year":"2007","unstructured":"Calvert, W., Fokina, E., Goncharov, S.S., Knight, J.F., Kudinov, O.V., Morozov, A.S., Puzarenko, V.: Index sets for classes of high rank structures. J. Symb. Log. 72(4), 1418\u20131432 (2007)","journal-title":"J. Symb. Log."},{"issue":"5","key":"23_CR5","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/s10469-006-0029-0","volume":"45","author":"W Calvert","year":"2006","unstructured":"Calvert, W., Harizanov, V.S., Knight, J.F., Miller, S.: Index sets of computable structures. J. Algebr. Log. 45(5), 306\u2013325 (2006)","journal-title":"J. Algebr. Log."},{"issue":"98","key":"23_CR6","first-page":"11","volume":"2","author":"GS Ceitin","year":"1971","unstructured":"Ceitin, G.S.: Mean value theorems in constructive analysis. Trans. Am. Math. Soc. Trans. Ser. 2(98), 11\u201340 (1971)","journal-title":"Trans. Am. Math. Soc. Trans. Ser."},{"issue":"1\u20133","key":"23_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0168-0072(97)00052-3","volume":"93","author":"DA Cenzer","year":"1998","unstructured":"Cenzer, D.A., Remmel, J.B.: Index sets for \n                      \n                        \n                      \n                      $$\\Pi ^0_1$$\n                      \n                        \n                          \n                            \u03a0\n                            1\n                            0\n                          \n                        \n                      \n                     classes. Ann. Pure Appl. Log. 93(1\u20133), 3\u201361 (1998)","journal-title":"Ann. Pure Appl. Log."},{"issue":"1\u2014-2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0304-3975(98)00286-2","volume":"219","author":"DA Cenzer","year":"1999","unstructured":"Cenzer, D.A., Remmel, J.B.: Index sets in computable analysis. Theor. Comput. Sci. 219(1\u2014-2), 111\u2013150 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR9","first-page":"455","volume-title":"Logic colloquium 76","author":"YL Ershov","year":"1977","unstructured":"Ershov, Y.L.: Model \n                      \n                        \n                      \n                      $$\\mathbb{C}$$\n                      \n                        \n                          C\n                        \n                      \n                     of partial continuous functionals. In: Gandy, R.O., Hyland, J.M.E. (eds.) Logic colloquium 76, pp. 455\u2013467. North-Holland, Amsterdam (1977)"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0049-237X(99)80030-5","volume-title":"Handbook of Computability Theory","author":"YL Ershov","year":"1999","unstructured":"Ershov, Y.L.: Theory of numberings. In: Griffor, E.R. (ed.) Handbook of Computability Theory, pp. 473\u2013503. Elsevier Science B.V, Amsterdam (1999)"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.entcs.2006.08.020","volume":"167","author":"T Grubba","year":"2007","unstructured":"Grubba, T., Weihrauch, K.: On computable metrization. Electron. Notes Theor. Comput. Sci. 167, 345\u2013364 (2007)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"6","key":"23_CR12","first-page":"1381","volume":"15","author":"T Grubba","year":"2009","unstructured":"Grubba, T., Weihrauch, K.: Elementary computable topology. J. UCS. 15(6), 1381\u20131422 (2009)","journal-title":"J. UCS."},{"key":"23_CR13","series-title":"Encyclopedia of Mathemtics and its Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542725","volume-title":"Continuous Lattices and Domain","author":"G Gierz","year":"2003","unstructured":"Gierz, G., Heinrich Hofmann, K., Keime, K., Lawson, J.D., Mislove, M.W.: Continuous Lattices and Domain. Encyclopedia of Mathemtics and its Applications, vol. 93. Cambridge University Press, Cambridge (2003)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Korovina, M.V., Kudinov, O.V.: Positive predicate structures for continuous data. J. Math. Struct. Comput. Sci. (2015, To appear)","DOI":"10.1017\/S0960129513000315"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.entcs.2008.12.011","volume":"221","author":"MV Korovina","year":"2008","unstructured":"Korovina, M.V., Kudinov, O.V.: Towards computability over effectively enumerable topological spaces. Electron. Notes Theor. Comput. Sci. 221, 115\u2013125 (2008)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11494645_30","volume-title":"New Computational Paradigms","author":"MV Korovina","year":"2005","unstructured":"Korovina, M.V., Kudinov, O.V.: Towards computability of higher type continuous data. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 235\u2013241. Springer, Heidelberg (2005)"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1090\/S0002-9947-1987-0902785-2","volume":"303","author":"S Lempp","year":"1987","unstructured":"Lempp, S.: Hyperarithmetical index sets in recursion theory. Trans. Am. Math. Sot. 303, 559\u2013583 (1987)","journal-title":"Trans. Am. Math. Sot."},{"key":"23_CR18","volume-title":"Notes on Constructive Mathematics","author":"P Martin-L\u00f6f","year":"1970","unstructured":"Martin-L\u00f6f, P.: Notes on Constructive Mathematics. Stockholm, Sweden (1970)"},{"key":"23_CR19","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H Rogers","year":"1967","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)"},{"key":"23_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets","author":"RI Soare","year":"1987","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets. Springer, Heidelberg (1987)"},{"key":"23_CR21","volume-title":"Degrees of unsolvability","author":"JR Shoenfield","year":"1971","unstructured":"Shoenfield, J.R.: Degrees of unsolvability. North-Holland Publishing, Amsterdam (1971)"},{"issue":"1","key":"23_CR22","doi-asserted-by":"publisher","first-page":"185","DOI":"10.2307\/2586596","volume":"63","author":"D Spreen","year":"1998","unstructured":"Spreen, D.: On effective topological spaces. J. Symb. Log. 63(1), 185\u2013221 (1998)","journal-title":"J. Symb. Log."},{"issue":"1","key":"23_CR23","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1006\/inco.1995.1143","volume":"122","author":"D Spreen","year":"1995","unstructured":"Spreen, D.: On some decision problems in programming. Inf. Comput. 122(1), 120\u2013139 (1995)","journal-title":"Inf. Comput."},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-13331-3_36","volume-title":"Logic and Machines: Decision Problems and Complexity","author":"D Spreen","year":"1984","unstructured":"Spreen, D.: On r.e. inseparability of CPO index sets. In: B\u00f6rger, E., R\u00f6dding, D., Hasenjaeger, G. (eds.) Rekursive Kombinatorik 1983. LNCS, vol. 171, pp. 103\u2013117. Springer, Heidelberg (1984)"},{"key":"23_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Springer, Heidelberg (2000)"},{"key":"23_CR26","series-title":"Schriften zur Angew. Math. u. Informatik 63","volume-title":"Berechenbarkeit auf cpo-s","author":"K Weihrauch","year":"1980","unstructured":"Weihrauch, K., Deil, T.: Berechenbarkeit auf cpo-s. Schriften zur Angew. Math. u. Informatik 63. RWTH Aachen, Aachen (1980)"}],"container-title":["Lecture Notes in Computer Science","Evolving Computability"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20028-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T07:11:02Z","timestamp":1559200262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-20028-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200279","9783319200286"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20028-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}