Abstract
We formalize in Isabelle/HOL soundness and completeness of a one-sided sequent calculus for first-order logic. The completeness is shown via a translation from a semantic tableau calculus, whose completeness proof we base on the theory entry “First-Order Logic According to Fitting” by Berghofer in the Archive of Formal Proofs (AFP). The calculi and proof techniques are taken from Ben-Ari’s textbook Mathematical Logic for Computer Science (Springer 2012). We thereby demonstrate that Berghofer’s approach works not only for natural deduction but constitutes a framework for mechanically-checked completeness proofs for a range of proof systems.
| Original language | English |
|---|---|
| Article number | 7 |
| Journal | CEUR Workshop Proceedings |
| Volume | 3002 |
| Pages (from-to) | 107-121 |
| ISSN | 1613-0073 |
| Publication status | Published - 2021 |
| Event | 36th Italian Conference on Computational Logic (CILC 2021) - Parma, Italy Duration: 7 Sept 2021 → 9 Sept 2021 |
Conference
| Conference | 36th Italian Conference on Computational Logic (CILC 2021) |
|---|---|
| Country/Territory | Italy |
| City | Parma |
| Period | 07/09/2021 → 09/09/2021 |