Advertisement

Monotonicity in Calculational Proofs

  • David Gries
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1710)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Edsger W. Dijkstra and Carel S. Scholten. Predicate Calculus and Program Semantics. Springer Verlag, New York, 1990.zbMATHGoogle Scholar
  2. 2.
    Wim H.J. Feijen.∃∀⇒;∀∃.WHJ189, September 1994.Google Scholar
  3. 3.
    David Gries and Fred B. Schneider.A Logical Approach to Discrete Math. Springer Verlag, New York 1993.zbMATHGoogle Scholar
  4. 4.
    Carroll Morgan. Email communications in September 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • David Gries
    • 1
  1. 1.Computer ScienceUniversity of GeorgiaUSA

Personalised recommendations