Soundness and Completeness Proofs by Coinductive Methods - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Automated Reasoning Année : 2017

Soundness and Completeness Proofs by Coinductive Methods

Résumé

We show how codatatypes can be employed to produce compact, high-level proofs of key results in logic: the soundness and completeness of proof systems for variations of first-order logic. For the classical completeness result, we first establish an abstract property of possibly infinite derivation trees. The abstract proof can be instantiated for a wide range of Gentzen and tableau systems for various flavors of first-order logic. Soundness becomes interesting as soon as one allows infinite proofs of first-order formulas. This forms the subject of several cyclic proof systems for first-order logic augmented with inductive predicate definitions studied in the literature. All the discussed results are formalized using Isa-belle/HOL's recently introduced support for codatatypes and corecursion. The development illustrates some unique features of Isabelle/HOL's new coinductive specification language such as nesting through non-free types and mixed recursion–corecursion.
Fichier principal
Vignette du fichier
compl.pdf (293.57 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01643157 , version 1 (21-11-2017)

Identifiants

Citer

Jasmin Christian Blanchette, Andrei Popescu, Dmitriy Traytel. Soundness and Completeness Proofs by Coinductive Methods. Journal of Automated Reasoning, 2017, 58 (1), pp.149 - 179. ⟨10.1007/s10817-016-9391-3⟩. ⟨hal-01643157⟩
278 Consultations
300 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More