Skip to main content

A comparison of concepts from computable analysis and effective descriptive set theory


Computable analysis and effective descriptive set theory are both concerned with complete metric spaces, functions between them and subsets thereof in an effective setting. The precise relationship of the various definitions used in the two disciplines has so far been neglected, a situation this paper is meant to remedy.

As the role of the Cauchy completion is relevant for both effective approaches to Polish spaces, we consider the interplay of effectivity and completion in some more detail.

Hide All
Brattka, V. (2005). Effective Borel measurability and reducibility of functions. Mathematical Logic Quarterly 51 1944.
Brattka, V., de Brecht, M. and Pauly, A. (2012a). Closed choice and a uniform low basis theorem. Annals of Pure and Applied Logic 163 9681008.
Brattka, V. and Gherardi, G. (2011). Effective choice and boundedness principles in computable analysis. Bulletin of Symbolic Logic 1 73117. ArXiv:0905.4685.
Brattka, V., Gherardi, G. and Marcone, A. (2012b). The Bolzano-Weierstrass theorem is the jump of weak König's lemma. Annals of Pure and Applied Logic 163 623625. Also arXiv:1101.0792.
Bruckner, A.M., Bruckner, J.B. and Thomson, B.S. (1997). Real Analysis, Prentice-Hall.
de Brecht, M. (2013). Quasi-polish spaces. Annals of Pure and Applied Logic 164 354381.
de Brecht, M. (2014). Levels of discontinuity, limit-computability, and jump operators. In: Brattka, V., Diener, H. and Spreen, S. (eds.) Logic, Computation, Hierarchies, de Gruyter, 79108. ArXiv 1312.0697.
de Brecht, M. and Yamamoto, A. (2009). σ0 α - admissible representations (extended abstract). In: Bauer, A., Hertling, P. and Ko, K.-I. (eds.) Proceedings of the 6th International Conference on Computability and Complexity in Analysis. Schloss Dagstuhl,
Gherardi, G. and Marcone, A. (2009). How incomputable is the separable Hahn-Banach theorem? Notre Dame Journal of Formal Logic 50 393425.
Gregoriades, V. and Moschovakis, Y.N. (in preparation). Notes on effective descriptive set theory. Notes in preparation.
Hertling, P. (1996). Unstetigkeitsgrade von Funktionen in der effektiven Analysis, Ph.D. thesis, Fernuniversität, Gesamthochschule in Hagen.
Jayne, J.E. and Rogers, C.A. (1982). First level borel functions and isomorphisms. Journal de Mathématiques Pures et Appliqués 61 177205.
Kačena, M., Ros, L.M. and Semmes, B. (2012). Some observations on ‘a new proof of a theorem of Jayne and Rogers’. Real Analysis Exchange 38 121132.
Kihara, T. (2015). Decomposing Borel functions using the Shore-Slaman join theorem. Fundamenta Mathematicae 230 113. doi: 10.4064/fm230-1-1.
Korovina, M.V. and Kudinov, O.V. (2008). Towards computability over effectively enumerable topological spaces. Electronic Notes in Theoretical Computer Science 221 115125.
Kreitz, C. and Weihrauch, K. (1985). Theory of representations. Theoretical Computer Science 38 3553.
Moschovakis, Y.N. (1980). Descriptive Set Theory, Studies in Logic and the Foundations of Mathematics, volume 100, North-Holland.
Moschovakis, Y.N. (2010). Classical descriptive set theory as a refinement of effective descriptive set theory. Annals of Pure and Applied Logic 162 243255.
Motto Ros, L., Schlicht, P. and Selivanov, V. (2014). Wadge-like reducibilities on arbitrary quasi-polish spaces. Mathematical Structures in Computer Science 1–50, ArXiv 1204.5338.
Motto Ros, L. and Semmes, B. (2009). A new proof of a theorem of Jayne and Rogers. Real Analysis Exchange 35 195204.
Pauly, A. (2010). How incomputable is finding Nash equilibria? Journal of Universal Computer Science 16 26862710.
Pauly, A. (2012). On the topological aspects of the theory of represented spaces.
Pauly, A. (2015a). Computability on the countable ordinals and the Hausdorff-Kuratowski theorem. arXiv 1501.00386.
Pauly, A. (2015b). Computability on the countable ordinals and the hausdorff-kuratowski theorem (extended abstract). In: Italiano, G.F., Pighizzini, G. and Sannella, D.T. (eds.) Mathematical Foundations of Computer Science 2015. Springer Lecture Notes in Computer Science 9234 407418,
Pauly, A. and de Brecht, M. (2013). Towards synthetic descriptive set theory: An instantiation with represented spaces. arXiv 1307.1850.
Pauly, A. and de Brecht, M. (2014). Non-deterministic computation and the Jayne Rogers theorem. Electronic Proceedings in Theoretical Computer Science 143 8796.
Pauly, A. and de Brecht, M. (2015). Descriptive set theory in the category of represented spaces. In: Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) 438–449.
Pour-El, M. and Richards, I. (1989). Computability in Analysis and Physics, Perspectives in Mathematical Logic, Springer.
Rettinger, R. and Weihrauch, K. (2013). Products of effective topological spaces and a uniformly computable tychonoff theorem. Logical Methods in Computer Science 9.
Saint Raymond, J. (2007). Preservation of the borel class under countable-compact-covering mappings. Topology and its Applications 154 17141725.
Schröder, M. (2002). Admissible Representations for Continuous Computations, Ph.D. Thesis, FernUniversität Hagen.
Selivanov, V. L. (2013). Total representations. Logical Methods in Computer Science 9.
Semmes, B. (2009). A Game for the Borel Functions, Ph.D. Thesis, University of Amsterdam.
Weihrauch, K. (1987). Computability, Monographs on Theoretical Computer Science, Springer-Verlag.
Weihrauch, K. (1992a). The degrees of discontinuity of some translators between representations of the real numbers. In: Informatik Berichte, volume 129, FernUniversität Hagen, Hagen.
Weihrauch, K. (1992b). The TTE-interpretation of three hierarchies of omniscience principles. In: Informatik Berichte, volume 130, FernUniversität Hagen, Hagen.
Weihrauch, K. (2000). Computable Analysis, Springer-Verlag.
Ziegler, M. (2007). Real hypercomputation and continuity. Theory of Computing Systems 41 177206.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed