A circular proof system for the hybrid mu-calculus
Logic in Computer Science
2020-06-11 v3
Abstract
We present a circular and cut-free proof system for the hybrid mu-calculus and prove its soundness and completeness. The system uses names for fixpoint unfoldings, like the circular proof system for the mu-calculus previously developed by Stirling.
Cite
@article{arxiv.2001.04971,
title = {A circular proof system for the hybrid mu-calculus},
author = {Sebastian Enqvist},
journal= {arXiv preprint arXiv:2001.04971},
year = {2020}
}