Now showing items 1-1 of 1

    • Hoare's Logic Is Not Complete When It Could Be 

      Bergstra, J.; Chielinksa, A.; Tiuryn, J. (1982-08)
      It is known (cf.[2]) that is the Hoare rules are complete for a first-order structure A, then the set of partial correctness assertions true over A is recursive in the first-order theory of A. We show that the converse is ...