Arrow Research search
Back to STOC

STOC 1980

Definability in Dynamic Logic

Conference Paper Accepted Paper Algorithms and Complexity · Theoretical Computer Science

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

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
974112977461662038
v2026.09.13