First page Back Continue Last page Image
Godel’s Second Incompleteness Theorem
- Any formal system that is:
- consistent,
- effectively axiomatized,
- strong enough to express elementary arithmetic
- Cannot prove its own consistency.
- This responds to the second part of Hilbert’s problem