AbstractThis 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 μ-calculus
Abstract Propositional dynamic logic (PDL) is complete but not compact.As a consequence, strong comp...
Abstract Propositional dynamic logic (PDL) is complete but not compact.As a consequence, strong comp...
AbstractPropositional μ-calculus is an extension of the propositional modal logic with the least fix...
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 explore the proof theory of the modal μ-calculus with converse, aka the ‘full μ-calculus’. Buildi...
We study the proof-theoretic relationship between two deductive systems for the modal mu-calculus. F...
The article deals with infinitary modal logic. We first discuss the difficulties related to the deve...
We present three finitary cut-free sequent calculi for the modal [my]-calculus. Two of these derive ...
This paper deals with the infinitary modal propositional logic Kω1, featuring countable disjunctions...
Abstract: Segerberg established an analogue of the canonical model theorem in modal logic for infini...
This paper deals with the infinitary modal propositional logic K!1, featuring countable disjunctions...
Segerberg established an analogue of the canonical model theorem in modal logic for infinitary modal...
This paper investigates a first-order extension of GL called \(\textup{ML}^3\). We outline briefly t...
Abstract Propositional dynamic logic (PDL) is complete but not compact.As a consequence, strong comp...
Abstract Propositional dynamic logic (PDL) is complete but not compact.As a consequence, strong comp...
Abstract Propositional dynamic logic (PDL) is complete but not compact.As a consequence, strong comp...
AbstractPropositional μ-calculus is an extension of the propositional modal logic with the least fix...
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 explore the proof theory of the modal μ-calculus with converse, aka the ‘full μ-calculus’. Buildi...
We study the proof-theoretic relationship between two deductive systems for the modal mu-calculus. F...
The article deals with infinitary modal logic. We first discuss the difficulties related to the deve...
We present three finitary cut-free sequent calculi for the modal [my]-calculus. Two of these derive ...
This paper deals with the infinitary modal propositional logic Kω1, featuring countable disjunctions...
Abstract: Segerberg established an analogue of the canonical model theorem in modal logic for infini...
This paper deals with the infinitary modal propositional logic K!1, featuring countable disjunctions...
Segerberg established an analogue of the canonical model theorem in modal logic for infinitary modal...
This paper investigates a first-order extension of GL called \(\textup{ML}^3\). We outline briefly t...
Abstract Propositional dynamic logic (PDL) is complete but not compact.As a consequence, strong comp...
Abstract Propositional dynamic logic (PDL) is complete but not compact.As a consequence, strong comp...
Abstract Propositional dynamic logic (PDL) is complete but not compact.As a consequence, strong comp...
AbstractPropositional μ-calculus is an extension of the propositional modal logic with the least fix...