Inductive Completeness of Logics of Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Completeness of Dynamic Logic
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
The Complete Proof Theory of Hybrid Systems
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Logical analysis of hybrid systems: a complete answer to a complexity challenge
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
| Hi-index | 0.00 |
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 firstorder dynamic logic DL proves precisely program properties that are provable in second-order logic with set-existence restricted to a natural class of formulas, well-known to be related to computation theory