Abstract
In [6], K. Weihrauch studied the computational properties of the Urysohn Lemma and of the Urysohn-Tietze Lemma within the framework of the TTE-theory of computation. He proved that with respect to negative information both lemmas cannot in general define computable single valued mappings. In this paper we reconsider the same problem with respect to positive information. We show that in the case of positive information neither the Urysohn Lemma nor the Dieudonné version of Urysohn-Tietze Lemma define computable functions. We analyze the degree of the incomputability of such functions (or more precisely, of the incomputability of some of their realizations in the Baire space) according to the theory of effective Borel measurability. In particular, we show that with respect to positive information both the Urysohn function and the Dieudonné function are \(\Sigma^{\rm 0}_{\rm 2}\)-computable and in some cases even \(\Sigma^{\rm 0}_{\rm 2}\)-complete.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brattka, V.: Effective Borel measurability and reducibility of functions. Mathematical Logic Quarterly 51, 19–44 (2005)
Brattka, V.: On the Borel complexity of Hahn-Banach extensions. Electronic Notes in Theoretical Computer Science 120, 3–16 (2005)
Brattka, V., Presser, G.: Computability on subsets of metric spaces. Theoretical Computer Science 305, 43–76 (2003)
Dieudonné, J.: Foundations of Modern Analysis. Academic Press, New York (1960)
Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)
Weihrauch, K.: On computable metric spaces Tietze-Urysohn extension is computable. In: Blank, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol. 2064, pp. 357–368. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gherardi, G. (2006). An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds) Logical Approaches to Computational Barriers. CiE 2006. Lecture Notes in Computer Science, vol 3988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780342_22
Download citation
DOI: https://doi.org/10.1007/11780342_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35466-6
Online ISBN: 978-3-540-35468-0
eBook Packages: Computer ScienceComputer Science (R0)