Gödel’s Incompleteness Theorems

For any axiomatic theory (including axiomatizations of arithmetic), there will be a sentencein the language of the theory that cannot be proved. Such a sentence may be either a true sentence of the theory (the First Incompleteness Theorem) or a sentence expressing the consistency of the theory (the Second In completeness Theorem).