AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker (with respect to expressive power) than dynamic logic of regular programs is given. This is a combinatorial proof, the main technical part of which may be of interest in its own
Abstract‘Looping’ of nondeterministic while-programs is shown to be expressible in Regular First Ord...
AbstractFor a dynamic logic L we study dynamic logics Ln for which programs allowed in formulas cann...
The present author as well as Andréka's group has experienced, while writing program- verifying prog...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
In this paper we study the expressive power of nondeterminism in dynamic logic. In particular, we sh...
There is a language L and structures A1 and A2 for L such that, for each closed formula F of determi...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
AbstractWe show that Test-free Propositional Dynamic Logic (PDL0) is less expressive than Propositio...
In (A. P. Stolboushkin and M.A. Taitslin, Inform. Contr. 57 (1983), 48–55) Taitslin introduced a str...
AbstractThis paper gives an account of results which answer some questions from Harel (1978, 1979), ...
We make explicit a connection between the “unwind property” and first-order logics of programs. Usin...
AbstractWe study the expressive power of various versions of Dynamic Logic and compare them with eac...
AbstractThe simple set WL of deterministic while programs is defined and a number of known methods f...
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...
Abstract‘Looping’ of nondeterministic while-programs is shown to be expressible in Regular First Ord...
AbstractFor a dynamic logic L we study dynamic logics Ln for which programs allowed in formulas cann...
The present author as well as Andréka's group has experienced, while writing program- verifying prog...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
In this paper we study the expressive power of nondeterminism in dynamic logic. In particular, we sh...
There is a language L and structures A1 and A2 for L such that, for each closed formula F of determi...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
AbstractWe show that Test-free Propositional Dynamic Logic (PDL0) is less expressive than Propositio...
In (A. P. Stolboushkin and M.A. Taitslin, Inform. Contr. 57 (1983), 48–55) Taitslin introduced a str...
AbstractThis paper gives an account of results which answer some questions from Harel (1978, 1979), ...
We make explicit a connection between the “unwind property” and first-order logics of programs. Usin...
AbstractWe study the expressive power of various versions of Dynamic Logic and compare them with eac...
AbstractThe simple set WL of deterministic while programs is defined and a number of known methods f...
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...
Abstract‘Looping’ of nondeterministic while-programs is shown to be expressible in Regular First Ord...
AbstractFor a dynamic logic L we study dynamic logics Ln for which programs allowed in formulas cann...
The present author as well as Andréka's group has experienced, while writing program- verifying prog...
DOI
Add to ORKG