Answer
Gödel's completeness theorem is one of the most important results in logic and the foundations of mathematics. It states that every consistent system of axioms whose theorems can be listed by an "effective procedure" (essentially, a computer program) is also complete: every statement that can be expressed in the system is either provable or disprovable. This theorem has a number of important consequences.