Advertisement

Completeness Theorem and Model Theory

Part of the Universitext book series (UTX)

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.

Keywords

Compactness Theorem Completeness Theorem Canonical Structure Constant Symbol Conservative Extension 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2008

Personalised recommendations