scientific article; zbMATH DE number 3607998

zbMATH Open0392.03017MaRDI QIDQ4173344FDOQ4173344

Authors: Rohit Parikh 

Publication date: 1978

Title of this publication is not available (Why is that?)

zbMATH Keywords

Completeness of Propositional Dynamic LogicModal Logic of Programs

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Other nonclassical logic (03B60) Modal logic (including the logic of norms) (03B45) Abstract data types; algebraic specification (68Q65) Algorithms in computer science (68W99)

Cited In (15)

• Dynamic modal logic with counting: when reduction axioms work and fail
• An elementary proof of the completeness of PDL
• Aristotle, Boole, and categories
• Application of modal logic to programming
• Sequential method in propositional dynamic logic
• Introspection as an action in relational models
• Semantics of looping programs in Propositional Dynamic Logic
• Title not available (Why is that?)
• Mathematical modal logic: A view of its evolution
• A complete logic for reasoning about programs via nonstandard model theory. I
• Modal companions of intermediate propositional logics
• Learning in a changing world, an algebraic modal logical approach
• Performability of actions
• A canonical model construction for iteration-free PDL with intersection
• The semantics of Hoare's iteration rule

This page was built for publication:

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