The Community for Technology Leaders
Logic in Computer Science, Symposium on (1995)
San Diego, California
June 26, 1995 to June 29, 1995
ISSN: 1043-6871
ISBN: 0-8186-7050-6
pp: 14
Igor Walukiewicz , BRICS, Department of Computer Science University of Aarhus
ABSTRACT
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.
INDEX TERMS
Mu-calculus, completeness, modal logics, fixpoint operators
CITATION

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.
doi:10.1109/LICS.1995.523240
95 ms
(Ver 3.3 (11022016))