A Sequent Calculus Prover for First-Order Logic with Functions (Q7361480)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry FOL_Seq_Calc2
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Sequent Calculus Prover for First-Order Logic with Functions |
AFP entry FOL_Seq_Calc2 |
Statements
31 January 2022
0 references
Asta Halkjær From
0 references
Frederik Krogsdal Jacobsen
0 references
A Sequent Calculus Prover for First-Order Logic with Functions (English)
0 references
We formalize an automated theorem prover for first-order logic with functions. The proof search procedure is based on sequent calculus and we verify its soundness and completeness using the Abstract Soundness and Abstract Completeness theories. Our analytic completeness proof covers both open and closed formulas. Since our deterministic prover considers only the subset of terms relevant to proving a given sequent, we do so as well when building a countermodel from a failed proof. We formally connect our prover with the proof system and semantics of the existing SeCaV system. In particular, the prover's output can be post-processed in Haskell to generate human-readable SeCaV proofs which are also machine-verifiable proof certificates. Paper: doi.org/10.4230/LIPIcs.ITP.2022.13 .
0 references
