On the expressive power of Dynamic Logic (Preliminary Report)

Authors:
Albert R. Meyer;Karl Winklmann
Affiliations:
-;-
Venue:
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Year:
1979

Citing 1
Cited 5

Nondeterminism in logics of programs

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

Axiomatic Definitions of Programming Languages: A Theoretical Assessment

Journal of the ACM (JACM)
Axiomatic definitions of programming languages, II

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Propositional Dynamic Logic of looping and converse

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Definability in Dynamic Logic

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that “looping” of while-programs can be expressed in Regular First-Order Dynamic Logic, disproving a conjecture made in [Harel-Pratt 1978]. In addition we show that the expressive power of quantifier-free Dynamic Logic increases when nondeterminism is introduced in the programs that are part of formulae of Dynamic Logic. Allowing assignments of random values to variables increases the expressive power even further.