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

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

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

A finite model theorem for the propositional μ-calculus

Studia Logica • 1988
View 4 Excerpts
Highly Influenced

Syntactic Cut-elimination for Common Knowledge

Electr. Notes Theor. Comput. Sci. • 2009
View 10 Excerpts

The method of tree-hypersequents for modal propositional logic

Francesca Poggiolesi
Towards Mathematical Philosophy, • 2009
View 1 Excerpt

Canonical completeness of infinitary mu

J. Log. Algebr. Program. • 2008
View 4 Excerpts

Deep Sequent Systems for Modal Logic

Advances in Modal Logic • 2006
View 1 Excerpt

Similar Papers

Loading similar papers…