On models for propositional dynamic logic

DOI10.1016/0304-3975(91)90083-EzbMath0753.68061OpenAlexW2072996698MaRDI QIDQ1183594

Jan van Leeuwen, Peter M. W. Knijnenburg

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90083-e

zbMATH Keywords

approximationdynamic logicdynamic algebrasuniversal model

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (5)

Dynamic Logic with Binders and Its Application to the Development of Reactive Systems ⋮ Introducing Grades in Deontic Logics ⋮ A contraction-free and cut-free sequent calculus for propositional dynamic logic ⋮ A logic for the stepwise development of reactive systems ⋮ Strong completeness and limited canonicity for PDL

Cites Work

• Integrating loop and data transformations for global optimization
• An elementary proof of the completeness of PDL
• First-order dynamic logic
• Propositional dynamic logic of regular programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On models for propositional dynamic logic