Academia.eduAcademia.edu

Kurt Gödel, Paper on the Incompleteness Theorems (1931)

2005

Gödel's incompleteness results are two of the most fundamental and important contributions to logic and the foundations of mathematics. He showed that no axiomatizable formal system strong enough to capture elementary number theory can prove every true sentence in its language. This theorem is an important limiting result regarding the power of formal axiomatics, but has also been of immense importance in other areas, such as the theory of computability.

This document is currently being converted. Please check back in a few minutes.