Abstract
We discuss the use of weakening and strengthening steps in calculational proofs. We present a metatheorem concerning monotonicity of positions in a formula that should have a more prominent place in the teaching of such proofs and give supporting examples.
Acknowledgements
Thanks to an anonymous referee, who helped improve this presentation.
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
Edsger W. Dijkstra and Carel S. Scholten. Predicate Calculus and Program Semantics. Springer Verlag, New York, 1990.
Wim H.J. Feijen.∃∀⇒;∀∃.WHJ189, September 1994.
David Gries and Fred B. Schneider.A Logical Approach to Discrete Math. Springer Verlag, New York 1993.
Carroll Morgan. Email communications in September 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gries, D. (1999). Monotonicity in Calculational Proofs. In: Olderog, ER., Steffen, B. (eds) Correct System Design. Lecture Notes in Computer Science, vol 1710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48092-7_4
Download citation
DOI: https://doi.org/10.1007/3-540-48092-7_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66624-0
Online ISBN: 978-3-540-48092-1
eBook Packages: Springer Book Archive