A canonical model construction for iteration-free PDL with intersection

MaRDI QIDQ5015273zbMATH OpenFDO

Authors Florian Bruse, Daniel Kernberger, Martin Lange

Publication date 7 December 2021

Full work available at URL https://arxiv.org/abs/1609.04093, http://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF2016.9

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05)

Recommendations

• Iteration-free PDL with intersection: A complete axiomatization
• scientific article; zbMATH DE number 2066186
• Iteration-free \(\mathrm{PDL}\) with storing, recovering and parallel composition: a complete axiomatization
• Axiomatization and computability of a variant of iteration-free PDL with fork
• scientific article; zbMATH DE number 1114354

Cites work

• 2-Exp Time lower bounds for propositional dynamic logics with intersection
• A near-optimal method for reasoning about action
• An elementary proof of the completeness of PDL
• An essay in combinatory dynamic logic
• Complete Axiomatization of a Relative Modal Logic with Composition and Intersection
• scientific article; zbMATH DE number 3983144 (Why is no real title available?)
• scientific article; zbMATH DE number 3607998 (Why is no real title available?)
• scientific article; zbMATH DE number 2066186 (Why is no real title available?)
• Iteration-free PDL with intersection: A complete axiomatization
• PDL with intersection of programs: a complete axiomatization
• Propositional dynamic logic is weaker without tests
• Propositional dynamic logic of looping and converse is elementarily decidable
• Propositional dynamic logic of regular programs
• Reasoning about action and change. A dynamic logic approach

Cited in

(5)

• Iteration-free PDL with intersection: A complete axiomatization
• Strong completeness for iteration-free coalgebraic dynamic logics
• scientific article; zbMATH DE number 2066186 (Why is no real title available?)
• Iteration-free \(\mathrm{PDL}\) with storing, recovering and parallel composition: a complete axiomatization
• Axiomatization and computability of a variant of iteration-free PDL with fork

This page was built for publication: A canonical model construction for iteration-free PDL with intersection

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