{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T12:30:47Z","timestamp":1766493047796},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_20","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T21:32:38Z","timestamp":1188336758000},"page":"224-235","source":"Crossref","is-referenced-by-count":16,"title":["Computable Versions of Baire\u2019s Category Theorem"],"prefix":"10.1007","author":[{"given":"Vasco","family":"Brattka","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(98)00095-4","volume":"210","author":"V. Brattka","year":"1999","unstructured":"V. Brattka. Computable invariance. Theoretical Computer Science, 210:3\u201320, 1999.","journal-title":"Theoretical Computer Science"},{"key":"20_CR2","unstructured":"V. Brattka. Recursive and computable operations over topological structures. Informatik Berichte 255, FernUniversit\u00e4t Hagen, July 1999. Dissertation."},{"key":"20_CR3","unstructured":"V. Brattka. Computability of Banach Space Principles. Informatik Berichte, FernUniversit\u00e4t Hagen, June 2001."},{"key":"20_CR4","unstructured":"V. Brattka and G. Presser. Computability on subsets of metric spaces. submitted, 2000."},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0304-3975(98)00284-9","volume":"219","author":"V. Brattka","year":"1999","unstructured":"V. Brattka and K. Weihrauch. Computability on subsets of Euclidean space I: Closed and compact subsets. Theoretical Computer Science, 219:65\u201393, 1999.","journal-title":"Theoretical Computer Science"},{"key":"20_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511565663","volume-title":"Varieties of Constructive Mathematics","author":"D. Bridges","year":"1987","unstructured":"D. Bridges and F. Richman. Varieties of Constructive Mathematics. Cambridge University Press, Cambridge, 1987."},{"key":"20_CR7","unstructured":"C. Goffman and G. Pedrick. First Course in Functional Analysis. Prentince-Hall, Englewood Cliffs, 1965."},{"key":"20_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity Theory of Real Functions","author":"K.-I. Ko","year":"1991","unstructured":"K.-I. Ko. Complexity Theory of Real Functions. Birkh\u00e4user, Boston, 1991."},{"key":"20_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-8755-6","volume-title":"Fundamentals of Functional Analysis","author":"S. S. Kutateladze","year":"1996","unstructured":"S. S. Kutateladze. Fundamentals of Functional Analysis. Kluwer Academic Publishers, Dordrecht, 1996."},{"key":"20_CR10","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1989","unstructured":"P. Odifreddi. Classical Recursion Theory. North-Holland, Amsterdam, 1989."},{"key":"20_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21717-7","volume-title":"Computability in Analysis and Physics","author":"M. B. Pour-El","year":"1989","unstructured":"M. B. Pour-El and J. I. Richards. Computability in Analysis and Physics. Springer, Berlin, 1989."},{"key":"20_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69965-8","volume-title":"Computability","author":"K. Weihrauch","year":"1987","unstructured":"K. Weihrauch. Computability. Springer, Berlin, 1987."},{"key":"20_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K. Weihrauch","year":"2000","unstructured":"K. Weihrauch. Computable Analysis. Springer, Berlin, 2000."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/S0304-3975(98)00301-6","volume":"219","author":"M. Yasugi","year":"1999","unstructured":"M. Yasugi, T. Mori, and Y. Tsujii. Effective properties of sets and functions in metric spaces with computability structure. Theoretical Computer Science, 219:467\u2013486, 1999.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T01:36:37Z","timestamp":1550885797000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}