Abstract
We describe a calculus for proofs of conditional theorems over algebraic specifications. The main principle used in these proofs is “natural” induction over the structure of terms. Hereby we have to deal with conditional induction hypotheses. The correctness of our calculus can be proved by use of the Natural Deduction Calculus. (This proof is omitted in this short version.)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R.S. Boyer, J.S. Moore: A Computational Logic. Academic Press, 1979.
N. Dcrshowitz: Termination of Rewriting. Journal of symbolic Compulation 3, 1987.
D. Duffy: Principles of Automated Theorem Proving. Wiley, 1991.
U. Fraus, H. Hußmann: A Narrowing-Based Theorem Prover. Proceedings of the IMA Conference, July 1990, University of Stirling, Oxford University Press, 1992.
M. Wirsing, e.a.: On hierarchies of abstract data types. Acta Informatica 20, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fraus, U. (1993). A calculus for conditional inductive theorem proving. In: Rusinowitch, M., Rémy, JL. (eds) Conditional Term Rewriting Systems. CTRS 1992. Lecture Notes in Computer Science, vol 656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56393-8_27
Download citation
DOI: https://doi.org/10.1007/3-540-56393-8_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56393-8
Online ISBN: 978-3-540-47549-1
eBook Packages: Springer Book Archive