AbstractWe show that Test-free Propositional Dynamic Logic (PDL0) is less expressive than Propositional Dynamic Logic, i.e. we show that there is a formula of PDL using the conditional program operator? which is not equivalent to any formula of PDL using only the regular program operators concatenation, branching and iteration. Extensions of the problem are discussed in the conclusion
We study a version of Propositional Dynamic Logic (PDL) that we call Dynamic Logic of Propositional ...
AbstractIt is shown that the validity problem for propositional dynamic logic (PDL), which is decida...
AbstractWe extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind o...
AbstractWe show that Test-free Propositional Dynamic Logic (PDL0) is less expressive than Propositio...
Introduction: Propositional Dynamic Logic (or PDL) is a rich field of study. Many questions arise na...
For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows pr...
For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows pr...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
AbstractThe borderline between decidable and undecidable propositional dynamic Logic (PDL) is sought...
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recurs...
There is a language L and structures A1 and A2 for L such that, for each closed formula F of determi...
Abstract—We study a version of Propositional Dynamic Logic (PDL) that we call Dynamic Logic of Propo...
AbstractWe consider an extension QPDL of Segerberg-Pratt's Propositional Dynamic Logic PDL, with pro...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
AbstractThis paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with lo...
We study a version of Propositional Dynamic Logic (PDL) that we call Dynamic Logic of Propositional ...
AbstractIt is shown that the validity problem for propositional dynamic logic (PDL), which is decida...
AbstractWe extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind o...
AbstractWe show that Test-free Propositional Dynamic Logic (PDL0) is less expressive than Propositio...
Introduction: Propositional Dynamic Logic (or PDL) is a rich field of study. Many questions arise na...
For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows pr...
For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows pr...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
AbstractThe borderline between decidable and undecidable propositional dynamic Logic (PDL) is sought...
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recurs...
There is a language L and structures A1 and A2 for L such that, for each closed formula F of determi...
Abstract—We study a version of Propositional Dynamic Logic (PDL) that we call Dynamic Logic of Propo...
AbstractWe consider an extension QPDL of Segerberg-Pratt's Propositional Dynamic Logic PDL, with pro...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
AbstractThis paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with lo...
We study a version of Propositional Dynamic Logic (PDL) that we call Dynamic Logic of Propositional ...
AbstractIt is shown that the validity problem for propositional dynamic logic (PDL), which is decida...
AbstractWe extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind o...
DOI
Add to ORKG