Skip to main content

The Urysohn Extension Theorem for Bishop Spaces

  • Conference paper
  • First Online:
Logical Foundations of Computer Science (LFCS 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9537))

Included in the following conference series:

Abstract

Bishop’s notion of function space, here called Bishop space, is a function-theoretic analogue to the classical set-theoretic notion of topological space. Bishop introduced this concept in 1967, without exploring it, and Bridges revived the subject in 2012. The theory of Bishop spaces can be seen as a constructive version of the theory of the ring of continuous functions. In this paper we define various notions of embeddings of one Bishop space to another and develop their basic theory in parallel to the classical theory of embeddings of rings of continuous functions. Our main result is the translation within the theory of Bishop spaces of the Urysohn extension theorem, which we show that it is constructively provable. We work within Bishop’s informal system of constructive mathematics \(\mathrm {BISH}\), inductive definitions with countably many premises included.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The uniqueness property is included, for example, in [21], p. 238.

  2. 2.

    According to Bishop and Bridges [4], p. 85, if \(B \subseteq X\), where (Xd) is an inhabited metric space, B is a bounded subset of X, if there is some \(x_{0} \in X\) such that \(B \cup \{x_{0}\}\) with the induced metric is a bounded metric space. If we suppose that the inclusion map of a subset is the identity (see [4], p. 68), the induced metric on \(B \cup \{x_{0}\}\) is reduced to the relative metric on \(B \cup \{x_{0}\}\). We may also denote a bounded subset B of an inhabited metric space X by \((B, x_{0}, M)\), where \(M > 0\) is a bound for \(B \cup \{x_{0}\}\). If \((B, x_{0}, M)\) is a bounded subset of X then \(B \subseteq \mathcal {B}(x_{0}, M)\), and \((\mathcal {B}(x_{0}, M), x_{0}, 2M)\) is also a bounded subset of X. I.e., a bounded subset of X is included in an inhabited bounded subset of X which is also metric-open i.e., it includes an open ball of every element of it.

  3. 3.

    See definition 2.1 in [4], p. 72. It is also easy to see that \(a \bowtie _{\mathbb {R}} b \leftrightarrow a \bowtie _{{\mathrm {Bic}({\mathbb R})}} b\), for every \(a, b \in \mathbb {R}\).

References

  1. Bishop, E.: Foundations of Constructive Analysis. McGraw-Hill, New York (1967)

    MATH  Google Scholar 

  2. Bishop, E.: Mathematics as a numerical language. In: Kino, A., Myhill, J., Vesley, R.E. (eds.) Intuitionism and Proof Theory, pp. 53–71. North-Holland, Amsterdam (1970)

    Google Scholar 

  3. Bishop, E., Cheng, H.: Constructive measure theory. Mem. Amer. Math. Soc. 116 (1972)

    Google Scholar 

  4. Bishop, E., Bridges, D.: Constructive Analysis, Grundlehren der Math. Wissenschaften 279. Springer, Heidelberg (1985)

    Google Scholar 

  5. Bridges, D.S., Richman, F.: Varieties of Constructive Mathematics. Cambridge University Press, Cambridge (1987)

    Book  MATH  Google Scholar 

  6. Bridges, D., Vîţă, L.S.: Apartness and Uniformity: A Constructive Development. CiE Series Theory and Applications of Computability. Springer, Heidelberg (2011)

    Book  MATH  Google Scholar 

  7. Bridges, D.: Reflections on function spaces. Ann. Pure Appl. Logic 163, 101–110 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. Brouwer, L.E.J.: Zur Begründung der intuitionistische Mathematik III. Math. Ann. 96, 451–488 (1926)

    Article  MATH  Google Scholar 

  9. Buchholz, W., Feferman, S., Pohlers, W., Sieg, W.: Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretic Studies. LNM, vol. 897. Springer, Heidelberg (1981)

    Book  MATH  Google Scholar 

  10. Dugundji, J.: Topology. Wm. C. Brown Publishers, Dubuque (1989)

    MATH  Google Scholar 

  11. Gillman, L., Jerison, M.: Rings of Continuous Functions. Van Nostrand, Princeton (1960)

    Book  MATH  Google Scholar 

  12. Grayson, R.J.: Concepts of general topology in constructive mathematics and in sheaves. Ann. Math. Logic 20, 1–41 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  13. Fréchet, M.: Sur quelques points du calcul fonctionnel. Rend. Circ. Mat. di Palermo 22, 1–74 (1906)

    Article  MATH  Google Scholar 

  14. Ishihara, H., Mines, R., Schuster, P., Vîţă, L.S.: Quasi-apartness and neighborhood spaces. Ann. Pure Appl. Logic 141, 296–306 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  15. Ishihara, H.: Two subcategories of apartness spaces. Ann. Pure Appl. Logic 163, 132–139 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  16. Ishihara, H.: Relating Bishop’s function spaces to neighborhood spaces. Ann. Pure Appl. Logic 164, 482–490 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  17. Martin-Löf, P.: Notes on Constructive Mathematics. Almqvist and Wiksell, Stockholm (1968)

    MATH  Google Scholar 

  18. Martin-Löf, P.: Intuitionistic Type Theory: Notes by Giovanni Sambin on a Series of Lectures Given in Padua, June 1980. Bibliopolis, Napoli (1984)

    MATH  Google Scholar 

  19. Martino, E., Giaretta, P.: Brouwer Dummett, and the bar theorem. In: Bernini, S. (ed.) Atti del Congresso Nazionale di Logica, Montecatini Terme, 1–5 Ottobre 1979, Napoli, pp. 541–558 (1981)

    Google Scholar 

  20. Myhill, J.: Constructive set theory. J. Symbolic Logic 40, 347–382 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  21. Palmgren, E.: From intuitionistic to point-free topology: on the foundations of homotopy theory. In: Lindström, S., et al. (eds.) Logicism, Intuitionism, and Formalism. Synthese Library, vol. 341, pp. 237–253. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  22. Petrakis, I.: Bishop spaces: constructive point-function topology, In: Mathematisches Forschungsinstitut Oberwolfach Report No. 52/2014, Mathematical Logic: Proof Theory, Constructive Mathematics, pp. 26–27 (2014)

    Google Scholar 

  23. Petrakis, I.: Completely regular bishop spaces. In: Beckmann, A., Mitrana, V., Soskova, M. (eds.) CiE 2015. LNCS, vol. 9136, pp. 302–312. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  24. Petrakis, I.: Constructive topology of Bishop spaces. Ph.D. thesis, LMU Munich (2015)

    Google Scholar 

  25. Sambin, G.: Intuitionistic formal spaces - a first communication. In: Skordev, D. (ed.) Mathematical Logic and its Applications, pp. 187–204. Plenum Press, New York (1987)

    Chapter  Google Scholar 

  26. Sambin, G.: The Basic Picture: Structures for Constructive Topology. Oxford University Press (in press)

    Google Scholar 

  27. Spanier, E.: Quasi-topologies. Duke Math. J. 30(1), 1–14 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  28. Troelstra, A.S.: Intuitionistic general topology. Ph.D. thesis, Amsterdam (1966)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Iosif Petrakis .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Petrakis, I. (2016). The Urysohn Extension Theorem for Bishop Spaces. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2016. Lecture Notes in Computer Science(), vol 9537. Springer, Cham. https://doi.org/10.1007/978-3-319-27683-0_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27683-0_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27682-3

  • Online ISBN: 978-3-319-27683-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics