A strongly complete proof system for propositional dynamic logic

Onderzoeksoutput: ChapterAcademic

Samenvatting

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.
Originele taal-2English
TitelInstitut de Recherche en Informatique de Toulouse IRIT (2002)
UitgeverijUniversity of Groningen, Johann Bernoulli Institute for Mathematics and Computer Science
Pagina's377-393
Aantal pagina's17
StatusPublished - 2002

Vingerafdruk

Duik in de onderzoeksthema's van 'A strongly complete proof system for propositional dynamic logic'. Samen vormen ze een unieke vingerafdruk.

Citeer dit