Abstract Completeness

Jasmin Christian Blanchette 🌐, Andrei Popescu 🌐 and Dmitriy Traytel 🌐

April 16, 2014

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


A formalization of an abstract property of possibly infinite derivation trees (modeled by a codatatype), representing the core of a proof (in Beth/Hintikka style) of the first-order logic completeness theorem, independent of the concrete syntax or inference rules. This work is described in detail in the IJCAR 2014 publication by the authors. The abstract proof can be instantiated for a wide range of Gentzen and tableau systems as well as various flavors of FOL---e.g., with or without predicates, equality, or sorts. Here, we give only a toy example instantiation with classical propositional logic. A more serious instance---many-sorted FOL with equality---is described elsewhere [Blanchette and Popescu, FroCoS 2013].


BSD License


Session Abstract_Completeness