On static logics, dynamic logics, and complexity classes

D. Harel, D. Peleg

Research output: Contribution to journalArticlepeer-review

25 Scopus citations

Abstract

Several versions of quantified dynamic logic are shown to be equivalent in expressive power to "static" extensions of classical logics. Consequently, by recent results of various researchers, many connections between dynamic logics and complexity classes are obtained. Among other things, a sequence of dynamic logics of increasing expressive power, which correspond, over appropriate finite structures, to LOGSPACE, PTIME, and PSPACE, as well as to the sets definable in the logarithmic-space, polynomial-time, and arithmetical hierarchies is exhibited.

Original languageEnglish
Pages (from-to)86-102
Number of pages17
JournalInformation and control
Volume60
Issue number1-3
DOIs
StatePublished - 1984
Externally publishedYes

Fingerprint

Dive into the research topics of 'On static logics, dynamic logics, and complexity classes'. Together they form a unique fingerprint.

Cite this