Combinatorial Proofs and Decomposition Theorems for First-order Logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

Combinatorial Proofs and Decomposition Theorems for First-order Logic

Abstract

We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a syntax-free presentation of a proof that is independent from any set of inference rules. We show that the two proof representations are related via a deep inference decomposition theorem that establishes a new kind of normal form for syntactic proofs. This yields (a) a simple proof of soundness and completeness for firstorder combinatorial proofs, and (b) a full completeness theorem: every combinatorial proof is the image of a syntactic proof.
Fichier principal
Vignette du fichier
2104.13124.pdf (347.33 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03369764 , version 1 (07-10-2021)

Licence

Identifiers

Cite

Dominic J D Hughes, Lutz Strassburger, Jui-Hsuan Wu. Combinatorial Proofs and Decomposition Theorems for First-order Logic. 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2021, Rome, Italy. pp.1-13, ⟨10.1109/LICS52264.2021.9470579⟩. ⟨hal-03369764⟩
40 View
92 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More