Definability in Dynamic Logic

Authors:
Albert R. Meyer;Rohit Parikh
Affiliations:
-;-
Venue:
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Year:
1980

Citing 3
Cited 1

Nondeterminism in logics of programs

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
First-Order Dynamic Logic

First-Order Dynamic Logic
On the expressive power of Dynamic Logic (Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing

Ten Years of Hoare's Logic: A Survey—Part I

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the expressive power of various versions of Dynamic Logic and compare them with each other as well as with standard languages in the logical literature. One version of Dynamic Logic is equivalent to the infinitary logic LCK&ohgr;1&ohgr;, but regular Dynamic Logic is strictly less expressive. In particular, the ordinals &ohgr;&ohgr; and &ohgr; &ohgr;.2 are indistinguishable by formulas of regular Dynamic Logic.