AbstractWe study the expressive power of various versions of Dynamic Logic and compare them with each other as well as with standard languages in the logical literature. One version of Dynamic Logic is equivalent to the infinitary logic Lω1,ωCK but regular Dynamic Logic is strictly less expressive. In particular, the ordinals ωω and ωω·2 are indistinguishable by formulas of regular Dynamic Logic. We also study the effects of including array assignments and/or random assignments on the expressive power of Dynamic Logic
This paper provides a formal analysis on the solutions of the frame problem by using dynamic logic. ...
In this paper we subject the possible ways to define versions of DPL with local assignments to a th...
We extend the definition of dynamic ordinals to generalised dynamic ordinals. We compute generalised...
AbstractWe study the expressive power of various versions of Dynamic Logic and compare them with eac...
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...
AbstractThis paper gives an account of results which answer some questions from Harel (1978, 1979), ...
AbstractFor a dynamic logic L we study dynamic logics Ln for which programs allowed in formulas cann...
Several versions of quantified dynamic logic are shown to be equivalent in expressive power to “stat...
Abstract‘Looping’ of nondeterministic while-programs is shown to be expressible in Regular First Ord...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
AbstractWe propose an extension of Propositional Dynamic Logic which allows a new kind of program te...
Dynamic ordinal analysis is ordinal analysis for weak arithmetics like fragments of bounded arithmet...
This paper spells out a dynamic proof format for the pure logic of relevant implication. (A proof is...
We propose to bring together two research traditions, computation with first order logic from comput...
This paper provides a formal analysis on the solutions of the frame problem by using dynamic logic. ...
In this paper we subject the possible ways to define versions of DPL with local assignments to a th...
We extend the definition of dynamic ordinals to generalised dynamic ordinals. We compute generalised...
AbstractWe study the expressive power of various versions of Dynamic Logic and compare them with eac...
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...
AbstractThis paper gives an account of results which answer some questions from Harel (1978, 1979), ...
AbstractFor a dynamic logic L we study dynamic logics Ln for which programs allowed in formulas cann...
Several versions of quantified dynamic logic are shown to be equivalent in expressive power to “stat...
Abstract‘Looping’ of nondeterministic while-programs is shown to be expressible in Regular First Ord...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
AbstractWe propose an extension of Propositional Dynamic Logic which allows a new kind of program te...
Dynamic ordinal analysis is ordinal analysis for weak arithmetics like fragments of bounded arithmet...
This paper spells out a dynamic proof format for the pure logic of relevant implication. (A proof is...
We propose to bring together two research traditions, computation with first order logic from comput...
This paper provides a formal analysis on the solutions of the frame problem by using dynamic logic. ...
In this paper we subject the possible ways to define versions of DPL with local assignments to a th...
We extend the definition of dynamic ordinals to generalised dynamic ordinals. We compute generalised...