Logic in Computer Science, Symposium on (1995)
San Diego, California
June 26, 1995 to June 29, 1995
Igor Walukiewicz , BRICS, Department of Computer Science University of Aarhus
We consider the propositional \m-calculus as introduced by Kozen [TCS 27]. In that paper a natural proof system was proposed and its completeness stated as an open problem. We show that the system is complete.
Mu-calculus, completeness, modal logics, fixpoint operators
I. Walukiewicz, "Completeness of Kozen's Axiomatisation of the Propositional Mu-Calculus," Logic in Computer Science, Symposium on(LICS), San Diego, California, 1995, pp. 14.