A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
There is a language L and structures A~ and A 2 for L such that, for each closed formula F of deterministic regular dynamic logic, the formula F is valid in A ~ if and only if F is valid in A 2. There is, however, a closed formula of nondeterministic regular dynamic logic is both valid in A t and not valid in A z. Thus, nondeterminism adds to the expressive power even in the presence of quantifiers. This answers Meyer's question. Moreover, the proof here, unlike that of Berman, Halpern, anddoi:10.1016/s0019-9958(83)80024-2 fatcat:idckkuwbjvfdzh2sjvxzrsfqpi