哥德尔的一阶逻辑完全性证明的原始版本.pdfVIP

StudiesinLogic,Vol.4, No. 1 (2011):101–108 PII:1674-3202(2011)-01-0101-08 Gödel’sOriginalVersionof the CompletenessProof for First-OrderLogic Eberhard Guhe Schoolofphilosophy,Fudan University guhe@fudan.edu.cn Abstract. The purpose of the present paper is to revive the study of Kurt Gödel’s largely forgotten original version of the completeness proof for first-order logic by presenting it in a terminologically and notationally updatedform. Kurt Gödel’s doctoral dissertation “Über die Vollständigkeit des Logikkalküls” ([2], 60f.) contains the first proof of the completeness theorem for first-order logic. Gödel later rewrote his dissertation as an article ([2], 102f. and [3]). The proof is essentially the same in the dissertation and the printed version. The completeness proofmostlygivenintoday’stextbooksonfirst-orderlogicispatternedafteronegiven by Leon Henkin in his dissertation, published in 1949. Whereas Gödel proves the completenessonly forcountablelanguages,Henkin’sproof, which is quite different, generalizes easily to languages of any cardinality. The present paper is an attempt to make Gödel’s ingenious alternative approach accessible to a modern audience by 1 updatingtheterminologyandnotationalconventions. Specialattentionwillbepaid toexplicatingthatpartoftheproofwhichinvolvesanapplicationofKönig’sLemma2 (publishedinpapersin1926and1927),althoughGödeldoes not cite König. Thecompletenessoffirst-orderlogiccanbestatedinthefollowing way: Theorem1 If φ isaformulaof afirst-orderlanguage,then: φ ⊢ φ. Gödelprovescompletenessoffirst-orderlogicforacountablelanguage which consistsofthefollowingsymbols: a) a countable set of individual variables (meta-linguistically denoted by , or ), b) acountabl