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ω1,ω,, but regular Dynamic Logic is strictly less expressive. In particular, the ordinals ωω and ωω.2 are indistinguishable by formulas of regular Dynamic Logic.
CITATION STYLE
Meyer, A. R., & Parikh, R. (1980). Definability in Dynamic Logic. In Proceedings of the Annual ACM Symposium on Theory of Computing (Vol. 1980-April, pp. 1–7). Association for Computing Machinery. https://doi.org/10.1145/800141.804646
Mendeley helps you to discover research relevant for your work.