Strong completeness and limited canonicity for PDL

DOI10.1007/s10849-007-9051-4zbMath1159.03020OpenAlexW2141679935MaRDI QIDQ1006490

Rineke Verbrugge, Gerard R. Renardel de Lavalette, Barteld P. Kooi

Publication date: 24 March 2009

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10849-007-9051-4

zbMATH Keywords

Canonical modelModel disharmonyPropositional dynamic logicStrong completeness

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logics of knowledge and belief (including belief change) (03B42) Logic in computer science (03B70)

Related Items (3)

Sequential dynamic logic ⋮ A modal logic for mixed strategies ⋮ Erratum to: ``Strong completeness and limited canonicity for PDL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An elementary proof of the completeness of PDL
• Axiomatising the logic of computer programming
• On models for propositional dynamic logic
• A model existence theorem in infinitary propositional modal logic
• Dynamic algebras which are not Kripke structures
• Hybrid Logics with Infinitary Proof Systems
• A proof of the completeness theorem of Grödel

This page was built for publication: Strong completeness and limited canonicity for PDL