Dynamic logic with program specifications and its relational proof system

DOI10.1080/11663081.1993.10510805zbMath0802.03025OpenAlexW1983418638MaRDI QIDQ4291023

Ewa S. Orłowska

Publication date: 12 December 1994

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/11663081.1993.10510805

zbMATH Keywords

semanticspropositional dynamic logicalgebras of relationsrelational logicone-sorted relational formalizationoperators for program specificationrelational deduction system

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)

Related Items (2)

Action negation and alternative reductions for dynamic deontic logics ⋮ Towards reasoning about Hoare relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sequent calculus for relation algebras
• Varieties of relation algebras
• Proof system for weakest prespecification
• A proof system for the first-order relational calculus
• Boolean modules
• Semantics of probabilistic programs
• The origin of relation algebras in the development and axiomatization of the calculus of relations
• First-order dynamic logic
• On representable relation algebras
• Looping vs. repeating in dynamic logic
• Propositional dynamic logic of looping and converse is elementarily decidable
• An undecidability result for relation algebras
• Nonfinitizability of classes of representable cylindric algebras
• On the calculus of relations

This page was built for publication: Dynamic logic with program specifications and its relational proof system