{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T18:02:24Z","timestamp":1784484144019,"version":"3.55.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032313478","type":"print"},{"value":"9783032313485","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-31348-5_31","type":"book-chapter","created":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:33Z","timestamp":1784482173000},"page":"469-481","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mergeable Represented Spaces"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0173-3295","authenticated-orcid":false,"given":"Arno","family":"Pauly","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,20]]},"reference":[{"issue":"1","key":"31_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L Blum","year":"1989","unstructured":"Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers: $$\\rm NP $$-completeness, recursive functions and universal machines. Bull. Amer. Math. Soc. 21(1), 1\u201346 (1989)","journal-title":"Bull. Amer. Math. Soc."},{"key":"31_CR2","doi-asserted-by":"publisher","unstructured":"Brattka, V., de\u00a0Brecht, M., Pauly, A.: Closed choice and a uniform low basis theorem. Ann. Pure Appl. Log. 163(8), 986\u20131008 (2012). https:\/\/doi.org\/10.1016\/J.APAL.2011.12.020","DOI":"10.1016\/J.APAL.2011.12.020"},{"issue":"4","key":"31_CR3","doi-asserted-by":"publisher","first-page":"1614","DOI":"10.1017\/JSL.2020.76","volume":"85","author":"V Brattka","year":"2020","unstructured":"Brattka, V., Gherardi, G.: Weihrauch goes Brouwerian. J. Symb. Log. 85(4), 1614\u20131653 (2020). https:\/\/doi.org\/10.1017\/JSL.2020.76","journal-title":"J. Symb. Log."},{"issue":"3","key":"31_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/J.APAL.2020.102914","volume":"172","author":"V Brattka","year":"2021","unstructured":"Brattka, V., Gherardi, G.: Completion of choice. Ann. Pure Appl. Log. 172(3), 102914 (2021). https:\/\/doi.org\/10.1016\/J.APAL.2020.102914","journal-title":"Ann. Pure Appl. Log."},{"key":"31_CR5","doi-asserted-by":"publisher","unstructured":"Brattka, V., Gherardi, G., Pauly, A.: Weihrauch complexity in computable analysis. In: Brattka, V., Hertling, P. (eds.) Handbook of Computability and Complexity in Analysis, LNCS, pp. 367\u2013417. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-59234-9_11","DOI":"10.1007\/978-3-030-59234-9_11"},{"key":"31_CR6","doi-asserted-by":"publisher","unstructured":"Brattka, V., Hertling, P.: Feasible real random acess machines. J. Complex. 14, 490\u2013526 (1998). https:\/\/doi.org\/10.1006\/jcom.1998.0488","DOI":"10.1006\/jcom.1998.0488"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Brattka, V., Pauly, A.: Computation with advice. Electron. Proc. Theor. Comput. Sci. 24 (2010). http:\/\/arxiv.org\/html\/1006.0551, cCA 2010","DOI":"10.4204\/EPTCS.24.9"},{"key":"31_CR8","doi-asserted-by":"publisher","unstructured":"Dzhafarov, D.D.: Joins in the strong Weihrauch degrees. Math. Res. Lett. 26(3), 749\u2013767 (2019). https:\/\/doi.org\/10.4310\/MRL.2019.v26.n3.a5, https:\/\/dx.doi.org\/10.4310\/MRL.2019.v26.n3.a5","DOI":"10.4310\/MRL.2019.v26.n3.a5"},{"key":"31_CR9","doi-asserted-by":"publisher","unstructured":"Ershov, Y.L.: Theory of numberings. In: Handbook of Computability Theory, pp. 473\u2013506. Elsevier (1999). https:\/\/doi.org\/10.1016\/S0049-237X(99)80030-5","DOI":"10.1016\/S0049-237X(99)80030-5"},{"issue":"3\u20134","key":"31_CR10","doi-asserted-by":"publisher","first-page":"281","DOI":"10.3233\/COM-180207","volume":"8","author":"G Gherardi","year":"2019","unstructured":"Gherardi, G., Marcone, A., Pauly, A.: Projection operators in the Weihrauch lattice. Computability 8(3\u20134), 281\u2013304 (2019). https:\/\/doi.org\/10.3233\/COM-180207","journal-title":"Computability"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Hoyrup, M.: The fixed-point property for represented spaces. Ann. Pure Appl. Log. 173(5) (2022)","DOI":"10.1016\/j.apal.2022.103090"},{"key":"31_CR12","unstructured":"(https:\/\/mathoverflow.net\/users\/65915\/christopher king), C.K.: When can a function defined on $$[a, b] \\cup [b, c]$$ be constructively extended to a function defined on $$[a, c]$$? MathOverflow, https:\/\/mathoverflow.net\/q\/464084, (version: 2024-04-12)"},{"key":"31_CR13","doi-asserted-by":"publisher","unstructured":"Neumann, E., Pauly, A.: A topological view on algebraic computations models. J. Complex. 44 (2018). https:\/\/doi.org\/10.1016\/j.jco.2017.08.003, http:\/\/arxiv.org\/abs\/1602.08004","DOI":"10.1016\/j.jco.2017.08.003"},{"key":"31_CR14","doi-asserted-by":"publisher","unstructured":"Neumann, E., Pauly, A., Pradic, C., Valenti, M.: Computably discrete represented spaces. In: Beckmann, A., Oitavem, I., Manea, F. (eds.) Crossroads of Computability and Logic: Insights, Inspirations, and Innovations - 21st Conference on Computability in Europe, CiE 2025, Lisbon, Portugal, July 14-18, 2025, Proceedings. LNCS, vol. 15764, pp. 349\u2013364. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-95908-0_25","DOI":"10.1007\/978-3-031-95908-0_25"},{"key":"31_CR15","doi-asserted-by":"publisher","unstructured":"Nobrega, H., Pauly, A.: Game characterizations and lower cones in the Weihrauch degrees. Log. Methods Comput. Sci. 15(3), 11.1\u201311.29 (2019). https:\/\/doi.org\/10.23638\/LMCS-15(3:11)2019","DOI":"10.23638\/LMCS-15(3:11)2019"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Pauly, A.: Computability on the countable ordinals and the Hausdorff-Kuratowski theorem. In: MFCS 2015 (2015). http:\/\/arxiv.org\/abs\/1501.00386","DOI":"10.1007\/978-3-662-48057-1_32"},{"key":"31_CR17","doi-asserted-by":"publisher","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, http:\/\/arxiv.org\/abs\/1204.3763","DOI":"10.3233\/COM-150049"},{"key":"31_CR18","doi-asserted-by":"publisher","unstructured":"Pauly, A., de\u00a0Brecht, M.: Descriptive set theory in the category of represented spaces. In: 30th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, 6\u201310 July 2015, pp. 438\u2013449. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/LICS.2015.48","DOI":"10.1109\/LICS.2015.48"},{"key":"31_CR19","doi-asserted-by":"publisher","unstructured":"Pauly, A., Sold\u00e0, G.: Sequential discontinuity and first-order problems. In: Patey, L.L., Pimentel, E., Galeotti, L., Manea, F. (eds.) Twenty Years of Theoretical and Practical Synergies - 20th Conference on Computability in Europe, CiE 2024, Amsterdam, The Netherlands, 8\u201312 July 2024, Proceedings. LNCS, vol. 14773, pp. 351\u2013365. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-64309-5_28","DOI":"10.1007\/978-3-031-64309-5_28"},{"key":"31_CR20","doi-asserted-by":"publisher","unstructured":"Roux, S.L., Pauly, A.: Finite choice, convex choice and finding roots. Log. Methods Comput. Sci. 11(4) (2015). https:\/\/doi.org\/10.2168\/LMCS-11(4:6)2015","DOI":"10.2168\/LMCS-11(4:6)2015"},{"key":"31_CR21","doi-asserted-by":"publisher","unstructured":"Tavana, N., Weihrauch, K.: Turing machines on represented sets, a model of computation for analysis. Log. Methods Comput. Sci. 7, 1\u201321 (2011). https:\/\/doi.org\/10.2168\/LMCS-7(2:19)2011","DOI":"10.2168\/LMCS-7(2:19)2011"},{"key":"31_CR22","doi-asserted-by":"publisher","unstructured":"Ziegler, M.: Computability and continuity on the real arithmetic hierarchy and the power of type-2 nondeterminism. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) New Computational Paradigms. CiE 2005. LNCS, vol.\u00a03526, pp. 562\u2013571. Springer, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11494645_68","DOI":"10.1007\/11494645_68"}],"container-title":["Lecture Notes in Computer Science","Timeless Machines: Computability Across Eras"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-31348-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:33Z","timestamp":1784482173000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-31348-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,20]]},"ISBN":["9783032313478","9783032313485"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-31348-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,20]]},"assertion":[{"value":"20 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The author has no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","label":"Disclosure of Interests","group":{"name":"EthicsHeading","label":"Ethics"}},{"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":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}