We investigate the canonicity of inequalities of the intuitionistic mu-calculus. The notion of
canonicity in the presence of fixed point operators is not entirely straightforward. In the …

In the present paper, the algorithmic correspondence theory developed in Conradie and
Palmigiano [9] is extended to mu-calculi with a non-classical base. We focus in particular on …

In this paper we introduce WMC, a weighted version of the alternation-free modal mu-
calculus for weighted transition systems. WMC subsumes previously studied weighted …

It was realized in the early nineties that the Curry-Howard isomorphism can be extended to
the case of the classical logic as well. Several calculi have appeared to provide a suitable …

The subject of this thesis is the Mu-calculus, which nowadays represents a very active
research area in both theoretical and practical Computer Science. The Mu-calculus is a logic …

The propositional µ-calculus as introduced by Kozen in [12] is considered. In that paper a
finitary axiomatisation of the logic was presented but its completeness remained an open …

This book presents what in our opinion constitutes the basis of the theory of the mu-calculus,
considered as an algebraic system rather than a logic. We have wished to present the …

We prove the canonicity of inductive inequalities in a constructive meta-theory, for classes of
logics algebraically captured by varieties of normal and regular lattice expansions. This …

We prove here that the intuitionistic theory T0↾+ UMIDN. or even EETJ↾+ UMIDN, of Explicit
Mathematics has the strength of–CA0. In Section 1 we give a double-negation translation for …

The model checking problem for open systems has been intensively studied in the literature,
for both finite-state (module checking) and infinite-state (pushdown module checking) …