Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic

  • Daniel Leivant
  • Published 2006 in
    21st Annual IEEE Symposium on Logic in Computer…


We establish a match between two broad approaches to reasoning about programs: modal (dynamic logic) proofs on the one hand, and explicit higher-order reference to program semantics, on the other. We show that Pratt-Segerberg's first-order dynamic logic DL proves precisely program properties that are provable in second-order logic with set-existence… (More)
DOI: 10.1109/LICS.2006.33


2 Figures and Tables