Monotonicity in Calculational Proofs

Authors:
David Gries
Affiliations:
-
Venue:
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Year:
1999

Citing 2
Cited 2

Predicate calculus and program semantics

Predicate calculus and program semantics
A logical approach to discrete math

A logical approach to discrete math

An ontological approach to focusing attention and enhancing machine perception on the Web

Applied Ontology
An ontological approach to focusing attention and enhancing machine perception on the Web

Applied Ontology

Quantified Score

Hi-index	0.00

Visualization

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.