Advertisement

A resolution theorem prover for intuitionistic logic

  • Tanel Tammet
Session 1A
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1104)

Abstract

We use the general scheme of building resolution calculi (also called the inverse method) originating from S.Maslov and G.Mints to design and implement a resolution theorem prover for intuitionistic logic. A number of search strategies are introduced and proved complete. The resolution method is shown to be a decision procedure for a new syntactically described decidable class of intuitionistic logic. The performance of our prover is compared with the performance of a tableau prover for intuitionistic logic presented in [12], using both the benchmarks from the latter and the theorems from J. von Plato-s constructive geometry [9].

Keywords

Intuitionistic Logic Resolution Method Sequent Calculus Decidable Class Proof Search 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beeson, M.J., Some applications of Gentzen's proof theory in automated deduction. Manuscript, 1988.Google Scholar
  2. 2.
    Chang, C.L., Lee, R.C.T. Symbolic Logic and Mechanical Theorem Proving. Academic Press, (1973).Google Scholar
  3. 3.
    Dyckoff, R. Contraction-free sequent calculi for intuitionistic logic. Journal of Symbolic Logic, 57(3), 795–807 (1992).Google Scholar
  4. 4.
    Fermüller, C., Leitsch, A., Tammet, T., Zamov, N. Resolution methods for decision problems. LNCS 679, Springer Verlag, (1993).Google Scholar
  5. 5.
    Fitting, M. Resolution for Intuitionistic Logic. Paper presented at ISMIS '87, Charlotte, NC. 1987.Google Scholar
  6. 6.
    S.Ju.Maslov An inverse method of establishing deducibility in the classical predicate calculus. Dokl. Akad. Nauk. SSSR 159 (1964) 17–20=Soviet Math. Dokl. 5 (1964) 1420, MR 30 #3005.Google Scholar
  7. 7.
    G.Mints. Gentzen-type Systems and Resolution Rules. Part I. Propositional Logic. In COLOG-88, pages 198–231, LNCS 417, Springer-Verlag, 1990.Google Scholar
  8. 8.
    G.Mints. Resolution Strategies for the Intuitionistic Logic. In Constraint Programming, NATO ASI Series F, v. 131, pp. 289–311, Springer Verlag, (1994).Google Scholar
  9. 9.
    J. von Plato. The Axioms of Constructive Geometry. Annals of Pure and Applied Logic 76(2), 169–200 (1995).CrossRefGoogle Scholar
  10. 10.
    Pym, D.J., Wallen, L.A. Investigations into proof-search in a system of first-order dependent function types. In CADE-10, pages 236–250, Springer Verlag 1990.Google Scholar
  11. 11.
    J.A. Robinson. A Machine-oriented Logic Based on the Resolution Principle. Journal of the ACM 12, 23–41 (1965).CrossRefGoogle Scholar
  12. 12.
    D.Sahlin, T.Franzen, S.Haridi. An Intuitionistic Predicate Logic Theorem Prover. Journal of Logic and Computation, 2(5), 619–656 (1992).Google Scholar
  13. 13.
    N.Shankar. Proof Search in the Intuitionistic Sequent Calculus. In CADE-11, pages 522–536, LNCS 607, Springer Verlag, (1992).Google Scholar
  14. 14.
    T.Tammet. Proof Strategies in Linear Logic. Journal of Automated Reasoning 12(3), 273–304 (1994).CrossRefGoogle Scholar
  15. 15.
    Tammet, T., Smith, J. Optimised Encodings of Fragments of Type Theory in First Order Logic. In Proceedings of the CADE-12 workshop on proof search in type-theoretic languages, Nancy 1994, 87–93.Google Scholar
  16. 16.
    Voronkov, A. Theorem proving in non-standard logics based on the inverse method. In CADE-11, pages 648–662, LNCS 607, Springer Verlag, (1992).Google Scholar
  17. 17.
    Volozh, B., Matskin, M., Mints, G., Tyugu, E. PRIZ system and the Propositional Calculus. Kibernetika and Software 6, (1983).Google Scholar
  18. 18.
    Wallen, L.A. Automated Proof Search in Non-Classical Logics. MIT Press, (1990).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Tanel Tammet
    • 1
  1. 1.Department of Computer SciencesUniversity of Göteborg and Chalmers University of TechnologyGöteborgSweden

Personalised recommendations