A Sequent Calculus for First-Order Logic

Asta Halkjær From with contributions from Alexander Birch Jensen, Anders Schlichtkrull and Jørgen Villadsen

18 July 2019

Abstract

This work formalizes soundness and completeness of a one-sided sequent calculus for first-order logic. The completeness is shown via a translation from a complete semantic tableau calculus, the proof of which is based on the First-Order Logic According to Fitting theory. The calculi and proof techniques are taken from Ben-Ari's Mathematical Logic for Computer Science. Paper: http://ceur-ws.org/Vol-3002/paper7.pdf.
BSD License

Depends On

Topics

Theories

Cite

×
@article{FOL_Seq_Calc1-AFP,
  author  = {Asta Halkjær From},
  title   = {A Sequent Calculus for First-Order Logic},
  journal = {Archive of Formal Proofs},
  month   = July,
  year    = 2019,
  note    = {\url{http://isa-afp.org/entries/FOL_Seq_Calc1.html},
            Formal proof development},
  ISSN    = {2150-914x},
}
Download