AbstractIt is shown that the validity problem for propositional dynamic logic (PDL), which is decidable and actually DEXPTIME-complete for the usual class of regular programs, becomes highly undecidable, viz. Π11-complete, when the single nonregular one-letter program L = {a2i |; i ⩾ 0} is added. This answers a question of Harel, Pnueli, and Stavi
AbstractWe give an elementary proof of the completeness of the Segerberg axions for Propositional Dy...
AbstractWe show that Test-free Propositional Dynamic Logic (PDL0) is less expressive than Propositio...
Abstract Propositional dynamic logic (PDL) is complete but not compact.As a consequence, strong comp...
AbstractThe borderline between decidable and undecidable propositional dynamic Logic (PDL) is sought...
Propositional dynamic logic (PDL) is one of the most succesful variants of modal logic. To make it e...
: We continue research on enriching propositional dynamic logic (PDL) with nonregular programs. Prev...
AbstractIt is proved that validity problems for two variants of propositional dynamic logic (PDL) co...
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recurs...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
Abstract. The propositional dynamic logic (PDL) is an adequate tool to write down programs. In a pre...
International audienceWe extend the propositional dynamic logic PDL of Fischer and Ladner with a res...
AbstractWe extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind o...
We show that strict deterministic propositional dynamic logic with intersection is highly undecidabl...
For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows pr...
AbstractThis paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with lo...
AbstractWe give an elementary proof of the completeness of the Segerberg axions for Propositional Dy...
AbstractWe show that Test-free Propositional Dynamic Logic (PDL0) is less expressive than Propositio...
Abstract Propositional dynamic logic (PDL) is complete but not compact.As a consequence, strong comp...
AbstractThe borderline between decidable and undecidable propositional dynamic Logic (PDL) is sought...
Propositional dynamic logic (PDL) is one of the most succesful variants of modal logic. To make it e...
: We continue research on enriching propositional dynamic logic (PDL) with nonregular programs. Prev...
AbstractIt is proved that validity problems for two variants of propositional dynamic logic (PDL) co...
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recurs...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
Abstract. The propositional dynamic logic (PDL) is an adequate tool to write down programs. In a pre...
International audienceWe extend the propositional dynamic logic PDL of Fischer and Ladner with a res...
AbstractWe extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind o...
We show that strict deterministic propositional dynamic logic with intersection is highly undecidabl...
For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows pr...
AbstractThis paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with lo...
AbstractWe give an elementary proof of the completeness of the Segerberg axions for Propositional Dy...
AbstractWe show that Test-free Propositional Dynamic Logic (PDL0) is less expressive than Propositio...
Abstract Propositional dynamic logic (PDL) is complete but not compact.As a consequence, strong comp...
DOI
Add to ORKG