{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:18Z","timestamp":1740099018683,"version":"3.37.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319743127"},{"type":"electronic","value":"9783319743134"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-74313-4_18","type":"book-chapter","created":{"date-parts":[[2018,1,17]],"date-time":"2018-01-17T00:17:43Z","timestamp":1516148263000},"page":"241-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Highlights of the Rice-Shapiro Theorem in\u00a0Computable Topology"],"prefix":"10.1007","author":[{"given":"Margarita","family":"Korovina","sequence":"first","affiliation":[]},{"given":"Oleg","family":"Kudinov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,18]]},"reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"crossref","first-page":"401","DOI":"10.2307\/421098","volume":"3","author":"A Edalat","year":"1997","unstructured":"Edalat, A.: Domains for computation in mathematics, physics and exact real arithmetic. Bull. Symbolic Logic 3(4), 401\u2013452 (1997)","journal-title":"Bull. Symbolic Logic"},{"issue":"2","key":"18_CR2","doi-asserted-by":"crossref","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":"18_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). https:\/\/doi.org\/10.1007\/3-540-44683-4_20"},{"issue":"7\u20138","key":"18_CR4","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s00153-008-0065-7","volume":"46","author":"P Brodhead","year":"2008","unstructured":"Brodhead, P., Cenzer, D.A.: Effectively closed sets and enumerations. Arch. Math. Log. 46(7\u20138), 565\u2013582 (2008)","journal-title":"Arch. Math. Log."},{"issue":"4","key":"18_CR5","doi-asserted-by":"crossref","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":"18_CR6","doi-asserted-by":"crossref","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. Algebra Logic 45(5), 306\u2013325 (2006)","journal-title":"J. Algebra Logic"},{"issue":"98","key":"18_CR7","first-page":"11","volume":"2","author":"GS Ceitin","year":"1971","unstructured":"Ceitin, G.S.: Mean value theorems in constructive analysis. Transl. Am. Math. Soc. Transl. Ser. 2(98), 11\u201340 (1971)","journal-title":"Transl. Am. Math. Soc. Transl. Ser."},{"issue":"1\u20133","key":"18_CR8","doi-asserted-by":"crossref","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 $$\\Pi ^0_1$$ \u03a0 1 0 classes. Ann. Pure Appl. Logic 93(1\u20133), 3\u201361 (1998)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1\u20132","key":"18_CR9","doi-asserted-by":"crossref","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\u20132), 111\u2013150 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Ershov, Y.L.: Model $$\\mathbb{C}$$ C of partial continuous functionals. In: Logic Colloquium 76, pp. 455\u2013467. North-Holland, Amsterdam (1977)","DOI":"10.1016\/S0049-237X(09)70439-2"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Ershov,\u00a0Y.L.: Theory of numberings. In: Griffor, E.R. (ed.) Handbook of Computability Theory, pp. 473\u2013503. Elsevier Science B.V., Amsterdam (1999)","DOI":"10.1016\/S0049-237X(99)80030-5"},{"key":"18_CR12","unstructured":"Friedberg, R.M.: 4-quantifier completeness: a Banach-Mazur functional not uniformly partial recursive. Bulletin de l\u2019Academie Polonaise des sciences, Serie des sci. math., astr. et phys. 6(1), 1\u20135 (1958)"},{"issue":"2\u20133","key":"18_CR13","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.apal.2004.08.001","volume":"132","author":"P Hertling","year":"2005","unstructured":"Hertling, P.: A Banach-Mazur computable but not Markov computable function on the computable real numbers. Ann. Pure Appl. Logic 132(2\u20133), 227\u2013246 (2005)","journal-title":"Ann. Pure Appl. Logic"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Gierz, G., Heinrich Hofmann, K., Keime, K., Lawson, J.D., Mislove, M.W.: Continuous lattices and domain. In: Encyclopedia of Mathematics and its Applications, vol. 93. Cambridge University Press, Cambridge (2003)","DOI":"10.1017\/CBO9780511542725"},{"key":"18_CR15","doi-asserted-by":"crossref","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. Electr. Notes Theor. Comput. Sci. 167, 345\u2013364 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"6","key":"18_CR16","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":"18_CR17","unstructured":"Gregoriades, V., Kispeter, T., Pauly, A.: A comparison of concepts from computable analysis and effective descriptive set theory. Math. Struct. Comput. Sci. (2014). http:\/\/arxiv.org\/abs\/1403.7997"},{"key":"18_CR18","unstructured":"Korovina, M., Kudinov, O.: Rice-Shapiro Theorem in Computable Topology (2017). http:\/\/arxiv.org\/abs\/1708.09820"},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"Korovina, M., Kudinov, O.: Computable elements and functions in effectively enumerable topological spaces. J. Math. Struct. Comput. Sci. (2016). https:\/\/doi.org\/10.1017\/S0960129516000141","DOI":"10.1017\/S0960129516000141"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-662-46823-4_17","volume-title":"Perspectives of System Informatics","author":"M Korovina","year":"2015","unstructured":"Korovina, M., Kudinov, O.: Index sets as a measure of continuous constraint complexity. In: Voronkov, A., Virbitskaite, I. (eds.) PSI 2014. LNCS, vol. 8974, pp. 201\u2013215. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46823-4_17"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-319-20028-6_23","volume-title":"Evolving Computability","author":"M Korovina","year":"2015","unstructured":"Korovina, M., Kudinov, O.: Rice\u2019s theorem in effectively enumerable topological spaces. In: Beckmann, A., Mitrana, V., Soskova, M. (eds.) CiE 2015. LNCS, vol. 9136, pp. 226\u2013235. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20028-6_23"},{"issue":"8","key":"18_CR22","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.1017\/S0960129513000315","volume":"25","author":"M Korovina","year":"2015","unstructured":"Korovina, M., Kudinov, O.: Positive predicate structures for continuous data. J. Math. Struct. Comput. Sci. 25(8), 1669\u20131684 (2015)","journal-title":"J. Math. Struct. Comput. Sci."},{"key":"18_CR23","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.entcs.2008.12.011","volume":"221","author":"M Korovina","year":"2008","unstructured":"Korovina, M., Kudinov, O.: Towards computability over effectively enumerable topological spaces. Electr. Notes Theor. Comput. Sci. 221, 115\u2013125 (2008)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"18_CR24","volume-title":"Notes on Constructive Mathematics","author":"P Martin-L\u00f6f","year":"1970","unstructured":"Martin-L\u00f6f, P.: Notes on Constructive Mathematics. Almqvist & Wiksell, Stockholm (1970)"},{"key":"18_CR25","unstructured":"Mazur, S.: Computable Analysis, vol. 33. Razprawy Matematyczne, Warsaw (1963)"},{"key":"18_CR26","doi-asserted-by":"crossref","first-page":"215","DOI":"10.4064\/fm-55-3-215-238","volume":"55","author":"YN Moschovakis","year":"1964","unstructured":"Moschovakis, Y.N.: Recursive metric spaces. Fund. Math. 55, 215\u2013238 (1964)","journal-title":"Fund. Math."},{"key":"18_CR27","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":"18_CR28","doi-asserted-by":"crossref","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":"18_CR29","volume-title":"Degrees of Unsolvability","author":"JR Shoenfield","year":"1971","unstructured":"Shoenfield, J.R.: Degrees of Unsolvability. North-Holland Publishing Company, Amsterdam (1971)"},{"issue":"1","key":"18_CR30","doi-asserted-by":"crossref","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":"3","key":"18_CR31","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0168-0072(95)00067-4","volume":"80","author":"D Spreen","year":"1996","unstructured":"Spreen, D.: Effective inseparability in a topological setting. Ann. Pure Appl. Logic 80(3), 257\u2013275 (1996)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"18_CR32","doi-asserted-by":"crossref","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":"18_CR33","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., Hasenjaeger, G., R\u00f6dding, D. (eds.) LaM 1983. LNCS, vol. 171, pp. 103\u2013117. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/3-540-13331-3_36"},{"issue":"5","key":"18_CR34","first-page":"512","volume":"13","author":"VV Vjugin","year":"1973","unstructured":"Vjugin, V.V.: On some examples of upper semilattices of computable numberings. Algebra Logic 13(5), 512\u2013529 (1973)","journal-title":"Algebra Logic"},{"key":"18_CR35","doi-asserted-by":"crossref","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":"18_CR36","unstructured":"Weihrauch, K., Deil, T.: Berechenbarkeit auf cpo-s. Schriften zur Angew. Math. u. Informatik 63. RWTH Aachen (1980)"},{"issue":"1","key":"18_CR37","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0304-3975(93)90001-A","volume":"113","author":"K Weihrauch","year":"1993","unstructured":"Weihrauch, K.: Computability on computable metric spaces. Theor. Comput. Sci. 113(1), 191\u2013210 (1993)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74313-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T08:30:51Z","timestamp":1570609851000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-74313-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319743127","9783319743134"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74313-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}