Results on the propositional μ-calculus

https://doi.org/10.1016/0304-3975(82)90125-6Get rights and content
Under an Elsevier user license
open archive

Abstract

In this paper we define and study a propositional μ-calculus Lμ, which consists essentially of propositional modal logic with a least fixpoint operator. Lμ is syntactically simpler yet strictly more expressive than Propositional Dynamic Logic (PDL). For a restricted version we give an exponential-time decision procedure, small model property, and complete deductive system, theory subsuming the corresponding results for PDL.

Cited by (0)

These results were obtained during the author's sabbatical at the University of Aarhus, Denmark.