# Gödel's completeness theorem

Gödel's completeness theorem is a fundamental theorem in mathematical logic that establishes a correspondence between semantic truth and syntactic provability in first-order logic. It makes a close link between model theory that deals with what is true in different models, and proof theory that studies what can be formally proven in particular formal systems. It was first proved by Kurt Gödel in 1929. It was then simplified in 1947, when Leon Henkin observed in his Ph.D. thesis that the hard part of the proof can be presented as the Model Existence Theorem (published in 1949). Henkin's proof was simplified by Gisbert Hasenjaeger in 1953.

## Words

This table shows the example usage of word lists for keywords extraction from the text above.

Word | Word Frequency | Number of Articles | Relevance |
---|---|---|---|

theorem | 5 | 4782 | 0.318 |

completeness | 3 | 385 | 0.259 |

gödel's | 2 | 67 | 0.204 |

proof | 3 | 4048 | 0.195 |

gödel | 2 | 173 | 0.187 |