Deductive Systems for the Modal mu-Calculus

Abstract

We survey deductive systems for the modal μ-calculus. The distinguishing feature between different such systems is how minimality of least fixed points is guaranteed. There are basically three ways to achieve this: (i) by induction rules, (ii) by semi-formal rules with infinitely many premises, or (iii) by a global condition on infinitely long proof branches.

Cite this paper

@inproceedings{Studer2007DeductiveSF, title={Deductive Systems for the Modal mu-Calculus}, author={Thomas Studer}, year={2007} }