We study the proof-theoretic relationship between two deductive systems for the modal mu-calculus. First we recall an infinitary system which contains an omega rule allowing to derive the truth of a greatest fixed point from the truth of each of its (infinitely many) approximations. Then we recall a second infinitary calculus which is based on non-well-founded trees. In this system proofs are finitely branching but may contain infinite branches as long as some greatest fixed point is unfolded infinitely often along every branch. The main contribution of our paper is a translation from proofs in the first system to proofs in the second system. Completeness of the second system then follows from completeness of the first, and a new proof of t...
Modal µ-calculus is one of the central languages of logic and verification , whose study involves no...
We present two sequent calculi for the modal µ-calculus over S5 and prove their completeness by usin...
AbstractThis paper presents a new model construction for a natural cut-free infinitary version Kω+(μ...
We explore the proof theory of the modal μ-calculus with converse, aka the ‘full μ-calculus’. Buildi...
We survey deductive systems for the modal µ-calculus. The distinguishing feature between different s...
This paper presents a proof method for proving that infinite-state systems satisfy properties expres...
We explore the proof theory of the modal μ-calculus with converse, aka the ‘full μ-calculus’. Buildi...
The modal mu-calculus is a very expressive formalism extending basic modal logic with least and grea...
Modal $mu$-calculus, the logic obtained by adding (non-first-order) least and greatest fixpoint oper...
The closure ordinal of a formula of modal mu-calculus mu X phi is the least ordinal kappa, if it exi...
Modal µ-calculus is one of the central languages of logic and verification , whose study involves no...
The article deals with infinitary modal logic. We first discuss the difficulties related to the deve...
The propositional mu-calculus as introduced by Kozen in [12] is considered.In that paper a finitary ...
We present a formalization of propositional modal logic in the framework of Labelled Deductive Syste...
We introduce a cyclic proof system for the two-way alternation-free modal $\mu$-calculus. The system...
Modal µ-calculus is one of the central languages of logic and verification , whose study involves no...
We present two sequent calculi for the modal µ-calculus over S5 and prove their completeness by usin...
AbstractThis paper presents a new model construction for a natural cut-free infinitary version Kω+(μ...
We explore the proof theory of the modal μ-calculus with converse, aka the ‘full μ-calculus’. Buildi...
We survey deductive systems for the modal µ-calculus. The distinguishing feature between different s...
This paper presents a proof method for proving that infinite-state systems satisfy properties expres...
We explore the proof theory of the modal μ-calculus with converse, aka the ‘full μ-calculus’. Buildi...
The modal mu-calculus is a very expressive formalism extending basic modal logic with least and grea...
Modal $mu$-calculus, the logic obtained by adding (non-first-order) least and greatest fixpoint oper...
The closure ordinal of a formula of modal mu-calculus mu X phi is the least ordinal kappa, if it exi...
Modal µ-calculus is one of the central languages of logic and verification , whose study involves no...
The article deals with infinitary modal logic. We first discuss the difficulties related to the deve...
The propositional mu-calculus as introduced by Kozen in [12] is considered.In that paper a finitary ...
We present a formalization of propositional modal logic in the framework of Labelled Deductive Syste...
We introduce a cyclic proof system for the two-way alternation-free modal $\mu$-calculus. The system...
Modal µ-calculus is one of the central languages of logic and verification , whose study involves no...
We present two sequent calculi for the modal µ-calculus over S5 and prove their completeness by usin...
AbstractThis paper presents a new model construction for a natural cut-free infinitary version Kω+(μ...