Deterministic dynamic logic is strictly weaker than dynamic logic

DOI10.1016/S0019-9958(83)80024-2zbMath0537.68037OpenAlexW1984464989MaRDI QIDQ3323259

Michael A. Taitslin, Alexei P. Stolboushkin

Publication date: 1983

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(83)80024-2

zbMATH Keywords

expressive powerdeterministic dynamic logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Abstract data types; algebraic specification (68Q65)

Related Items

Some relationships between logics of programs and complexity theory, IN MEMORIAM: MIKHAIL A. TAITSLIN 1936–2013, A simplified proof of \(DDL<DL\), Logical aspects of Cayley-graphs: the group case, A.D. Taimanov and model theory in Kazakhstan, Equivalences among logics of programs, The unwind property for programs with bounded memory