{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:27:28Z","timestamp":1743146848691,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"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_24","type":"book-chapter","created":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T16:59:28Z","timestamp":1494521968000},"page":"246-257","source":"Crossref","is-referenced-by-count":4,"title":["Towards Computable Analysis on the Generalised Real Line"],"prefix":"10.1007","author":[{"given":"Lorenzo","family":"Galeotti","sequence":"first","affiliation":[]},{"given":"Hugo","family":"Nobrega","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"issue":"8","key":"24_CR1","doi-asserted-by":"crossref","first-page":"986","DOI":"10.1016\/j.apal.2011.12.020","volume":"163","author":"V Brattka","year":"2012","unstructured":"Brattka, V., de Brecht, M., Pauly, A.: Closed choice and a uniform low basis theorem. Ann. Pure Appl. Log. 163(8), 986\u20131008 (2012)","journal-title":"Ann. Pure Appl. Log."},{"issue":"1","key":"24_CR2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2178\/bsl\/1294186663","volume":"17","author":"V Brattka","year":"2011","unstructured":"Brattka, V., Gherardi, G.: Effective choice and boundedness principles in computable analysis. Bull. Symb. Log. 17(1), 73\u2013117 (2011)","journal-title":"Bull. Symb. Log."},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-40189-8_23","volume-title":"Pursuit of the Universal","author":"M Carl","year":"2016","unstructured":"Carl, M.: Generalized effective reducibility. In: Beckmann, A., Bienvenu, L., Jonoska, N. (eds.) CiE 2016. LNCS, vol. 9709, pp. 225\u2013233. Springer, Cham (2016). doi: 10.1007\/978-3-319-40189-8_23"},{"key":"24_CR4","unstructured":"Carl, M., Galeotti, L., L\u00f6we, B.: The Bolzano-Weierstra\u00df theorem for the generalised real line. In preparation"},{"key":"24_CR5","volume-title":"Basic Algebra. Groups, Rings and Fields","author":"PM Cohn","year":"2003","unstructured":"Cohn, P.M.: Basic Algebra. Groups, Rings and Fields. Springer, Heidelberg (2003)"},{"key":"24_CR6","doi-asserted-by":"crossref","DOI":"10.1201\/9781439864159","volume-title":"On Numbers and Games","author":"JH Conway","year":"2000","unstructured":"Conway, J.H.: On Numbers and Games. Taylor & Francis, New York (2000)"},{"key":"24_CR7","unstructured":"Dawson, B.: Ordinal time Turing computation. Ph.D. thesis, University of Bristol (2009)"},{"key":"24_CR8","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198539919.001.0001","volume-title":"Super-Real Fields: Totally Ordered Fields with Additional Structure","author":"HG Dales","year":"1996","unstructured":"Dales, H.G., Woodin, W.H.: Super-Real Fields: Totally Ordered Fields with Additional Structure. Clarendon Press, Oxford (1996)"},{"issue":"2","key":"24_CR9","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s000120050014","volume":"37","author":"P Ehrlich","year":"1997","unstructured":"Ehrlich, P.: Dedekind cuts of Archimedean complete ordered abelian groups. Algebra Univers. 37(2), 223\u2013234 (1997)","journal-title":"Algebra Univers."},{"key":"24_CR10","unstructured":"Galeotti, L.: Computable analysis over the generalized Baire space. Master\u2019s thesis, Universiteit van Amsterdam (2015)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-319-40189-8_28","volume-title":"Pursuit of the Universal","author":"L Galeotti","year":"2016","unstructured":"Galeotti, L.: A candidate for the generalised real line. In: Beckmann, A., Bienvenu, L., Jonoska, N. (eds.) CiE 2016. LNCS, vol. 9709, pp. 271\u2013281. Springer, Cham (2016). doi: 10.1007\/978-3-319-40189-8_28"},{"key":"24_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511629143","volume-title":"An Introduction to the Theory of Surreal Numbers","author":"H Gonshor","year":"1986","unstructured":"Gonshor, H.: An Introduction to the Theory of Surreal Numbers. Cambridge University Press, Cambridge (1986)"},{"issue":"3","key":"24_CR13","doi-asserted-by":"crossref","first-page":"377","DOI":"10.2178\/bsl\/1122038993","volume":"11","author":"P Koepke","year":"2005","unstructured":"Koepke, P.: Turing computations on ordinals. Bull. Symb. Logic 11(3), 377\u2013397 (2005)","journal-title":"Bull. Symb. Logic"},{"issue":"3","key":"24_CR14","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.apal.2009.01.005","volume":"160","author":"P Koepke","year":"2009","unstructured":"Koepke, P., Seyfferth, B.: Ordinal machines and admissible recursion theory. Ann. Pure Appl. Log. 160(3), 310\u2013318 (2009)","journal-title":"Ann. Pure Appl. Log."},{"key":"24_CR15","unstructured":"Pauly, A.: On the topological aspects of the theory of represented spaces. Preprint, (2015). arXiv:1204.3763v3"},{"issue":"9","key":"24_CR16","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1016\/j.apal.2014.04.016","volume":"165","author":"B Rin","year":"2014","unstructured":"Rin, B.: The computational strengths of $$\\alpha $$ -tape infinite time Turing machines. Ann. Pure Appl. Log. 165(9), 1501\u20131511 (2014)","journal-title":"Ann. Pure Appl. Log."},{"key":"24_CR17","volume-title":"Computable Analysis: An Introduction","author":"K Weihrauch","year":"2012","unstructured":"Weihrauch, K.: Computable Analysis: An Introduction. Springer, Heidelberg (2012)"}],"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_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T02:14:28Z","timestamp":1719195268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-58741-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319587400","9783319587417"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58741-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}