Abstract
In this paper, we present a new heuristic proving method for predicate logic, called the PCS method since it proceeds by cycling through various phases of proving (i.e. applying generic inference rules), computing (i.e. simplifying formulae), and solving (i.e. finding witness terms). Although not a complete proving calculus, it does produce very natural proofs for many propositions in elementary analysis like the limit theorems. Thus it appears to be a valuable contribution for many of the routine proofs encountered in exploring mathematical theorems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Buchberger. Theory Exploration with Theorema. In: Proc. of the 2nd International Workshop on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2000), Dept. of Computer Science, Univ. of West Timisoara, Romania, Oct. 4˘6, 2000, pp. 1–16.
B. Buchberger, T. Jebelean, F. Kriftner, M. Marin, D. Vasaru. An Overview on the Theorema project. In: Proc. of the International Symposium on Symbolic and Algebraic Computation (ISSAC 97), Maui, Hawaii, July 21–23, 1997, W. Kuechlin (ed.), ACM Press 1997, pp. 384–391.
B. Buchberger, C. Dupre, T. Jebelean, F. Kriftner, K. Nakagawa, D. Vasaru, W. Windsteiger. The Theorema Project: A Progress Report. In: Proc. of the 8th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning (Calculemus 2000), St. Andrews, Scotland, August 6?7, M. Kerber and M. Kohlhase (eds.), available from: Fachbereich Informatik, Universität des Saarlandes, pp. 100–115.
G. E. Collins. Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition. In: Second GI Conference on Automata Theory and Formal Languages, LNCS 33, pages 134–183, Springer Verlag, Berlin, 1975. Reprinted in [5], pp. 85–121.
B. F. Caviness, J. R. Johnson (eds.). Quantifier Elimination and Cylindrical Algebraic Decomposition, Texts and Monographs in Symbolic Computation of the Research Institute for Symbolic Computation (B. Buchberger, G.E. Collins, eds.), Springer, Wien˘New York, 431 pages.
D. Vasaru˘Dupre. Automated Theorem Proving by Integrating Proving, Solving and Computing, PhD Thesis, April 2000, Research Institute for Symbolic Compuationat (RISC), Johannes Kepler University Linz, A˘4232 Castle of Hagenberg, Austria.
W. Windsteiger. A Set Theory Prover in Theorema: Implementation and Practical Applications, PhD Thesis, May 2001, Research Institute for Symbolic Compuationat (RISC), Johannes Kepler University Linz, A˘4232 Castle of Hagenberg, Austria.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buchberger, B. (2001). The PCS Prover in TH∃OREM∀. In: Moreno-Díaz, R., Buchberger, B., Luis Freire, J. (eds) Computer Aided Systems Theory — EUROCAST 2001. EUROCAST 2001. Lecture Notes in Computer Science, vol 2178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45654-6_37
Download citation
DOI: https://doi.org/10.1007/3-540-45654-6_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42959-3
Online ISBN: 978-3-540-45654-4
eBook Packages: Springer Book Archive