Deterministic dynamic logic is strictly weaker than dynamic logic

DOI10.1016/S0019-9958(83)80024-2MaRDI QIDQ3323259zbMATH OpenOpenAlexFDO

Authors Alexei P. Stolboushkin, Michael A. Taitslin

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

deterministic dynamic logicexpressive power

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3868597
• The comparison of the expressive power of first-order dynamic logics
• A simplified proof of \(DDL<DL\)
• A nondeterministic program logic
• The propositional dynamic logic of deterministic, well-structured programs

Cited in

(12)

• The unwind property for programs with bounded memory
• Some relationships between logics of programs and complexity theory
• Role of determinism in query languages for data bases
• A simplified proof of \(DDL<DL\)
• Deterministic FOIES are strictly weaker
• A.D. Taimanov and model theory in Kazakhstan
• In memoriam: Mikhail A. Taitslin, 1936--2013
• scientific article; zbMATH DE number 4179344 (Why is no real title available?)
• scientific article; zbMATH DE number 3868597 (Why is no real title available?)
• Regular dynamic logic is not interpretable in deterministic context-free dynamic logic
• Logical aspects of Cayley-graphs: the group case
• Equivalences among logics of programs

This page was built for publication: Deterministic dynamic logic is strictly weaker than dynamic logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3323259)