Strong completeness and limited canonicity for PDL

DOI10.1007/S10849-007-9051-4zbMATH Open1159.03020OpenAlexW2141679935MaRDI QIDQ1006490FDOQ1006490

Gerard R. Renardel de Lavalette, Rineke Verbrugge, Barteld 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

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

Cites Work

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

Cited In (4)

• A modal logic for mixed strategies
• (Heterogeneous) structured specifications in logics without interpolation
• Erratum to: ``Strong completeness and limited canonicity for PDL
• Sequential dynamic logic

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

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