Filtration and canonical completeness for continuous modal mu-calculi

Jan Rooduijn
(ILLC, University of Amsterdam, The Netherlands)
Yde Venema
(ILLC, University of Amsterdam, The Netherlands)

The continuous modal mu-calculus is a fragment of the modal mu-calculus, where the application of fixpoint operators is restricted to formulas whose functional interpretation is Scott-continuous, rather than merely monotone. By game-theoretic means, we show that this relatively expressive fragment still allows two important techniques of basic modal logic, which notoriously fail for the full modal mu-calculus: filtration and canonical models. In particular, we show that the Filtration Theorem holds for formulas in the language of the continuous modal mu-calculus. As a consequence we obtain the finite model property over a wide range of model classes. Moreover, we show that if a basic modal logic L is canonical and the class of L-frames admits filtration, then the logic obtained by adding continuous fixpoint operators to L is sound and complete with respect to the class of L-frames. This generalises recent results on a strictly weaker fragment of the modal mu-calculus, viz. PDL.

In Pierre Ganty and Davide Bresolin: Proceedings 12th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2021), Padua, Italy, 20-22 September 2021, Electronic Proceedings in Theoretical Computer Science 346, pp. 211–226.
Published: 17th September 2021.

ArXived at: http://dx.doi.org/10.4204/EPTCS.346.14 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org