No label defined (Q3680246)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3902002
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3902002

      Statements

      0 references
      1985
      0 references
      predicate transformer
      0 references
      first-order theory
      0 references
      propositionally closed predicate transformers
      0 references
      partial-correctness theories of programs
      0 references
      Hoare semantics
      0 references
      Strong Completeness Theorem
      0 references
      [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.
      0 references

      Identifiers