Skip to main content

New Directions in Mechanical Theorem Proving

  • Chapter

Part of the book series: Symbolic Computation ((1064))

Abstract

The exclusive use of first-order logic in mechanical theorem proving systems effectively prevents the formulation of most interesting problems for input to them, while the use of higher-order logic would not. Yet if the higher-order notion of logical validity is construed, following Henkin. as “true under all interpretations, standard or not”, as is advocated here, then full omega-order logic still has a mechanical proof procedure. Furthermore, since Takeuti’s conjecture is now known to be correct, this procedure can be given the direct “semantic tableau” form. A version of this procedure is presented, based on SchUtte’s but exploiting Hilbert’s epsilon operator.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.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

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. L. Henkin, Completeness in the theory of types, J. Symbolic Logic 15 (1950) 81.

    Article  MATH  MathSciNet  Google Scholar 

  2. D. Prawitz, An improved proof procedure, Theoria 26 (1960) 102.

    Article  MATH  MathSciNet  Google Scholar 

  3. B. Russell, Mathematical logic as based on the theory of types, Am. J. Math. 30 (1908) 222.

    Article  MATH  Google Scholar 

  4. K. Schlitte, Syntactical and semantical properties of simple type theory, J.Symbolic Logic 25 (1960) 305.

    Article  MathSciNet  Google Scholar 

  5. G. Takeuti, On a generalized logic calculus, Jap. J. Math. 23 (1953) 39.

    MATH  MathSciNet  Google Scholar 

  6. D. Prawitz, Completeness and Hauptsatz for second-order logic, Theoria 33 (1967) 246.

    Article  MATH  MathSciNet  Google Scholar 

  7. W. E. Gould, A matching procedure for to-order logic, AFCRL Report, No. 66–781 (1966).

    Google Scholar 

  8. K. Gödel, On the length of proofs (English translation), in: The Undecidable, ed. M. Davis ( Raven Press, Hewlett, N.Y., 1965 ).

    Google Scholar 

  9. L. Henkin, Banishing the rule of substitution for functional variables, J. Symb. Logic 18 (1953) 201.

    Article  MATH  MathSciNet  Google Scholar 

  10. W. V. O. Quine, Set theory and its logic (Harvard University Press, Cambridge, Massachusetts, 1963 ) p. 257.

    MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Robinson, J.A. (1983). New Directions in Mechanical Theorem Proving. In: Siekmann, J.H., Wrightson, G. (eds) Automation of Reasoning. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-81955-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-81955-1_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-81957-5

  • Online ISBN: 978-3-642-81955-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics