It is a type of undecidability related to the limits of mathematical reasoning. The theorem states that any consistent axiomatic system of arithmetic is incomplete, meaning there will always be true statements that cannot be proved.
It is a type of undecidability related to the limits of mathematical reasoning. The theorem states that any consistent axiomatic system of arithmetic is incomplete, meaning there will always be true statements that cannot be proved.