Tableau-based theorem proving and synthesis of λ-terms in the intuitionistic logic

  • Oliver Bittel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 633)


Because of its constructive aspect, the intuitionistic logic plays an important role in the context of the programming paradigm ”programming by proving”. Programs are expressed by λ-terms which can be seen as compact representations of natural deduction proofs. We are presenting a tableau calculus for the first-order intuitionistic logic which allows to synthesize λ-terms. The calculus is obtained from the tableau calculus for the classical logic by extending its rules by λ-terms. In each rule application and closing of tableau branches, λ-terms are synthesized by unification. Particularly, a new λ-term construct (implicit case analysis) is introduced for the the disjunction rules.

In contrary to existing approachs based on the natural deduction calculus, our calculus is very appropriate for automatic reasoning. We implemented the calculus in Prolog. A strategy which is similar to model elimination has been built in. Several formulas (including program synthesis problems) have been proven automatically.

Key words

Intuitionistic Logic Automatic Theorem Proving Program Synthesis Typed λ-Calculus 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [And80]
    Andrews, P. B., Transforming Matings into Natural Deduction Proofs, 5. CADE, LNCS 87, 1980.Google Scholar
  2. [Bit91]
    Bittel, O., Ein tableaubasierter Theorembeweiser für die intuitionistische Logik, Ph.D. thesis, GMD-Report 198, Oldenbourg-Verlag, 1991.Google Scholar
  3. [BSH90]
    Bundy, A., Smaill, A. Hesketh, J., Turning Eureka Steps into Calculations in Automatic Programm Syntesis, in Proceedings of the First Workshop on Logical Frameworks, Antibes, 1990.Google Scholar
  4. [Con86]
    Constable, R. L. et al., Implementing Mathematics with the Nuprl Proof Development System, Prentice-Hall, 1986.Google Scholar
  5. [Coq90]
    Coquand, T., On the Analogy Between Propositions and Types, in Logical Foundations of Functional Programming, G. Huet (ed.), Addison-Wesley, 1990.Google Scholar
  6. [Fit83]
    Fitting, M., Proof Methods for Modal and Intuitionistic Logics, Holland, 1983.Google Scholar
  7. [Fit90]
    Fitting, M., First-Order Logic and Automated Theorem Proving, Springer-Verlag, 1990.Google Scholar
  8. [Gen35]
    Gentzen, G., Untersuchungen über das logische Schlie”sen, Mathematische Zeitschrift, 39:176–210, 405–431, 1935.CrossRefMathSciNetGoogle Scholar
  9. [Gir89]
    Girard, J.-Y., Lafont, Y., Taylor, P., Proofs and Types, Cambridge Tracts in Theoretical Computer Science 7, 1989.Google Scholar
  10. [How80]
    Howard, W. A., The Formulae as Types Notion of Construction, in H. B. Curry — essays on Combinatory Logic, λ-calculus and Formalism, Seldin/Hindley (Eds.), 579–606, Academic Press, 1980.Google Scholar
  11. [Lin89]
    Lingenfelder, C., Structuring Computer Generated Proofs, IJCAI, 1989.Google Scholar
  12. [Mar82]
    Martin-Löf, P., Constructive Mathematics and Computer Programming, in I. J. Cohen, J. Los, H. Pfeiffer and K. D. Podewski (Eds.), Logic, Methodology and Phylosophy of Science VI, 153–179, North-Holland, 1982.Google Scholar
  13. [MaWa80]
    Manna, Z., Waldinger, R., A Deductive Approach to Program Synthesis, ACM TOPLAS Vol. 2, No. 1, 90–121, 1980.CrossRefGoogle Scholar
  14. [Mil84]
    Miller, D. A., Expansion Tree Proofs and their Conversion to Natural Deduction Proofs, 7. CADE, LNCS 170, 1984Google Scholar
  15. [Ohl88]
    Ohlbach, H. J., A Resolution Calculus for Modal Logics, 9. CADE, LNCS 310, 1988.Google Scholar
  16. [OpSu88]
    Oppacher, F., Suen, E., HARP: A Tableau-Based Theorem Prover, Journal of Automated Reasoning, Vol. 4, 69–100, 1988.CrossRefGoogle Scholar
  17. [Pra65]
    Prawitz, D., Natural Deduction, Almquist & Wiksell, Stockholm, 1965.Google Scholar
  18. [Sch85]
    Schönfeld, W., Prolog Extensions Based on Tableau Calculus, IJCAI, 1985.Google Scholar
  19. [Wal88]
    Wallen, L. A., Matrix Proof Methods for Modal Logics, IJCAI, 1988.Google Scholar
  20. [Wos90]
    Wos, L., The Problem of Finding a Mapping between Clause Representation and Natural-Deduction Representation, Journal of Automated Reasoning 6, 211–212, 1990.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Oliver Bittel
    • 1
  1. 1.Fachhochschule KonstanzKonstanzGermany

Personalised recommendations