Skip to main content

The Logical Strength of the Uniform Continuity Theorem

  • Conference paper

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

Abstract

We introduce a notion of complexity for sets of finite binary sequences such that the corresponding fan theorem is constructively equivalent to the uniform continuity theorem. This settles an open question.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aczel, P., Rathjen, M.: Notes on constructive set theory. Technical Report 40, Institut Mittag-Leffler, The Royal Swedish Academy of Sciences (2001)

    Google Scholar 

  2. Berger, J.: The fan theorem and uniform continuity. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 18–22. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

  5. Bridges, D., Richman, F.: Varieties of Constructive Mathematics. London Mathematical Society Lecture Note Series, vol. 97. Cambridge University Press, Cambridge (1987)

    Book  MATH  Google Scholar 

  6. Ishihara, H.: Constructive Reverse Mathematics: Compactness Properties. In: Crosilla, L., Schuster, P. (eds.) From Sets and Types to Topology and Analysis. Oxford Logic Guides, vol. 48, pp. 245–267. Oxford University Press, Oxford (2005)

    Chapter  Google Scholar 

  7. Ishihara, H.: Reverse mathematics in Bishop’s constructive mathematics. Philosophia Scientiae (to appear)

    Google Scholar 

  8. Loeb, I.: Equivalents of the (Weak) Fan Theorem. Annals of Pure and Applied Logic 132(1), 51–66 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  9. Troelstra, A.S. (ed.): Metamathematical Investigation of Intuitionistic Arithmetic and Analysis. Lecture Notes in Mathematics, vol. 344. Springer, Heidelberg (1973)

    MATH  Google Scholar 

  10. Troelstra, A.S., van Dalen, D.: Constructivism in Mathematics. An Introduction. In: Studies in Logic and the Foundation of Mathematics, vol. I, 121. North-Holland, Amsterdam (1988)

    Google Scholar 

  11. Troelstra, A.S., van Dalen, D.: Constructivism in Mathematics. An Introduction. In: Studies in Logic and the Foundation of Mathematics, vol. II, 123. North-Holland, Amsterdam (1988)

    Google Scholar 

  12. Veldman, W.: Brouwer’s fan theorem as an axiom and as a contrast to Kleene’s alternative. Radboud University, Nijmegen (preprint, 2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berger, J. (2006). The Logical Strength of the Uniform Continuity Theorem. 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_4

Download citation

  • DOI: https://doi.org/10.1007/11780342_4

  • 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)

Publish with us

Policies and ethics