Duality and the completeness of the modal &mgr;-calculus
Selected papers of the workshop on Topology and completion in semantics
Duality for modal &mgr;-logics
Theoretical Computer Science
Completeness of Kozen's axiomatisation of the propositional &mgr;-calculus
Information and Computation
Modal logic
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Journal of Logic and Computation
An easy completeness proof for the modal µ-calculus on finite trees
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Sahlqvist Correspondence for Modal mu-calculus
Studia Logica
Some sahlqvist completeness results for coalgebraic logics
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 5.23 |
We define Sahlqvist fixed point formulas. By extending the technique of Sambin and Vaccaro we show that (1) for each Sahlqvist fixed point formula @f there exists an LFP-formula @g(@f), with no free first-order variable or predicate symbol, such that a descriptive @m-frame (an order-topological structure that admits topological interpretations of least fixed point operators as intersections of clopen pre-fixed points) validates @f iff @g(@f) is true in this structure, and (2) every modal fixed point logic axiomatized by a set @F of Sahlqvist fixed point formulas is sound and complete with respect to the class of descriptive @m-frames satisfying {@g(@f):@f@?@F}. We also give some concrete examples of Sahlqvist fixed point logics and classes of descriptive @m-frames for which these logics are sound and complete.