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.


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.


BSD License


Session FOL_Seq_Calc1