Kurt Gödel
![Gödel {{circa}} 1926](https://upload.wikimedia.org/wikipedia/commons/4/42/Kurt_g%C3%B6del.jpg)
Gödel's discoveries in the foundations of mathematics led to the proof of his completeness theorem in 1929 as part of his dissertation to earn a doctorate at the University of Vienna, and the publication of Gödel's incompleteness theorems two years later, in 1931. The first incompleteness theorem states that for any ω-consistent recursive axiomatic system powerful enough to describe the arithmetic of the natural numbers (for example, Peano arithmetic), there are true propositions about the natural numbers that can be neither proved nor disproved from the axioms. To prove this, Gödel developed a technique now known as Gödel numbering, which codes formal expressions as natural numbers. The second incompleteness theorem, which follows from the first, states that the system cannot prove its own consistency.
Gödel also showed that neither the axiom of choice nor the continuum hypothesis can be disproved from the accepted Zermelo–Fraenkel set theory, assuming that its axioms are consistent. The former result opened the door for mathematicians to assume the axiom of choice in their proofs. He also made important contributions to proof theory by clarifying the connections between classical logic, intuitionistic logic, and modal logic. Provided by Wikipedia
-
1
-
2
-
3