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
We show that strict deterministic propositional dynamic logic with intersection is highly undecidabl...
Propositional dynamic logic is a formal system for reasoning about the before—after behavior of regu...
It is proved that no logic of programs with unbounded memory is reducible to a bounded memory progra...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
We make explicit a connection between the “unwind property” and first-order logics of programs. Usin...
AbstractSeveral different first-order formal logics of programs—Algorithmic Logic, Dynamic Logic, an...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
Abstract‘Looping’ of nondeterministic while-programs is shown to be expressible in Regular First Ord...
There is a language L and structures A1 and A2 for L such that, for each closed formula F of determi...
AbstractWe study the expressive power of various versions of Dynamic Logic and compare them with eac...
In (A. P. Stolboushkin and M.A. Taitslin, Inform. Contr. 57 (1983), 48–55) Taitslin introduced a str...
In this paper we study the expressive power of nondeterminism in dynamic logic. In particular, we sh...
AbstractThis paper gives an account of results which answer some questions from Harel (1978, 1979), ...
Following a suggestion of Pratt, we consider propositional dynamic logic in which programs are nonde...
AbstractWe show that Test-free Propositional Dynamic Logic (PDL0) is less expressive than Propositio...
We show that strict deterministic propositional dynamic logic with intersection is highly undecidabl...
Propositional dynamic logic is a formal system for reasoning about the before—after behavior of regu...
It is proved that no logic of programs with unbounded memory is reducible to a bounded memory progra...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
We make explicit a connection between the “unwind property” and first-order logics of programs. Usin...
AbstractSeveral different first-order formal logics of programs—Algorithmic Logic, Dynamic Logic, an...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
Abstract‘Looping’ of nondeterministic while-programs is shown to be expressible in Regular First Ord...
There is a language L and structures A1 and A2 for L such that, for each closed formula F of determi...
AbstractWe study the expressive power of various versions of Dynamic Logic and compare them with eac...
In (A. P. Stolboushkin and M.A. Taitslin, Inform. Contr. 57 (1983), 48–55) Taitslin introduced a str...
In this paper we study the expressive power of nondeterminism in dynamic logic. In particular, we sh...
AbstractThis paper gives an account of results which answer some questions from Harel (1978, 1979), ...
Following a suggestion of Pratt, we consider propositional dynamic logic in which programs are nonde...
AbstractWe show that Test-free Propositional Dynamic Logic (PDL0) is less expressive than Propositio...
We show that strict deterministic propositional dynamic logic with intersection is highly undecidabl...
Propositional dynamic logic is a formal system for reasoning about the before—after behavior of regu...
It is proved that no logic of programs with unbounded memory is reducible to a bounded memory progra...
DOI
Add to ORKG