A strongly complete proof system for propositional dynamic logic

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

Abstract

Propositional dynamic logic (PDL) is complete but not compact. As a consequence, strong completeness (the property Γ |= φ ⇒ Γ |- φ) does not hold for the standard finitary axiomatisation. In this paper, we present an infinitary proof system of PDL and prove strong completeness. The result is extended to epistemic logic with common knowledge.
Original languageEnglish
Title of host publicationInstitut de Recherche en Informatique de Toulouse IRIT (2002)
PublisherUniversity of Groningen, Johann Bernoulli Institute for Mathematics and Computer Science
Pages377-393
Number of pages17
Publication statusPublished - 2002

Fingerprint

Dive into the research topics of 'A strongly complete proof system for propositional dynamic logic'. Together they form a unique fingerprint.

Cite this