Abstract
A running system for combining theorem provers, editing and checking proofs in different logics is presented. It is based on a formalism similar to and developed from the Calculus of Constructions (Coquand and Huet).
Its abilities are independent of the logic and the calculus used. It is therefore possible to present and combine proofs coming from any theorem prover. The user may define the full graphic presentation of proofs, formulas,... he wishes.
Some other original features are: proofs can be viewed and browsed in different ways, (parts of) proofs can be memorized and reused, the size of inference steps for proof presentation can be fixed arbitrarily, symmetries can be handled in a natural manner, equational and non equational proofs are treated in an homogeneous way,...
The principles of the underlying formalism and the several languages used are given. The system has been implemented on Macintosh (and will soon be transported on SUN workstations).
The system should also allow an easy integration of theorem provers with symbolic computation systems.
Several running examples in classical and non-classical logics show evidence of the capabilities of the system. In particular, we present an OTTER [McC90] proof in which we handle symmetries in the proved theorem. Finally, the main lines of current and future work are given.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
[And91] P.B. Andrews: More on the problem of finding a mapping between clause representation and natural deduction representation, Journal of Automated Reasoning 7 (1991), pp. 285–286.
[AHMP92] A. Avron, F.A. Honsell, I.A. Mason, R. Pollack: Using typed lambda calculus to implement formal systems on a machine, Journal of Automated Reasoning 9 (1992), pp. 309–354.
[Avr91] A. Avron: Simple consequence relations, Information and Computation 92 (1991), pp. 105–139.
[BC87] T. Boy de la Tour, R. Caferra: Proof analogy in interactive theorem proving: a method to use and express it via second order pattern matching, Proc. AAAI-87, Morgan & Kaufmann 1987, pp. 95–99.
[CH88] T. Coquand, G. Huet: The calculus of constructions, Information and Computation 76 (1988), pp. 95–120.
[CH93] R. Caferra, M. Herment: GLEFATINF A graphic framework for combining provers and editing proofs for different logics, (long version). In preparation.
[Che76] D. Chester: The translation of formal proofs into English, Artificial Intelligence 7 (1976), pp. 261–278.
[CHZ91] R. Caferra, M. Herment, N. Zabel: User-oriented theorem proving with the ATINF graphic proof editor, Proc. FAIR'91, LNAI 535, Springer-Verlag 1991, pp. 2–10.
[CZ92] E. Clarke, X. Zhao: Analytica-An experiment in combinig theorem proving and symbolic computation, RR CMU-CS-92-117, September 1992.
[Dyb82] P. Dybjer: Mathematical proofs in natural language, Report 5, Programming Methodology Group, University of Goteborg, April 1982.
[HHP89] R. Harper, F. Honsell, G. Plotkin: A framework for defining logics, RR CMU-CS-89-173, Carnegie Mellon University, January 1989.
[Hua90] X. Huang: Reference choices in mathematical proofs, Proc. ECAI'90, Pitman 1990, pp. 720–725.
[Lin90] C. Lingenfelder: Transformation and structuring of computer generated proofs, SEKI Report SR-90-26, University of Kaiserslautern 1990.
[LP90] C. Lingenfelder, A. Präcklein: Presentation of proofs in equational calculus, SEKI Report SR-90-15 (SFB), University of Kaiserslautern 1990.
[McC90] W.W. McCune: OTTER 2.0 users guide, Technical Report ANL-90/9, Argonne National Laboratory, Illinois 1990.
[Mil84] D.A. Miller: Expansion tree proofs and their conversion to natural deduction, Proc. CADE-7, LNCS 170, Springer-Verlag 1984, pp. 375–393.
[Pau89] L.C. Paulson: The foundation of a generic theorem prover, Journal of Automated Reasoning 5 (1989), pp. 363–397.
[Qui87] V. Quint: Une approche de l'Edition Structurée des documents, Ph.D Thesis, Université Sc. Tech. et Méd. de Grenoble (1987).
[Wang93] D.M. Wang: An elimination method based on Seidenberg's theory and its applications in computational algebraic geometry In Progress in Mathematics 109, pp. 301–328, Birkhäuser, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caferra, R., Herment, M. (1993). GLEFATINF:A graphic framework for combining theorem provers and editing proofs for different logics. In: Miola, A. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1993. Lecture Notes in Computer Science, vol 722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013180
Download citation
DOI: https://doi.org/10.1007/BFb0013180
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57235-0
Online ISBN: 978-3-540-47985-7
eBook Packages: Springer Book Archive