Mathematics
Formal Proofs and Hilbert's Program
Quick fact
Hilbert's program aimed to prove that all of mathematics could be derived from a finite set of axioms using purely mechanical rules, but Gödel's second incompleteness theorem showed that any such system powerful enough for arithmetic cannot prove its own consistency—dealing a fatal blow to the program's original goals.
Why this is interesting
Imagine a mathematical proof so rigorous that every step could be checked by a machine—no intuition, no gaps. But what if even such a perfect proof system couldn't prove its own consistency?