Journal of Symbolic Logic

The fan theorem and unique existence of maxima

Josef Berger, Douglas Bridges, and Peter Schuster

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

The existence and uniqueness of a maximum point for a continuous real—valued function on a metric space are investigated constructively. In particular, it is shown, in the spirit of reverse mathematics, that a natural unique existence theorem is equivalent to the fan theorem.

Article information

Source
J. Symbolic Logic, Volume 71, Issue 2 (2006), 713-720.

Dates
First available in Project Euclid: 2 May 2006

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1146620167

Digital Object Identifier
doi:10.2178/jsl/1146620167

Mathematical Reviews number (MathSciNet)
MR2225902

Zentralblatt MATH identifier
1107.03064

Citation

Berger, Josef; Bridges, Douglas; Schuster, Peter. The fan theorem and unique existence of maxima. J. Symbolic Logic 71 (2006), no. 2, 713--720. doi:10.2178/jsl/1146620167. https://projecteuclid.org/euclid.jsl/1146620167


Export citation

References

  • P. Aczel and M. Rathjen, Notes on constructive set theory, Technical Report 40, Institut Mittag--Leffler, Royal Swedish Academy of Sciences,2001.
  • E. Bishop and D. Bridges, Constructive analysis, Grundlehren der Mathematischen Wissenschaften, vol. 279, Springer--Verlag, Heidelberg,1985.
    Mathematical Reviews (MathSciNet): MR804042
    Zentralblatt MATH: 0656.03042
  • D. Bridges, A constructive proximinality property of finite--dimensional linear spaces, Rocky Mountain Journal of Mathematics, vol. 11 (1981), no. 4, pp. 491--497.
    Mathematical Reviews (MathSciNet): MR639435
  • --------, Recent progress in constructive approximation theory, The L.E.J. Brouwer Centenary Symposium (A.S. Troelstra and D. van Dalen, editors), North--Holland, Amsterdam,1982, pp. 41--50.
    Mathematical Reviews (MathSciNet): MR717237
    Zentralblatt MATH: 0521.41022
  • --------, Constructing local optima on a compact interval, preprint, Universität München,2003.
    Zentralblatt MATH: 1105.03065
  • --------, Continuity and Lipschitz constants for continuous projections, preprint, University of Canterbury and Universität München,2003.
  • D. Bridges and F. Richman, Varieties of constructive mathematics, London Mathematical Society Lecture Notes, vol. 97, Cambridge University Press,1987.
    Mathematical Reviews (MathSciNet): MR890955
    Zentralblatt MATH: 0618.03032
  • M. Dummett, Elements of intuitionism, 2nd ed., Oxford Logic Guides, vol. 39, Clarendon Press, Oxford,2000.
    Mathematical Reviews (MathSciNet): MR1815706
    Zentralblatt MATH: 0949.03059
  • H. Ishihara, Informal constructive reverse mathematics, Sūrikaisekikenkyūsho Kīkyūroko, vol. 1381(2004), pp. 108--117.
  • K-I Ko, Complexity theory of real functions, Birkhäuser, Boston--Basel--Berlin,1991.
    Mathematical Reviews (MathSciNet): MR1137517
    Zentralblatt MATH: 0791.03019
  • U. Kohlenbach, Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation, Annals of Pure and Applied Logic, vol. 64 (1993), pp. 27--94.
    Mathematical Reviews (MathSciNet): MR1241250
    Digital Object Identifier: doi:10.1016/0168-0072(93)90213-W
  • E. Specker, Nicht konstruktiv beweisbare Sätze der Analysis, Journal of Symbolic Logic, vol. 14 (1949), pp. 145--158.
    Mathematical Reviews (MathSciNet): MR31447
    Digital Object Identifier: doi:10.2307/2267043
    Project Euclid: euclid.jsl/1183730665
  • K. Weihrauch, Computable analysis, Springer--Verlag, Heidelberg,2000.
    Mathematical Reviews (MathSciNet): MR1795407
    Zentralblatt MATH: 0956.68056

Association for Symbolic Logic

Journal of Symbolic Logic
  • You have access to this content.
  • You have partial access to this content.
  • You do not have access to this content.
Turn Off MathJax

What is MathJax?

More like this

+ See more