We present two finitary cut-free sequent calculi for the modal μ-calculus. One is a variant of
Kozen's axiomatisation in which cut is replaced by a strengthening of the induction rule for …

Abstract Automata operating on infinite objects feature prominently in the theory of the modal-
calculus. One such application concerns the tableau games introduced by Niwiński & …

This article revisits soundness and completeness of proof systems for proving that sets of
states in infinite-state labeled transition systems satisfy formulas in the modal mu-calculus in …

It is well-known that the winning region of a parity game with n nodes and k priorities can be
computed as ak-nested fixpoint of a suitable function; straightforward computation of this …

The coalgebraic μ-calculus provides a generic semantic framework for fixpoint logics with
branching types beyond the standard relational setup, eg probabilistic, weighted, or game …

The coalgebraic µ-calculus provides a generic semantic framework for fixpoint logics over
systems whose branching type goes beyond the standard relational setup, eg probabilistic …

We present a sound, complete, and optimal single-pass tableau algorithm for the alternation-
free $\mu $-calculus. The algorithm supports global caching with intermediate propagation …

We introduce a natural notion of limit-deterministic parity automata and present a method
that uses such automata to construct satisfiability games for the weakly aconjunctive …

Obliging games have been introduced in the context of the game perspective on reactive
synthesis in order to enforce a degree of cooperation between the to-be-synthesized system …

In this paper we introduce a cut-free sequent calculus for the alternation-free fragment of the
modal $\mu $-calculus. This system allows for cyclic proofs and uses a simple focus …