Answer:
Gödel's incompleteness theorems are two theorems of mathematical logic that demonstrate the inherent limitations of every formal axiomatic system capable of modelling basic arithmetic. ... The second incompleteness theorem, an extension of the first, shows that the system cannot demonstrate its own consistency.