Definability in Dynamic Logic

9Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

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ω1,ω,, but regular Dynamic Logic is strictly less expressive. In particular, the ordinals ωω and ωω.2 are indistinguishable by formulas of regular Dynamic Logic.

Cited by Powered by Scopus

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

340Citations
N/AReaders
Get full text

Process logic: Expressiveness, decidability, completeness

99Citations
N/AReaders
Get full text

Process logic: Expressiveness, decidability, completeness

28Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

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

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 8

62%

Professor / Associate Prof. 2

15%

Researcher 2

15%

Lecturer / Post doc 1

8%

Readers' Discipline

Tooltip

Computer Science 13

87%

Agricultural and Biological Sciences 1

7%

Physics and Astronomy 1

7%

Save time finding and organizing research with Mendeley

Sign up for free