{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T15:47:19Z","timestamp":1725983239390},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319944173"},{"type":"electronic","value":"9783319944180"}],"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-94418-0_24","type":"book-chapter","created":{"date-parts":[[2018,7,4]],"date-time":"2018-07-04T16:38:26Z","timestamp":1530722306000},"page":"234-243","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Weak Reduction Principle and Computable Metric Spaces"],"prefix":"10.1007","author":[{"given":"Margarita","family":"Korovina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oleg","family":"Kudinov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,3]]},"reference":[{"key":"24_CR1","volume-title":"Definability and Computability","author":"YL Ershov","year":"1996","unstructured":"Ershov, Y.L.: Definability and Computability. Springer, New York (1996)"},{"key":"24_CR2","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)"},{"issue":"4","key":"24_CR3","doi-asserted-by":"publisher","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. Symb. Logic 3(4), 401\u2013452 (1997)","journal-title":"Bull. Symb. Logic"},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","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."},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-319-58741-7_27","volume-title":"Unveiling Dynamics and Complexity","author":"M Korovina","year":"2017","unstructured":"Korovina, M., Kudinov, O.: On higher effective descriptive set theory. In: Kari, J., Manea, F., Petre, I. (eds.) CiE 2017. LNCS, vol. 10307, pp. 282\u2013291. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-58741-7_27"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-319-58741-7_7","volume-title":"Unveiling Dynamics and Complexity","author":"M Korovina","year":"2017","unstructured":"Korovina, M., Kudinov, O.: Outline of partial computability in computable topology. In: Kari, J., Manea, F., Petre, I. (eds.) CiE 2017. LNCS, vol. 10307, pp. 64\u201376. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-58741-7_7"},{"issue":"3","key":"24_CR7","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1017\/S0960129516000438","volume":"28","author":"M Korovina","year":"2016","unstructured":"Korovina, M., Kudinov, O.: Complexity for partial computable functions over computable Polish spaces. Math. Struct. Comput. Sci. 28(3), 429\u2013447 (2016)","journal-title":"Math. Struct. Comput. Sci."},{"key":"24_CR8","doi-asserted-by":"publisher","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":"24_CR9","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). \nhttps:\/\/doi.org\/10.1007\/11494645_30"},{"key":"24_CR10","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":"MV Korovina","year":"1999","unstructured":"Korovina, M.V., Kudinov, O.V.: 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). \nhttps:\/\/doi.org\/10.1007\/10703163_14"},{"key":"24_CR11","doi-asserted-by":"publisher","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":"24_CR12","doi-asserted-by":"publisher","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":"24_CR13","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":"24_CR14","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":"24_CR15","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-56999-9"},{"issue":"1","key":"24_CR16","doi-asserted-by":"publisher","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","Sailing Routes in the World of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94418-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,4]],"date-time":"2018-07-04T16:50:54Z","timestamp":1530723054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94418-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319944173","9783319944180"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94418-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}