A New Incompleteness Result for Hoare's System

A structure A is presented for which Hoare's formal system for partial correctness is incomplete, even if the entire first-order theory of A is included among the axioms. It follows that the language of first-order logic is insufficient to express all loop invariants. The implications of this result for program-proving are discussed. 

1 Figure or Table

Topics

Statistics

0246'77'80'84'88'92'96'00'04'08'12'16
Citations per Year

51 Citations

Semantic Scholar estimates that this publication has 51 citations based on the available data.

See our FAQ for additional information.