Gödel's proof

Gödel's proof

[′gərd·əlz ′prüf] (mathematics) Any formal arithmetical system is incomplete in the sense that, given any consistent set of arithmetical axioms, there are true statements in the resulting arithmetical system that cannot be derived from these axioms.