A Complete Deductive System for the μ-Calculus

@inproceedings{Walukiewicz1995ACD,
  title={A Complete Deductive System for the μ-Calculus},
  author={Igor Walukiewicz},
  year={1995}
}
The propositional μ-calculus as introduced by Kozen in [12] is considered. In that paper a finitary axiomatisation of the logic was presented but its completeness remained an open question. Here a different finitary axiomatisation of the logic is proposed and proved to be complete. The two axiomatisations are compared. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Results on the Propositional mu-Calculus

Theor. Comput. Sci. • 1983
View 17 Excerpts
Highly Influenced

Games for μ-calculus

D. Niwiński, I. Walukiewicz
Technical Report TR 94-03(192), • 1994
View 4 Excerpts
Highly Influenced

Modal and temporal logics. In S.Abramsky, D.Gabbay, and T.Maibaum

C. S. Stirling
editors, Handbook of Logic in Comuter Science, • 1991
View 1 Excerpt

Logics of Programs

Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics • 1990
View 2 Excerpts

Similar Papers

Loading similar papers…