From Syntactic Proofs to Combinatorial Proofs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2018

From Syntactic Proofs to Combinatorial Proofs


In this paper we investigate Hughes’ combinatorial proofs as a notion of proof identity for classical logic. We show for various syntactic formalisms including sequent calculus, analytic tableaux, and resolution, how they can be translated into combinatorial proofs, and which notion of identity they enforce. This allows the comparison of proofs that are given in different formalisms.
Fichier principal
Vignette du fichier
tableau-def.pdf (390.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01942275 , version 1 (03-12-2018)


  • HAL Id : hal-01942275 , version 1


Matteo Acclavio, Lutz Strassburger. From Syntactic Proofs to Combinatorial Proofs. International Joint Conference on Automated Reasoning, IJCAR 2018, Springer, pp.481-497, 2018, 978-3-319-94204-9. ⟨hal-01942275⟩
70 View
123 Download


Gmail Facebook X LinkedIn More