Abstract
We present a proof method for intuitionistic logic based on Wallen's matrix characterization. Our approach combines the connection calculus and the sequent calculus. The search technique is based on notions of paths and connections and thus avoids redundancies in the search space. During the proof search the computed first-order and intuitionistic substitutions are used to simultaneously construct a sequent proof which is more human oriented than the matrix proof. This allows to use our method within interactive proof environments. Furthermore we can consider local substitutions instead of global ones and treat substitutions occurring in different branches of the sequent proof independently. This reduces the number of extra copies of formulae to be considered.
Chapter PDF
References
E. W. Beth. The foundations of mathematics. North-Holland, 1959.
W. Bibel, S. Brüning, U. Egly, T. Rath. Komet. In Proceedings of the 12 th CADE, LNAI 814, p. 783–787. Springer Verlag, 1994.
W. Bibel. On matrices with connections. Jour, of the ACM, 28, p. 633–645, 1981.
W. Bibel. Automated Theorem Proving. Vieweg Verlag, 1987.
K. Bläsius, N. Eisinger, J. Siekmann, G. Smolka, A. Herold, C. Walther. The Markgraf Karl refutation procedure. In IJCAI-81, p. 511–518, 1981.
R. L. Constable et. al. Implementing Mathematics with the NuPRL proof development system. Prentice Hall, 1986.
M. C. Fitting. Intuitionistic logic, model theory and forcing. Studies in logic and the foundations of mathematics. North-Holland, 1969.
J. Gallier. Constructive logics. Part I: A tutorial on proof systems and typed λ-calculi. Technical Report 8, Digital Equipment Corporation, 1991.
G. Gentzen. Untersuchungen über das logische Schließen. Mathematische Zeitschrift, 39:176–210, 405–431, 1935.
K. Gödel. An interpretation of the intuitionistic sentential logic. In The Philosophy of Mathematics, p. 128–129. Oxford University Press, 1969.
D. S. Korn. KonSequenz — Ein Konnektionsmethoden-gesteuertes Sequenzenbeweis-Verfahren. Master's thesis, TH Darmstadt, FG Intellektik, 1993.
R. Letz, J. Schumann, S. Bayerl, W. Bibel. Setheo: A high-performance theorem prover. Journal of Automated Reasoning, 8:183–212, 1992.
H. J. Ohlbach. A resolution calculus for modal logics. Ph.D. Thesis (SEKI Report SR-88-08), FB Informatik, Universität Kaiserslautern, 1988.
J. Otten. Ein konnektionenorientiertes Beweisverfahren für intuitionistische Logik. Master's thesis, TH Darmstadt, FG Intellektik, 1995.
S. Schmitt, C. Kreitz. On transforming intuitionistic matrix proofs into standard-sequent proofs. In Proceedings Tableaux Workshop 1995, this volume.
R. M. Smullyan. First-Order Logic, Ergebnisse der Mathematik 43. 1968.
L. Wallen. Matrix proof methods for modal logics. IJCAI-87, p. 917–923. 1987.
L. Wallen. Automated deduction in nonclassical logic. MIT Press, 1990.
L. Wos et. al. Automated reasoning contributes to mathematics and logic. In Proceedings of the 10 th CADE, LNCS 449, p. 485–499. Springer Verlag 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Otten, J., Kreitz, C. (1995). A connection based proof method for intuitionistic logic. In: Baumgartner, P., Hähnle, R., Possega, J. (eds) Theorem Proving with Analytic Tableaux and Related Methods. TABLEAUX 1995. Lecture Notes in Computer Science, vol 918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59338-1_32
Download citation
DOI: https://doi.org/10.1007/3-540-59338-1_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59338-6
Online ISBN: 978-3-540-49235-1
eBook Packages: Springer Book Archive