THEOREM OF THE DAY: Godel’s Second Incompleteness Theorem

Theorem

Let $T$ be a recursively enumerable axiomatisation of number theory. Then the consistency of $T$ cannot be proved as a theorem of $T$, i.e. “no falsehood can be derived from the axioms of $T$” cannot be derived from the axioms of $T$.

Click on the image.