Gödel's First Incompleteness Theorem

The theorem that any consistent, effectively axiomatized formal theory capable of representing a sufficient fragment of arithmetic contains true sentences that are not provable within that theory; it establishes a necessary gap between semantic truth and provability for such systems.