GÖDEL’s Completeness Theorem with Natural Language Formulas
Peter Koepke · 2007
We give a self-contained proof of the GÖDEL completeness theorem based on “natural language”. Utilizing a naive understanding of language, the semantics of natural language formulas is intuitively clear, which makes the correctness of our natural deduction style proof calculus immediate. The converse direction, including a HENKIN-style model construction, is more involved, but hopefully “natural”: as well.