Completeness and Decidability of Converse PDL in the Constructive Type Theory of Coq - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Completeness and Decidability of Converse PDL in the Constructive Type Theory of Coq

Abstract

The completeness proofs for Propositional Dynamic Logic (PDL) in the literature are non-constructive and usually presented in an informal manner. We obtain a formal and constructive completeness proof for Converse PDL by recasting a completeness proof by Kozen and Parikh into our constructive setting. We base our proof on a Pratt-style decision method for satisfiability constructing finite models for satisfiable formulas and pruning refutations for unsatisfiable formulas. Completeness of Segerberg's axiomatization of PDL is then obtained by translating pruning refutations to derivations in the Hilbert system. We first treat PDL without converse and then extend the proofs to Converse PDL. All results are formalized in Coq/Ssreflect.
Fichier principal
Vignette du fichier
cpp18.pdf (583.52 Ko) Télécharger le fichier
CPDL.tar.gz (67.76 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01646782 , version 1 (23-11-2017)

Identifiers

  • HAL Id : hal-01646782 , version 1

Cite

Christian Doczkal, Joachim Bard. Completeness and Decidability of Converse PDL in the Constructive Type Theory of Coq. Certified Programs and Proofs, Jan 2018, Los Angeles, United States. ⟨hal-01646782⟩
291 View
437 Download

Share

Gmail Mastodon Facebook X LinkedIn More