Skip to Main content Skip to Navigation
Conference papers

Foundational proof certificates in first-order logic

Zakaria Chihani 1 Dale Miller 1 Fabien Renaud 1
1 PARSIFAL - Proof search and reasoning with logic specifications
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : It is the exception that provers share and trust each others proofs. One reason for this is that different provers structure their proof evidence in remarkably different ways, including, for example, proof scripts, resolution refutations, tableaux, Herbrand expansions, natural deductions, etc. In this paper, we propose an approach to foundational proof certificates as a means of flexibly presenting proof evidence so that a relatively simple and universal proof checker can check that a certificate does, indeed, elaborate to a formal proof. While we shall limit ourselves to first-order logic in this paper, we shall not limit ourselves in many other ways. Our framework for defining and checking proof certificates will work with classical and intuitionistic logics and with proof structures as diverse as resolution refutations, matings, and natural deduction.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-00906485
Contributor : Fabien Renaud <>
Submitted on : Tuesday, November 19, 2013 - 8:28:18 PM
Last modification on : Thursday, March 5, 2020 - 6:19:08 PM
Document(s) archivé(s) le : Thursday, February 20, 2014 - 9:45:40 AM

File

root.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00906485, version 1

Collections

Citation

Zakaria Chihani, Dale Miller, Fabien Renaud. Foundational proof certificates in first-order logic. CADE - 24th International Conference on Automated Deduction, Jun 2013, Lake Placid, United States. ⟨hal-00906485⟩

Share

Metrics

Record views

546

Files downloads

341