This paper presents a new model construction for a natural cut-free infinitary version Kω (μ) of the propositional modal μ-calculus. Based on that the completeness of Kω (μ) and the related system Kω(μ) can be established directly – no detour, for example through automata theory, is needed. As a side result we also obtain a finite, cut-free sound and complete system for the propositional modal ...

A bstract We analyze the New Physics sensitivity of a recently proposed method to measure CP-violating $$ \mathcal{B} B ( K S → μ + − ) ℓ =0 decay rate using L interference. present our findings both in model-independent EFT approach as well within several simple NP scenarios. discuss relation with associated...

We show that the vectorial μ-calculus model checking problem over arbitrary graphs reduces to the vectorial, existential μ-calculus model checking problem over S5 graphs. We also draw some consequences of this fact. Moreover, we give a proof that satisfiability of μ-calculus in S5 is NP -complete, and by using S5 graphs we give a new proof that the satisfiability problem of the existential μ-ca...

We study the strictness of the modal μ-calculus hierarchy over some restricted classes of transition systems. First, we show that the hierarchy is strict over reflexive frames. By proving the finite model theorem for reflexive systems the same results holds for finite models. Second, we prove that over transitive systems the hierarchy collapses to the alternation-free fragment. In order to do t...