A Sequent Calculus for First-Order Logic

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

July 18, 2019

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

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. Papers: ceur-ws.org/Vol-3002/paper7.pdf and doi.org/10.1093/logcom/exad013.

License

BSD License

Topics

Session FOL_Seq_Calc1

Depends on

Used by

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{https://isa-afp.org/entries/FOL_Seq_Calc1.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: