Abstract
All redundancies are removed from derivations in a Gentzen-like formal system of first-order logic. The resulting skeleton derivations are characterized in terms of the formulas to be derived. This provides the formal basis for a powerful proof procedure developed earlier by the author.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P.B. Andrews, Refutations by matings, IEEE Transactions on Computer C-25 (1976) 801–807.
P.B. Andrews, Theorem Proving via General Matings, Journal of the ACM (to appear).
W. Bibel, An approach to a systematic theorem proving procedure in first-order logic, Computing 12 (1974) 43–55.
W. Bibel, Maschinelles Beweisen, Jahrbuch Überblicke Mathematik (Bibliographisches Institut, Mannheim, 1976) 115–142.
W. Bibel, Tautology testing with a generalized matrix reduction method, Theoretical Computer Science 8 (1979), 31–44.
W. Bibel, On matrices with connections, Bericht 79, Universität Karlsruhe (1979), submitted to JACM.
W. Bibel, A comparative study of several proof procedures, Proc. AISB-80 (1980).
W. Bibel, Syntax-directed, semantics-supported program synthesis, Artificial Intelligence Journal (to appear).
W. Bibel and J. Schreiber, Proof search in a Gentzen-like system of first-order logic, Proc. Int. Computing Symposium (North-Holland, Amsterdam, 1975) 205–212. Also contained in: W. Bibel, Programmieren in der Sprache der Prädikatenlogik, Habilitationsarbeit (abgelehnt), Technische Universität München (1975).
W.W. Bledsoe, Non-resolution theorem proving, Artificial Intelligence 9 (1977) 1–35.
J. Friedrich, Ein systematischer Algorithmus zum Beweisen von Theoremen in einem Prädikatenkalkül erster Ordnung, Diplomarbeit, Techn. Univ. München (1973).
G. Gentzen, Untersuchungen über das logische Schließen I, Mathemat. Zeitschrift 39, (1935) 176–210.
C.A. Goad, Proofs as descriptions of programs, Proc. CADE-5, Springer (to appear).
J. Herbrand, Recherches sur la Theorie de la Demonstration, Travaux de la Societe des Sciences et des Lettres de Varsovie, Classe III sciences mathematiques et physiques, 33 (1930).
G. Huet, Résolution d'équations dans des languages d'ordres 1,2,...,ω, Thèse de doctorat d'état, Université Paris VII (1976).
G. Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems, Rapport Laboria no 250, IRIA-LABORIA, Domaine de Voluceau, 78150 Le Chesnay, France (1977).
R. Kowalski, Algorithm = logic + control, Comm. of the ACM 22 (1979) 424–436.
Z. Manna, R. Waldinger, A deductive approach to program synthesis, Proc. IJCAI-79 (1979) 542–551.
S.J. Maslow, The inverse method for establishing deducibility for logical calculi, Proc. Steklov Inst. Math. 98 (1968).
D. Prawitz, An improved proof procedure, Theoria 26 (1960) 102–139.
J.A. Robinson, Logic: form and function, Edinburgh University Press (1979).
M. Sato, Towards a mathematical theory of program synthesis, Proc. IJCAI-79 (1979) 757–762.
J. Schreiber, Vergleichende qualitative und quantitative Untersuchungen von Beweisverfahren, Bericht Nr. 7411, Technische Universität München (1974).
K. Schütte, Proof theory, Springer Verlag (Berlin, 1977).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bibel, W. (1980). A theoretical basis for the systematic proof method. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022502
Download citation
DOI: https://doi.org/10.1007/BFb0022502
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10027-0
Online ISBN: 978-3-540-38194-5
eBook Packages: Springer Book Archive