Completeness Theorem and Model Theory
In this section we prove the completeness theorem for first-order logic. We shall prove it in its second form (Theorem 4.4.8). The result for countable theories was first proved by Gödel in 1930. The result in its complete generality was first observed by Malcev in 1936. The proof given below is due to Leo Henkin.
KeywordsCompactness Theorem Completeness Theorem Canonical Structure Constant Symbol Conservative Extension
Unable to display preview. Download preview PDF.