scientific article; zbMATH DE number 3902002
[For the entire collection see Zbl 0562.00009.] We show that any predicate transformer is rendered (semantically) by a first-order theory, provided it is propositionally closed, i.e. closed under the rules of Consequence, Conjunction and Disjunction. It follows that fundamental results in the metamathematics of first-order theories can be applied to propositionally closed predicate transformers, and therefore also to partial-correctness theories of programs. In particular, any such theory is complete for the Hoare semantics it induces, by Gödel's Strong Completeness Theorem. From this it also follows that a predicate transformer is a partial-correctness theory of some I/O relation iff it is propositionally closed.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680246)