Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
Andrews, P. B., Transforming Matings into Natural Deduction Proofs, 5. CADE, LNCS 87, 1980.
Bittel, O., Ein tableaubasierter Theorembeweiser für die intuitionistische Logik, Ph.D. thesis, GMD-Report 198, Oldenbourg-Verlag, 1991.
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.
Constable, R. L. et al., Implementing Mathematics with the Nuprl Proof Development System, Prentice-Hall, 1986.
Coquand, T., On the Analogy Between Propositions and Types, in Logical Foundations of Functional Programming, G. Huet (ed.), Addison-Wesley, 1990.
Fitting, M., Proof Methods for Modal and Intuitionistic Logics, Holland, 1983.
Fitting, M., First-Order Logic and Automated Theorem Proving, Springer-Verlag, 1990.
Gentzen, G., Untersuchungen über das logische Schlie”sen, Mathematische Zeitschrift, 39:176–210, 405–431, 1935.
Girard, J.-Y., Lafont, Y., Taylor, P., Proofs and Types, Cambridge Tracts in Theoretical Computer Science 7, 1989.
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.
Lingenfelder, C., Structuring Computer Generated Proofs, IJCAI, 1989.
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.
Manna, Z., Waldinger, R., A Deductive Approach to Program Synthesis, ACM TOPLAS Vol. 2, No. 1, 90–121, 1980.
Miller, D. A., Expansion Tree Proofs and their Conversion to Natural Deduction Proofs, 7. CADE, LNCS 170, 1984
Ohlbach, H. J., A Resolution Calculus for Modal Logics, 9. CADE, LNCS 310, 1988.
Oppacher, F., Suen, E., HARP: A Tableau-Based Theorem Prover, Journal of Automated Reasoning, Vol. 4, 69–100, 1988.
Prawitz, D., Natural Deduction, Almquist & Wiksell, Stockholm, 1965.
Schönfeld, W., Prolog Extensions Based on Tableau Calculus, IJCAI, 1985.
Wallen, L. A., Matrix Proof Methods for Modal Logics, IJCAI, 1988.
Wos, L., The Problem of Finding a Mapping between Clause Representation and Natural-Deduction Representation, Journal of Automated Reasoning 6, 211–212, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bittel, O. (1992). Tableau-based theorem proving and synthesis of λ-terms in the intuitionistic logic. In: Pearce, D., Wagner, G. (eds) Logics in AI. JELIA 1992. Lecture Notes in Computer Science, vol 633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023433
Download citation
DOI: https://doi.org/10.1007/BFb0023433
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55887-3
Online ISBN: 978-3-540-47304-6
eBook Packages: Springer Book Archive