Skip to main content

Hilbert's programme and the search for automatic proof procedures

  • Conference paper
  • First Online:
Symposium on Automatic Demonstration

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

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 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.95
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

  1. J.F. Adams, Vector fields on spheres, Ann. of Math 75(1962) pp. 603–632.

    Article  MathSciNet  MATH  Google Scholar 

  2. A. Baker, Contributions to the theory of Diophantine equations, Phil. Trans. Roy. Soc. A 263 (1968) pp. 173–208 and, for practical bounds, Linear forms in the logarithms of algebraic numbers (IV), Mathematika 15 (1968) pp. 204–216.

    Article  MATH  Google Scholar 

  3. H. Davenport and K.F. Roth, Rational approximations to algebraic numbers, Mathematika 2 (1955) pp. 160–167.

    Article  MathSciNet  MATH  Google Scholar 

  4. B. Dreben, P. Andrews, S. Aandera, False lemmas in Herbrand, Bull. Ann. Math. Soc. 69 (1963) pp. 699–706.

    Article  MathSciNet  MATH  Google Scholar 

  5. G. Kreisel, Mathematical logic: what has it done for the philosophy of mathematics ? Bertrand Russel: Philosopher of the century, Allen and Unwin, London 1967, pp. 201–272.

    Google Scholar 

  6. Survey of proof theory, J.S.L. 33 (1968) pp. 321–388.

    Google Scholar 

  7. Church's thesis: a kind of reducibility axiom for constructive mathematics, to appear in the Proceeding of the conference on proof theory and intuitionism, Buffalo 1968.

    Google Scholar 

  8. R.S. Lehman, On the difference II(x)-li(x), Acta arithmetica 11 (1966) pp. 397–410

    MathSciNet  MATH  Google Scholar 

  9. J. Milnor, Somme consequences of a theorem of Bott, Ann. of Math. 68 (1958) pp. 444–449.

    Article  MathSciNet  MATH  Google Scholar 

  10. J.C. Shepherdson, Non-standard models for fragments of number theory, The theory of models, North Holland, Amsterdam, 1965, pp. 342–358.

    MATH  Google Scholar 

  11. D.B. Thompson, Dissertation, Stanford University, 1968.

    Google Scholar 

  12. H.S. Vandiver, Fermat's last theorem. Its history and the known results concerning it, Am. Math. Monthly 53 (1946) pp. 555–578 and A supplementary note to a 1946 article on Fermat's last theorem, ibid. 60 (1953) pp. 164–167.

    Article  MathSciNet  MATH  Google Scholar 

  13. S. Winograd, How fast can computers add ? Scientific American 1968-(no) p. 93–100.

    Google Scholar 

Download references

Authors

Editor information

M. Laudet D. Lacombe L. Nolin M. Schützenberger

Rights and permissions

Reprints and permissions

Copyright information

© 1970 Springer-Verlag

About this paper

Cite this paper

Kreisel, G. (1970). Hilbert's programme and the search for automatic proof procedures. In: Laudet, M., Lacombe, D., Nolin, L., Schützenberger, M. (eds) Symposium on Automatic Demonstration. Lecture Notes in Mathematics, vol 125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060629

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-04914-2

  • Online ISBN: 978-3-540-36262-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics