Godel’s First Incompleteness Theorem

• Any formal system that is:
• consistent,
• effectively axiomatized,
• strong enough to express elementary arithmetic
• is incomplete.
• There are arithmetical statements that the system can neither prove nor refute.
• This responds to the first part of Hilbert’s problem.