AbstractIn this paper we define and study a propositional μ-calculus Lμ, which consists essentially of propositional modal logic with a least fixpoint operator. Lμ is syntactically simpler yet strictly more expressive than Propositional Dynamic Logic (PDL). For a restricted version we give an exponential-time decision procedure, small model property, and complete deductive system, theory subsuming the corresponding results for PDL
Abstract Propositional dynamic logic (PDL) is complete but not compact.As a consequence, strong comp...
AbstractThis work presents a Propositional Dynamic Logic (πDL) in which the programs are described i...
Abstract—We study a version of Propositional Dynamic Logic (PDL) that we call Dynamic Logic of Propo...
We define a propositional version of the µ-calculus, and give an exponential-time decision procedure...
We define a propositional version of the µ-calculus, and give an exponential-time decision procedure...
It is well known that propositional Dynamic Logic (PDL) can be seen as a fragment of the modal μ-cal...
We show that propositional dynamic logic and the modal μ-calculus are closed under product modalitie...
AbstractPropositional μ-calculus is an extension of the propositional modal logic with the least fix...
Abstract. We consider an extension of modal logic with an operator for constructing inflationary fix...
AbstractThe modal μ-calculi are extensions of propositional modal logics with least and greatest fix...
AbstractWe introduce a fundamental propositional logical system based on modal logic for describing ...
AbstractThe propositional mu-calculus is a propositional logic of programs which incorporates a leas...
Abstract Propositional dynamic logic (PDL) is complete but not compact.As a consequence, strong comp...
We survey deductive systems for the modal µ-calculus. The distinguishing feature between different s...
P and for L being one of the mentioned logics, we define an operator TL,P,which has the least fixpoi...
Abstract Propositional dynamic logic (PDL) is complete but not compact.As a consequence, strong comp...
AbstractThis work presents a Propositional Dynamic Logic (πDL) in which the programs are described i...
Abstract—We study a version of Propositional Dynamic Logic (PDL) that we call Dynamic Logic of Propo...
We define a propositional version of the µ-calculus, and give an exponential-time decision procedure...
We define a propositional version of the µ-calculus, and give an exponential-time decision procedure...
It is well known that propositional Dynamic Logic (PDL) can be seen as a fragment of the modal μ-cal...
We show that propositional dynamic logic and the modal μ-calculus are closed under product modalitie...
AbstractPropositional μ-calculus is an extension of the propositional modal logic with the least fix...
Abstract. We consider an extension of modal logic with an operator for constructing inflationary fix...
AbstractThe modal μ-calculi are extensions of propositional modal logics with least and greatest fix...
AbstractWe introduce a fundamental propositional logical system based on modal logic for describing ...
AbstractThe propositional mu-calculus is a propositional logic of programs which incorporates a leas...
Abstract Propositional dynamic logic (PDL) is complete but not compact.As a consequence, strong comp...
We survey deductive systems for the modal µ-calculus. The distinguishing feature between different s...
P and for L being one of the mentioned logics, we define an operator TL,P,which has the least fixpoi...
Abstract Propositional dynamic logic (PDL) is complete but not compact.As a consequence, strong comp...
AbstractThis work presents a Propositional Dynamic Logic (πDL) in which the programs are described i...
Abstract—We study a version of Propositional Dynamic Logic (PDL) that we call Dynamic Logic of Propo...
DOI
Add to ORKG