Skip to main content

The Use of a Logical Principle of Uniform Boundedness in Analysis

  • Chapter
Logic and Foundations of Mathematics

Part of the book series: Synthese Library ((SYLI,volume 280))

Abstract

This paper is part of a sequence of papers ([9–12]) resulting from our Habilitation-thesis [8] adressing the following question:

What is the impact on the growth of extractable uniform bounds the use of various analytical principles Γ in a given proof of an ∀∃-sentence might have?

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

Access this chapter

eBook
USD 16.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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bezem, M. A., `Strongly Majorizable Functional of Finite Type: A Model for Bar Recursion Containing Discontinuous Functionals’, J. Symbolic Logic, 50 (1985), 652–660.

    Article  Google Scholar 

  2. Feferman, S., `Theories of Finite Type Related to Mathematical Practice’, in J. Barwise (ed.), Handbook of Mathematical Logic, North-Holland, Amsterdam, 1977, pp. 913–972.

    Chapter  Google Scholar 

  3. Friedman, H., `Systems of Second Order Arithmetic with Restricted Induction (Abstract)’, J. Symbolic Logic, 41 (1976), 558–559.

    Article  Google Scholar 

  4. Kohlenbach, U., `Effective Bounds from Ineffective Proofs in Analysis: an Application of Functional Interpretation and Majorization’, J. Symbolic Logic, 57 (1992), 1239–1273.

    Article  Google Scholar 

  5. Kohlenbach, U., `Effective Moduli from Ineffective Uniqueness Proofs. An Unwinding of de La Vallée Poussin’s Proof for Chebycheff Approximation’, Ann. Pure Appl. Logic, 64 (1993), 27–94.

    Article  Google Scholar 

  6. Kohlenbach, U., `New Effective Moduli of Uniqueness and Uniform a-priori Estimates for Constants of Strong Unicity by Logical Analysis of Known Proofs in Best Approximation Theory’, Numer. Funct. Anal. Optim., 14 (1993), 581–606.

    Article  Google Scholar 

  7. Kohlenbach, U., `Analysing Proofs in Analysis’, in W. Hodges et al. (eds), Logic: From Foundations to Applications. European Logic Colloquium (Keele, 1993) Oxford University Press, 1996, pp. 225–260.

    Google Scholar 

  8. Kohlenbach, U., Real Growth in Standard Parts of Analysis, Habilitationsschrift, Frankfurt, 1995.

    Google Scholar 

  9. Kohlenbach, U., `Mathematically Strong Subsystems of Analysis with Low Rate of Growth of Provably Recursive Functionals’, Arch. Math. Logic., 36 (1996), 31–71.

    Article  Google Scholar 

  10. Kohlenbach, U., `Relative Constructivity’, J. Symbolic Logic, 63 (1998), 1218–1238.

    Article  Google Scholar 

  11. Kohlenbach, U., `Elimination of Skolem Functions for Monotone Formulas in Analysis’, Arch. Math. Logic, 37 (1998), 363–390.

    Article  Google Scholar 

  12. Kohlenbach, U., Arithmetizing Proofs in Analysis’, in J. M. Lawazabal et al. (eds), Logic Colloquium 96, Springer Lecture Notes in Logic 12, 1998, pp. 115–158.

    Google Scholar 

  13. Luckhardt, H., Extensional Gödel Functional linterpretation. A Consistency Proof of Classical Analysis, Springer Lecture Notes in Math. 306, 1973.

    Google Scholar 

  14. Sieg, W., `Fragments of Arithmetic’, Ann. Pure Appl. Logic, 28 (1985), 33–71.

    Article  Google Scholar 

  15. Simpson, S. G., `Which Set Existence Axioms are Needed to Prove the Cauchy/Peano Theorem for Ordinary Differential Equations’, J. Symbolic Logic, 49 (1984), 783–801.

    Article  Google Scholar 

  16. Simpson, S. G., `Reverse Mathematics’, in Proc. Symposia Pure Math. 42, AMS, Providence, 1985, pp. 461–471.

    Google Scholar 

  17. Troelstra, A. S., `Note on the Fan Theorem’, J. Symbolic Logic, 39 (1974), 584–596.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Kohlenbach, U. (1999). The Use of a Logical Principle of Uniform Boundedness in Analysis. In: Cantini, A., Casari, E., Minari, P. (eds) Logic and Foundations of Mathematics. Synthese Library, vol 280. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-2109-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-2109-7_7

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-5201-8

  • Online ISBN: 978-94-017-2109-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics