# An expressive completeness theorem for coalgebraic modal mu-calculi

## TL;DR

This paper establishes a coalgebraic modal mu-calculus completeness theorem by linking it to monadic second-order logic invariance, using automata-theoretic methods to generalize classical results across various functors.

## Contribution

It introduces an adequate uniform construction for coalgebraic functors, enabling a broad characterization of the coalgebraic mu-calculus as the bisimulation-invariant fragment of MSO logic.

## Key findings

- Provides a new proof of the Janin-Walukiewicz Theorem for modal mu-calculus
- Establishes bisimulation invariance for the bag functor and exponential polynomial functors
- Derives a characterization theorem for the monotone modal mu-calculus

## Abstract

Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. We then consider invariance under behavioral equivalence of MSO-formulas. More specifically, we investigate whether the coalgebraic mu-calculus is the bisimulation-invariant fragment of the monadic second-order language for a given functor. Using automatatheoretic techniques and building on recent results by the third author, we show that in order to provide such a characterization result it suffices to find what we call an adequate uniform construction for the coalgebraic type functor. As direct applications of this result we obtain a partly new proof of the Janin-Walukiewicz Theorem for the modal mu-calculus, avoiding the use of syntactic normal forms, and bisimulation invariance results for the bag functor (graded modal logic) and all exponential polynomial functors (including the "game functor"). As a more involved application, involving additional non-trivial ideas, we also derive a characterization theorem for the monotone modal mu-calculus, with respect to a natural monadic second-order language for monotone neighborhood models.