Syntactic cut-elimination for a fragment of the modal mu-calculus

@article{Brnnler2012SyntacticCF,
title={Syntactic cut-elimination for a fragment of the modal mu-calculus},
author={Kai Br{\"u}nnler and Thomas Studer},
journal={Ann. Pure Appl. Logic},
year={2012},
volume={163},
pages={1838-1853}
}

For some modal fixed point logics, there are deductive systems that enjoy syntactic cut-elimination. An early example is the system in Pliuskevicius [15] for LTL. More recent examples are the systems by the authors of this paper for the logic of common knowledge [5] and by Hill and Poggiolesi for PDL [8], which are based on a form of deep inference. These logics can be seen as fragments of the modal mu-calculus. Here we are interested in how far this approach can be pushed in general. To this… CONTINUE READING