Skip to main content
SpringerLink
Log in

Between constructive and classical mathematics

  • Conference paper
  • First Online:
Computation and Proof Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1104))

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.00
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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  • M. Beeson 1984 Proving programs and programming proofs, Proc. VIIth Int'l. Cong. Logic, Methodology and Phil. of Sci. (Salzburg, 1983)(t.a.).

    Google Scholar 

  • 1984a Foundations of constructive mathematics. Metamathematical studies. (Springer, Berlin)(t.a.).

    Google Scholar 

  • E. Bishop 1967 Foundations of constructive analysis. (McGraw-Hill, New York).

    MATH  Google Scholar 

  • 1970 Mathematics as a numerical language, in Intuitionism and proof theory (North-Holland, Amsterdam), 53–71.

    Google Scholar 

  • D.S. Bridges 1979 Constructive functional analysis, Research Notes in Maths. 28 (Pitman, London).

    MATH  Google Scholar 

  • Y.K. Chan 1981 On some open problems in constructive mathematics, in Constructive mathematics, Lecture Notes in Maths. 873 (Springer, Berlin) 44–53.

    Chapter  Google Scholar 

  • S. Feferman 1975 A language and axioms for explicit mathematics, in Algebra and logic, Lecture Notes in Maths. 450 (Springer, Berlin) 87–139.

    Chapter  Google Scholar 

  • 1978 Recursion theory and set theory: a marriage of convenience, in Generalized recursion theory II (North-Holland, Amsterdam) 55–98.

    Google Scholar 

  • 1979 Constructive theories of functions and classes, in Logic Colloquium 78 (North-Holland, Amsterdam) 159–224.

    Google Scholar 

  • S. Hayashi 1983 Extracting LISP programs from constructive proofs, Pub. Res. Inst. Math. Sciences, Kyoto University, No. 19, 161–191.

    Google Scholar 

  • G. Kreisel and A.S. Troelstra 1970 Formal systems for some branches of intuitionistic analysis, Annals of Math. Logic 1, 229–387.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Pour-El and I. Richards 1983 Noncomputability in analysis and physics: a complete determination of the class of noncomputable linear operators, Advances in Maths 48 (1983) 44–74.

    Article  MathSciNet  MATH  Google Scholar 

  • 1984 The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not, (t.a.).

    Google Scholar 

  • A.S. Troelstra 1977 Aspects of constructive mathematics, in Handbook of mathematical logic (North-Holland, Amsterdam) 973–1052.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Stanford University, 94305, Stanford, CA, USA

    Solomon Feferman

Authors
  1. Solomon Feferman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Walter Oberschelp Michael M. Richter Brigitta Schinzel Wolfgang Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag

About this paper

Cite this paper

Feferman, S. (1984). Between constructive and classical mathematics. In: Börger, E., Oberschelp, W., Richter, M.M., Schinzel, B., Thomas, W. (eds) Computation and Proof Theory. Lecture Notes in Mathematics, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0099484

Download citation

  • DOI: https://doi.org/10.1007/BFb0099484

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13901-0

  • Online ISBN: 978-3-540-39119-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation