Modular Games for Coalgebraic Fixed Point Logics

We build on existing work on finitary modular coalgebraic logics [3,4], which we extend with general fixed points, including CTL- and PDL-like fixed points, and modular evaluation games. These results are generalisations of their correspondents in the modal mu-calculus, as described e.g. in [19]. Inspired by recent work of Venema [21], we provide our logics with evaluation games that come equipped with a modular way of building the game boards. We also study a specific class of modular coalgebraic logics that allow for the introduction of an implicit negation operator.