Mathematical Logic Quarterly 52 (6):625-642 (2006)
AbstractThe focus of this paper is the incomputability of some topological functions using the tools of Borel computability theory, as introduced by V. Brattka in  and . First, we analyze some basic topological functions on closed subsets of ℝn, like closure, border, intersection, and derivative, and we prove for such functions results of Σ02-completeness and Σ03-completeness in the effective Borel hierarchy. Then, following , we re-consider two well-known topological results: the lemmas of Urysohn and Urysohn-Tietze for generic metric spaces . Both lemmas define Σ02-computable functions which in some cases are even Σ02-complete
Added to PP
Historical graph of downloads
References found in this work
Effective Borel Measurability and Reducibility of Functions.Vasco Brattka - 2005 - Mathematical Logic Quarterly 51 (1):19-44.
Citations of this work
Effective Choice and Boundedness Principles in Computable Analysis.Vasco Brattka & Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (1):73-117.