Skip to main content
Log in

Mechanical procedure for proof construction via closed terms in typed λ calculus

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

In this paper is presented an algorithm for constructing natural deduction proofs in the propositional intuitionistic and classical logics according to the analogy relating intuitionistic propositional formulas and natural deduction proofs, respectively, to types and terms of simple type theory. Proofs are constructed as closed terms in the simple typed λ calculus. The soundness and completeness of this method are proved.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Berendregt, H. P., The Lambda Calculus, Studies in Logic and the Foundations of Mathematics, North-Holland (1981).

  2. Church, A. ‘A formulation of the simple theory of types’, Journal of Symbolic Logic 5(1), 56–68 (1940).

    Google Scholar 

  3. Church, A., ‘The Calculi of Lambda-Conversion’, Princeton University Press, Princeton, N.J., (1941).

    Google Scholar 

  4. Coguand, T., Huet, G., ‘A Theory of Constructions’, Eurocal 85, Linz, Austria (1985).

  5. Curry, H. B., Feys, R., Combinatory logic, Vol. 1 North-Holland, Amsterdam (1968).

    Google Scholar 

  6. Friedman, H., ‘Equality between functionals’, Lecture Notes in Mathematics Vol. 453, 22–37 (1975).

    Google Scholar 

  7. Howard, W., ‘The formula-as-types notion of construction’, in: Hindley and Seldin (eds): To H. B. Curry: Essays on Combinatory Logic Lambda-Calculus and Formalism, Academic Press 479–490 (1980).

  8. Huet, G., ‘A unification algorithm for typed λ-calculus’, Theoretical Computer Science 1, 27–58 (1975).

    Google Scholar 

  9. Martin-Lof, P., Intuitionistic Type Theory, Studies in Proof Theory, Bibliopolis (1984).

  10. Prawitz, D., Natural deduction Almqist and Wiksell, Stokholm, (1965).

    Google Scholar 

  11. Statman, R., ‘Intuitionistic propositional logic is polynomial-space complete’ Theoretical Computer Science 9, 67–72 (1979).

    Google Scholar 

  12. Statman, R. ‘On the existence of closed terms in the typed λ calculus I’, in: Hindley and Seldin (eds): To H. B. Curry: Essays on Combinatory Logic Lambda-Calculus and Formalism, Academic Press 511–534 (1980).

  13. Statman, R., ‘On the existence of closed terms in the typed λ calculus II: Transformations of unification problems’, Theoretical Computer Science 15, 329–338 (1981).

    Google Scholar 

  14. Tait, W., ‘Infinitely long terms of transfinite type’, in: Crossley and Dummett (eds) Formal Systems and Recursive Functions, Proc. 8th Logic Colloquium, Oxford, 176–185 (1983).

  15. Zaionc, M., ‘The set of unifiers in typed λ calculus as regular expression’, in Rewriting Techniques and Applications, Ed J-P Jouannaud, Springer-Verlag, Lecture Notes in Computer Science 202, 430–440 (1985).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zaionc, M. Mechanical procedure for proof construction via closed terms in typed λ calculus. J Autom Reasoning 4, 173–190 (1988). https://doi.org/10.1007/BF00244393

Download citation

  • Received:

  • Issue Date:

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

Key words

Navigation