Abstract
For the past 20 years, researchers in the formal development of algorithms —programming methodology—have been developing a calculational approach to logic, in which a calculational format using substitution of equals for equals, weakening, and strengthening are the major tools. This work is giving us a perspective on logic that is different from that of others: for us, logic is a tool instead of just an area of academic study. These lectures summarize our present understanding of this calculational logic. Covered are: propositional logic, predicate logic, treating undefined terms, the use of weakening or strengthening steps, a useful theorem on monotonicity, metatheorem Witness, and the everywhere operator. Some interesting proofs are developed.
1This work was supported by the NSF under grants CDA-9406743 and CCR-9503319.
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.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gries, D. (1997). Foundations for Calculational Logic. In: Broy, M., Schieder, B. (eds) Mathematical Methods in Program Development. NATO ASI Series, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60858-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-60858-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64588-4
Online ISBN: 978-3-642-60858-2
eBook Packages: Springer Book Archive