Propositional dynamic logic with local assignments

DOI10.1016/0304-3975(85)90031-3zbMath0574.03011OpenAlexW2087363667MaRDI QIDQ1062972

M. L. Tiomkin, Johann A. Makowsky

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90031-3

zbMATH Keywords

equivalence of programsfirst order arithmeticextension of propositional dynamic logicfinitely branchingfirst-order logic with transitive closurelooping

Mathematics Subject Classification ID

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

Related Items (6)

Extending propositional dynamic logic for Petri nets ⋮ Determinism and non-determinism in PDL ⋮ A Dynamic Logic of Institutional Actions ⋮ Probabilistic termination versus fair termination ⋮ An essay in combinatory dynamic logic ⋮ Decidability of finite probabilistic propositional dynamic logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Definability in dynamic logic
• First-order dynamic logic
• Propositional dynamic logic of regular programs
• Propositional dynamic logic of looping and converse is elementarily decidable
• The axiom of choice

This page was built for publication: Propositional dynamic logic with local assignments