AbstractPropositional μ-calculus is an extension of the propositional modal logic with the least fixpoint operator. In the paper introducing the logic Kozen posed a question about completeness of the axiomatisation which is a small extension of the axiomatisation of the model system K. It is shown that this axiomatisation is complete
International audienceGiven a set Γ of modal formulas of the form γ(x,p), where x occurs positively ...
International audienceGiven a set Γ of modal formulas of the form γ(x,p), where x occurs positively ...
This article introduces propositional logic as a formal system ([14], [10], [11]). The formulae of t...
Propositional -calculus is an extension of the propositional modal logic with the least xpoint opera...
AbstractWe consider the modal μ-calculus due to Kozen, which is a finitary modal logic with least an...
We consider the modal µ-calculus due to Kozen, which is a finitary modal logic with least and greate...
AbstractIn this paper we define and study a propositional μ-calculus Lμ, which consists essentially ...
AbstractThe modal μ-calculi are extensions of propositional modal logics with least and greatest fix...
The modal mu-calculus is a very expressive formalism extending basic modal logic with least and grea...
We introduce an axiomatization for the coalgebraic fixed point logic which was introduced by Venema ...
AbstractThis paper presents a new model construction for a natural cut-free infinitary version Kω+(μ...
We introduce an axiomatization for the coalgebraic fixed point logic which was introduced by Venema ...
Kracht M, Kutz O. Elementary Models for Modal Predicate Logic. Part 1: Completeness. In: Wolter F, e...
The propositional mu-calculus as introduced by Kozen in [12] is considered.In that paper a finitary ...
Modal fixpoint logics traditionally play a central role in computer science, in particular in artifi...
International audienceGiven a set Γ of modal formulas of the form γ(x,p), where x occurs positively ...
International audienceGiven a set Γ of modal formulas of the form γ(x,p), where x occurs positively ...
This article introduces propositional logic as a formal system ([14], [10], [11]). The formulae of t...
Propositional -calculus is an extension of the propositional modal logic with the least xpoint opera...
AbstractWe consider the modal μ-calculus due to Kozen, which is a finitary modal logic with least an...
We consider the modal µ-calculus due to Kozen, which is a finitary modal logic with least and greate...
AbstractIn this paper we define and study a propositional μ-calculus Lμ, which consists essentially ...
AbstractThe modal μ-calculi are extensions of propositional modal logics with least and greatest fix...
The modal mu-calculus is a very expressive formalism extending basic modal logic with least and grea...
We introduce an axiomatization for the coalgebraic fixed point logic which was introduced by Venema ...
AbstractThis paper presents a new model construction for a natural cut-free infinitary version Kω+(μ...
We introduce an axiomatization for the coalgebraic fixed point logic which was introduced by Venema ...
Kracht M, Kutz O. Elementary Models for Modal Predicate Logic. Part 1: Completeness. In: Wolter F, e...
The propositional mu-calculus as introduced by Kozen in [12] is considered.In that paper a finitary ...
Modal fixpoint logics traditionally play a central role in computer science, in particular in artifi...
International audienceGiven a set Γ of modal formulas of the form γ(x,p), where x occurs positively ...
International audienceGiven a set Γ of modal formulas of the form γ(x,p), where x occurs positively ...
This article introduces propositional logic as a formal system ([14], [10], [11]). The formulae of t...
DOI
Add to ORKG