an:03880653
Zbl 0553.03007
Kozen, Dexter
Results on the propositional \(\mu\)-calculus
EN
Theor. Comput. Sci. 27, 333-354 (1983).
00148578
1983
j
03B45 68Q65
fixed point induction; completeness; propositional mu-calculus; propositional modal logic; decision procedure; small model property; PDL
In this paper we define and study a propositional \(\mu\)-calculus \(L\mu\), which consists essentially of propositional modal logic with a least fixpoint operator. \(L\mu\) 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, thereby subsuming the corresponding results for PDL.
Zbl 0507.03005