Logic in Computer Science (LICS 1995)

Paper: Completeness of Kozen's Axiomatisation of the Propositional Mu-Calculus (at LICS 1995)

Authors: Igor Walukiewicz

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.

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 Symp. on Logic in Computer Science, {LICS} 1995},
    year =	 1995,
    editor =	 {Dexter Kozen},
    month =	 {June}, 
    pages =      {14-24},
    location =   {San Diego, CA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }