Skip to main content

On the long-range prospects of automatic theorem-proving

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

Keywords

  • Decision Procedure
  • Predicate Calculus
  • Mathematical Proof
  • Proof Procedure
  • Skolem Function

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.95
Price excludes VAT (Canada)
  • 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. S. Aanderaa, A deterministic proof procedure (manuscript of a term paper), 61 pp., Harvard, May, 1964.

    Google Scholar 

  2. J.L. Darlington, "Theorem proving and information retrieval", Machine intelligence, vol.4 (1969), Edinburgh.

    Google Scholar 

  3. J.R. Guard, J.H. Bennett, W.B. Easton, L.G. Settle, "CRT-aided semi-automated mathematics", AFCRL-67-0167, 1967.

    Google Scholar 

  4. J. Hadamard, Psychology of invention in the mathematical field, Princeton, 1945.

    Google Scholar 

  5. J.E. Littlewood, "The mathematician's art of work", The Rockefeller University Review, September–October, 1967, New York.

    Google Scholar 

  6. D. Prawitz, "An improved proof procedure", Theoria, vol.26 (1960), pp.102–139.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. J.A. Robinson, "A machine-oriented logic based on the resolution principle", J.ACM, vol.12 (1965), pp.23–41.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. H. Wang, "Formalization and automatic theorem-proving", Proc. IFIP Congress, 1965, vol.1, pp.51–58; "Examples in set theory", Z.f.Logik u.Grundl.d.Math., vol.13 (1967), pp.175–188, 241–250.

    MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1970 Springer-Verlag

About this paper

Cite this paper

Wang, H. (1970). On the long-range prospects of automatic theorem-proving. 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/BFb0060627

Download citation

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

  • 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