Paper: Completeness of Kozen's Axiomatisation of the Propositional Mu-Calculus (at LICS 1995)
Winner of the Test-of-Time Award in 2015
Authors: Igor WalukiewiczAbstract
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.
BibTeX
@InProceedings{Walukiewicz-CompletenessofKozen, author = {Igor Walukiewicz}, title = {Completeness of Kozen's Axiomatisation of the Propositional Mu-Calculus}, booktitle = {Proceedings of the Tenth Annual IEEE Symposium on Logic in Computer Science (LICS 1995)}, year = {1995}, month = {June}, pages = {14--24}, location = {San Diego, CA, USA}, publisher = {IEEE Computer Society Press} }