Add to ORKGIn this paper we study the expressive power of nondeterminism in dynamic logic. In particular, we show that first order regular dynamic logic without equality (hereafter abbreviated DL) is more expressive than its deterministic counterpart (DDL). This result has already been shown for th
We propose to bring together two research traditions, computation with first order logic from comput...
This paper spells out a dynamic proof format for the pure logic of relevant implication. (A proof is...
AbstractThis paper addresses the issue of non-deterministic extensions of logic database languages. ...
There is a language L and structures A1 and A2 for L such that, for each closed formula F of determi...
AbstractThis paper gives an account of results which answer some questions from Harel (1978, 1979), ...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
AbstractWe study the expressive power of various versions of Dynamic Logic and compare them with eac...
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...
In (A. P. Stolboushkin and M.A. Taitslin, Inform. Contr. 57 (1983), 48–55) Taitslin introduced a str...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
We make explicit a connection between the “unwind property” and first-order logics of programs. Usin...
AbstractWe show that Test-free Propositional Dynamic Logic (PDL0) is less expressive than Propositio...
Several versions of quantified dynamic logic are shown to be equivalent in expressive power to “stat...
AbstractSeveral different first-order formal logics of programs—Algorithmic Logic, Dynamic Logic, an...
We propose to bring together two research traditions, computation with first order logic from comput...
This paper spells out a dynamic proof format for the pure logic of relevant implication. (A proof is...
AbstractThis paper addresses the issue of non-deterministic extensions of logic database languages. ...
There is a language L and structures A1 and A2 for L such that, for each closed formula F of determi...
AbstractThis paper gives an account of results which answer some questions from Harel (1978, 1979), ...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
AbstractWe study the expressive power of various versions of Dynamic Logic and compare them with eac...
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...
In (A. P. Stolboushkin and M.A. Taitslin, Inform. Contr. 57 (1983), 48–55) Taitslin introduced a str...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
We make explicit a connection between the “unwind property” and first-order logics of programs. Usin...
AbstractWe show that Test-free Propositional Dynamic Logic (PDL0) is less expressive than Propositio...
Several versions of quantified dynamic logic are shown to be equivalent in expressive power to “stat...
AbstractSeveral different first-order formal logics of programs—Algorithmic Logic, Dynamic Logic, an...
We propose to bring together two research traditions, computation with first order logic from comput...
This paper spells out a dynamic proof format for the pure logic of relevant implication. (A proof is...
AbstractThis paper addresses the issue of non-deterministic extensions of logic database languages. ...