A Sequent Calculus Prover for First-Order Logic with Functions

 

Title: A Sequent Calculus Prover for First-Order Logic with Functions
Authors: Asta Halkjær From and Frederik Krogsdal Jacobsen
Submission date: 2022-01-31
Abstract: 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.
BibTeX:
@article{FOL_Seq_Calc2-AFP,
  author  = {Asta Halkjær From and Frederik Krogsdal Jacobsen},
  title   = {A Sequent Calculus Prover for First-Order Logic with Functions},
  journal = {Archive of Formal Proofs},
  month   = jan,
  year    = 2022,
  note    = {\url{https://isa-afp.org/entries/FOL_Seq_Calc2.html},
            Formal proof development},
  ISSN    = {2150-914x},
}
License: BSD License
Depends on: Abstract_Completeness, Abstract_Soundness, Collections, FOL_Seq_Calc1
Status: [ok] This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.