A Proof System with Names for Modal Mu-calculus
Fixpoints are an important ingredient in semantics, abstract interpretation and program logics. Their addition to a logic can add considerable expressive power. One general issue is how to define proof systems for such logics. Here we examine proof systems for modal logic with fixpoints. We present...
Main Author: | Colin Stirling |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2013-09-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1309.5129v1 |
Similar Items
-
$\aleph_1$ and the modal $\mu$-calculus
by: Maria João Gouveia, et al.
Published: (2019-10-01) -
On closure ordinals for the modal mu−calculus
by: Afshari, B, et al.
Published: (2013) -
Probabilistic modal {\mu}-calculus with independent product
by: Matteo Mio
Published: (2012-11-01) -
A saturation method for the modal mu-calculus over pushdown systems
by: Hague, M, et al.
Published: (2011) -
A Saturation Method for the Modal Mu−Calculus over Pushdown Systems
by: Hague, M, et al.
Published: (2010)