[Home]Goedels completeness theorem

HomePage | Recent Changes | Preferences

Showing revision 7
Gödel's completeness theorem is a theorem in model theory proved by Kurt Gödel in 1929. It states that in first-order predicate calculus every universally valid statement can be proven. A statement is called universally valid if it is true in every domain in which the axioms hold. To cleanly state Gödel's completeness theorem, one therefore has to refer to an underlying set theory in order to clarify what the word "domain" in the previous sentence means.

The theorem can be seen as a justification of the logical axioms and inference rules of first-order logic. The rules are "complete" in the sense that they are strong enough to prove every universally valid statement. It was already known earlier that only universally valid statements can be proven in first-order logic.


References:

HomePage | Recent Changes | Preferences
This page is read-only | View other revisions | View current revision
Edited October 14, 2001 8:27 am by Anatoly Vorobey (diff)
Search: