Strong Completeness and Limited Canonicity for PDL

Journal of Logic, Language and Information 17 (1):69-87 (2008)
  Copy   BIBTEX

Abstract

Propositional dynamic logic is complete but not compact. As a consequence, strong completeness requires an infinitary proof system. In this paper, we present a short proof for strong completeness of $$\mathsf{PDL}$$ relative to an infinitary proof system containing the rule from [α; β n ]φ for all $$n \in {\mathbb{N}}$$, conclude $$[\alpha;\beta^*] \varphi$$. The proof uses a universal canonical model, and it is generalized to other modal logics with infinitary proof rules, such as epistemic knowledge with common knowledge. Also, we show that the universal canonical model of $$\mathsf{PDL}$$ lacks the property of modal harmony, the analogue of the Truth lemma for modal operators.

Similar books and articles

Analytics

Added to PP
2014-01-23

Downloads
172 (#113,851)

6 months
83 (#68,401)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Barteld Kooi
University of Groningen

Citations of this work

Strong Completeness and Limited Canonicity for PDL.Gerard Renardel de Lavalette, Barteld Kooi & Rineke Verbrugge - 2009 - Journal of Logic, Language and Information 18 (2):291-292.
Sequential Dynamic Logic.Alexander Bochman & Dov M. Gabbay - 2012 - Journal of Logic, Language and Information 21 (3):279-298.

Add more citations

References found in this work

Dynamic Logic.Lenore D. Zuck & David Harel - 1989 - Journal of Symbolic Logic 54 (4):1480.
Mathematics of Modality.Robert Goldblatt - 1993 - Center for the Study of Language and Information Publications.
Axiomatising the Logic of Computer Programming.Robert Goldblatt - 1985 - Journal of Symbolic Logic 50 (3):854-855.

View all 9 references / Add more references