A Syntactic and Categorical Derivation of Gödel's Completeness Theorem

Abstract: Considering classical first-order logic with equality, we give a "fully syntactic" construction of the (weak) syntactic category $\text{Syn}(T)$ associated to a consistent theory $T$; we show it is a consistent coherent category; and we show that a morphism of coherent categories $\text{Syn}(T)\to \bf{Set}$ gives rise to a model $\mathcal{M}$ of $T$ in the usual sense. We then invoke Deligne's theorem on small consistent coherent categories.