{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T04:07:18Z","timestamp":1750392438832,"version":"3.41.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031959073","type":"print"},{"value":"9783031959080","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-95908-0_2","type":"book-chapter","created":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T08:54:05Z","timestamp":1750323245000},"page":"19-33","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Effective Second Countability in\u00a0Computable Analysis"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4664-2183","authenticated-orcid":false,"given":"Vasco","family":"Brattka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-0395-3311","authenticated-orcid":false,"given":"Emmanuel","family":"Rauzy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,20]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Amir, D.E., Hoyrup, M.: Strong computable type. Computability 12(3), 227\u2013269 (2023). https:\/\/doi.org\/10.3233\/com-220430","DOI":"10.3233\/com-220430"},{"key":"2_CR2","unstructured":"Bauer, A.: The realizability approach to computable analysis and topology. Ph.D. thesis, School of Computer Science, Carnegie Mellon University (2000)"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Bauer, A.: Spreen spaces and the synthetic Kreisel-Lacombe-Shoenfield-Tseitin theorem. J. Logic Anal. 17 (2025). https:\/\/doi.org\/10.4115\/jla.2025.17.fds3","DOI":"10.4115\/jla.2025.17.fds3"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.apal.2011.06.017","volume":"163","author":"A Bauer","year":"2012","unstructured":"Bauer, A., Le\u0161nik, D.: Metric spaces in synthetic topology. Ann. Pure Appl. Logic 163(2), 87\u2013100 (2012). https:\/\/doi.org\/10.1016\/j.apal.2011.06.017","journal-title":"Ann. Pure Appl. Logic"},{"key":"2_CR5","unstructured":"Brattka, V., Rauzy, E.: Effective bases and notions of effective second countability in computable analysis (In preparation)"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"de Brecht, M., Pauly, A., Schr\u00f6der, M.: Overt choice. Computability 9(3\u20134), 169\u2013191 (2020). https:\/\/doi.org\/10.3233\/com-190253","DOI":"10.3233\/com-190253"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.entcs.2004.09.017","volume":"87","author":"M Escard\u00f3","year":"2004","unstructured":"Escard\u00f3, M.: Synthetic topology. Electron. Notes Theor. Comput. Sci. 87, 21\u2013156 (2004). https:\/\/doi.org\/10.1016\/j.entcs.2004.09.017","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"8","key":"2_CR8","doi-asserted-by":"publisher","first-page":"1414","DOI":"10.1017\/s0960129516000128","volume":"27","author":"V Gregoriades","year":"2016","unstructured":"Gregoriades, V., Kisp\u00e9ter, T., Pauly, A.: A comparison of concepts from computable analysis and effective descriptive set theory. Math. Struct. Comput. Sci. 27(8), 1414\u20131436 (2016). https:\/\/doi.org\/10.1017\/s0960129516000128","journal-title":"Math. Struct. Comput. Sci."},{"issue":"4","key":"2_CR9","doi-asserted-by":"publisher","first-page":"351","DOI":"10.3233\/COM-230458","volume":"12","author":"M Hoyrup","year":"2023","unstructured":"Hoyrup, M.: Notes on overt choice. Computability 12(4), 351\u2013369 (2023)","journal-title":"Computability"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(85)90208-7","volume":"38","author":"C Kreitz","year":"1985","unstructured":"Kreitz, C., Weihrauch, K.: Theory of representations. Theoret. Comput. Sci. 38, 35\u201353 (1985). https:\/\/doi.org\/10.1016\/0304-3975(85)90208-7","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"2_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.2307\/2270370","volume":"29","author":"AH Lachlan","year":"1964","unstructured":"Lachlan, A.H.: Effective operations in a general setting. J. Symb. Log. 29(4), 163\u2013178 (1964). https:\/\/doi.org\/10.2307\/2270370","journal-title":"J. Symb. Log."},{"key":"2_CR12","first-page":"1040","volume":"245","author":"D Lacombe","year":"1957","unstructured":"Lacombe, D.: Les ensembles r\u00e9cursivement ouverts ou ferm\u00e9s, et leurs applications \u00e0 l\u2019analyse r\u00e9cursive. Comptes rendus hebdomadaires des s\u00e9ances de l\u2019Acad\u00e9mie des Sciences (Paris) 245, 1040\u20131043 (1957)","journal-title":"Comptes rendus hebdomadaires des s\u00e9ances de l\u2019Acad\u00e9mie des Sciences (Paris)"},{"key":"2_CR13","unstructured":"Lacombe, D.: Quelques proc\u00e9d\u00e9s de d\u00e9finition en topologie r\u00e9cursive. In: Heyting, A. (ed.) Constructivity in mathematics. In: Proceedings of the colloquium held at Amsterdam, pp. 129\u2013158. North-Holland Publishing Company (1957)"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Markov, A.A.: On constructive functions, chap. In: Twelve Papers on Logic and Differential Equations, pp. 163\u2013195. American Mathematical Society Translations (1963). https:\/\/doi.org\/10.1090\/trans2\/029\/05","DOI":"10.1090\/trans2\/029\/05"},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.4064\/fm-55-3-215-238","volume":"55","author":"Y Moschovakis","year":"1964","unstructured":"Moschovakis, Y.: Recursive metric spaces. Fundam. Math. 55(3), 215\u2013238 (1964). https:\/\/doi.org\/10.4064\/fm-55-3-215-238","journal-title":"Fundam. Math."},{"key":"2_CR16","first-page":"28","volume":"169","author":"EY Nogina","year":"1966","unstructured":"Nogina, E.Y.: Effectively topological spaces. Dokl. Akad. Nauk SSSR 169, 28\u201331 (1966)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"4","key":"2_CR17","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/bf01410800","volume":"5","author":"EY Nogina","year":"1969","unstructured":"Nogina, E.Y.: Relations between certain classes of effectively topological spaces. Math. Notes Acad. Sci. USSR 5(4), 288\u2013294 (1969). https:\/\/doi.org\/10.1007\/bf01410800","journal-title":"Math. Notes Acad. Sci. USSR"},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"159","DOI":"10.3233\/com-150049","volume":"5","author":"A Pauly","year":"2016","unstructured":"Pauly, A.: On the topological aspects of the theory of represented spaces. Computability 5(2), 159\u2013180 (2016). https:\/\/doi.org\/10.3233\/com-150049","journal-title":"Computability"},{"key":"2_CR19","unstructured":"Rauzy, E.: Multi-representation associated to the numbering of a subbasis and formal inclusion relation. arXiv:2311.15861 (2023)"},{"key":"2_CR20","unstructured":"Schr\u00f6der, M.: Effective metrization of regular spaces. In: Computability and Complexity in Analysis (1998)"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/3-540-45335-0_16","volume-title":"Computability and Complexity in Analysis","author":"M Schr\u00f6der","year":"2001","unstructured":"Schr\u00f6der, M.: Admissible representations of limit spaces. In: Blanck, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol. 2064, pp. 273\u2013295. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45335-0_16"},{"key":"2_CR22","unstructured":"Schr\u00f6der, M.: Admissible Representations for Continuous Computations. Ph.D. thesis, Fachbereich Informatik, FernUniversit\u00e4t Hagen (2002)"},{"key":"2_CR23","series-title":"Theory and Applications of Computability","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-030-59234-9_9","volume-title":"Handbook of Computability and Complexity in Analysis","author":"M Schr\u00f6der","year":"2021","unstructured":"Schr\u00f6der, M.: Admissibly represented spaces and Qcb-spaces. In: Handbook of Computability and Complexity in Analysis. TAC, pp. 305\u2013346. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-59234-9_9"},{"issue":"1","key":"2_CR24","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. Symbolic Logic 63(1), 185\u2013221 (1998)","journal-title":"J. Symbolic Logic"},{"issue":"1\u20132","key":"2_CR25","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/s0304-3975(00)00319-4","volume":"262","author":"D Spreen","year":"2001","unstructured":"Spreen, D.: Representations versus numberings: on the relationship of two computability notions. Theoret. Comput. Sci. 262(1\u20132), 473\u2013499 (2001). https:\/\/doi.org\/10.1016\/s0304-3975(00)00319-4","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Taylor, P.: Foundations for computable topology. In: Sommaruga, G. (ed.) Foundational Theories of Classical and Constructive Mathematics. No.\u00a076 in Western Ontario Series in Philosophy of Science, Springer-Verlag, January 2011, PaulTaylor.EU\/ASD\/foufct","DOI":"10.1007\/978-94-007-0431-2_14"},{"key":"2_CR27","series-title":"Texts in Theoretical Computer Science. An EATCS Series","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. TTCSAES, Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-642-56999-9"},{"key":"2_CR28","doi-asserted-by":"publisher","unstructured":"Weihrauch, K.: Computably regular topological spaces. Logical Methods Comput. Sci. 9(3), (2013). https:\/\/doi.org\/10.2168\/lmcs-9(3:5)2013","DOI":"10.2168\/lmcs-9(3:5)2013"},{"key":"2_CR29","first-page":"1381","volume":"15","author":"K Weihrauch","year":"2009","unstructured":"Weihrauch, K., Grubba, T.: Elementary computable topology. J. Univers. Comput. Sci. 15, 1381\u20131422 (2009)","journal-title":"J. Univers. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Crossroads of Computability and Logic: Insights, Inspirations, and Innovations"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-95908-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T08:54:08Z","timestamp":1750323248000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95908-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031959073","9783031959080"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95908-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cie2025-computabilityineurope\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}