{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:24:08Z","timestamp":1743074648348,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319587400"},{"type":"electronic","value":"9783319587417"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58741-7_7","type":"book-chapter","created":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T12:59:28Z","timestamp":1494507568000},"page":"64-76","source":"Crossref","is-referenced-by-count":2,"title":["Outline of Partial Computability in Computable 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":[[2017,5,12]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","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)"},{"issue":"4","key":"7_CR2","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 Log. 3(4), 401\u2013452 (1997)","journal-title":"Bull. Symbolic Log."},{"key":"7_CR3","volume-title":"Invariant Descriptive Set Theory","author":"S Gao","year":"2009","unstructured":"Gao, S.: Invariant Descriptive Set Theory. CRC Press, New York (2009)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Gregoriades, V., Kispeter, T., Pauly, A.: A comparison of concepts from computable analysis and effective descriptive set theory. Math. Struct. Comput. Sci. 1\u201323(2016). https:\/\/doi.org\/10.1017\/S0960129516000128 . (Published online: 23 June 2016)","DOI":"10.1017\/S0960129516000128"},{"issue":"2","key":"7_CR5","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/S0304-3975(01)00093-7","volume":"284","author":"A Hemmerling","year":"2002","unstructured":"Hemmerling, A.: Effective metric spaces and representations of the reals. Theor. Comput. Sci. 284(2), 347\u2013372 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"7_CR6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0304-3975(98)00289-8","volume":"219","author":"A Hemmerling","year":"1999","unstructured":"Hemmerling, A.: On approximate and algebraic computability over the real numbers. Theor. Comput. Sci. 219(1\u20132), 185\u2013223 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4190-4","volume-title":"Classical Descriptive Set Theory","author":"AS Kechris","year":"1995","unstructured":"Kechris, A.S.: Classical Descriptive Set Theory. Springer, New York (1995)"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Korovina, M., Kudinov, O.: Complexity for partial computable functions over computable Polish spaces. Math. Struct. Comput. Sci. (2016). doi: 10.1017\/S0960129516000438 . (Published online: 19 December 2016)","DOI":"10.1017\/S0960129516000438"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Korovina, M., Kudinov, O.: Computable elements and functions in effectively enumerable topological spaces. Mathematical structure in Computer Science (2016). doi: 10.1017\/S0960129516000141 . (Published online: 23 June 2016)","DOI":"10.1017\/S0960129516000141"},{"key":"7_CR10","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). doi: 10.1007\/978-3-662-46823-4_17"},{"key":"7_CR11","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":"7_CR12","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":"M Korovina","year":"2005","unstructured":"Korovina, M., Kudinov, O.: 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). doi: 10.1007\/11494645_30"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/10703163_14","volume-title":"Computer Science Logic","author":"M Korovina","year":"1999","unstructured":"Korovina, M., Kudinov, O.: Characteristic properties of majorant-computability over the reals. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol. 1584, pp. 188\u2013203. Springer, Heidelberg (1999). doi: 10.1007\/10703163_14"},{"key":"7_CR14","doi-asserted-by":"crossref","DOI":"10.1090\/surv\/155","volume-title":"Descriptive set theory","author":"YN Moschovakis","year":"2009","unstructured":"Moschovakis, Y.N.: Descriptive set theory. North-Holland, Amsterdam (2009)"},{"key":"7_CR15","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":"7_CR16","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":"7_CR17","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 Science and Business Media, Heidelberg (1987)"},{"issue":"1","key":"7_CR18","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."},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-319-20028-6_33","volume-title":"Evolving Computability","author":"V Selivanov","year":"2015","unstructured":"Selivanov, V.: Towards the effective descriptive set theory. In: Beckmann, A., Mitrana, V., Soskova, M. (eds.) CiE 2015. LNCS, vol. 9136, pp. 324\u2013333. Springer, Cham (2015). doi: 10.1007\/978-3-319-20028-6_33"},{"key":"7_CR20","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, New York (2000)"},{"issue":"1","key":"7_CR21","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","Unveiling Dynamics and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58741-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T08:46:18Z","timestamp":1569314778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-58741-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319587400","9783319587417"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58741-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}