Kurt Gödel (IPA: ) (April 28, 1906 Brno, then Austria-Hungary, now Czech Republic – January 14, 1978 Princeton, New Jersey) was a logician, mathematician, and philosopher of mathematics.
One of the most significant logicians of all time, Gödel's work has had immense impact upon scientific and philosophical thinking in the 20th century, a time when many, such as Bertrand Russell, A. N. Whitehead, and David Hilbert, were attempting to use logic and set theory to understand the foundations of mathematics.
Gödel is best known for his two incompleteness theorems, published in 1931 when he was 25 years of age, and only one year after finishing his doctorate at the University of Vienna. The more famous incompleteness theorem states that for any self-consistent recursive axiomatic system powerful enough to describe the arithmetic of the natural numbers (Peano arithmetic), there are true propositions about the naturals that cannot be proved from the axioms. To prove this theorem, Gödel developed a technique now known as Gödel numbering, which codes formal expressions as natural numbers.
More on [ Kurt Gödel ]
Declarative :: Languages
Garbage Collected :: Languages
Logic based :: Languages

Gödel Tutorial - A rather brief tutorial from Walla Walla.
The Gödel Programming Language - Declarative, general-purpose programming language in the set of logic languages. Strongly typed: type system based on many-sorted logic with parametric polymorphism.
The Gödel Programming Language - Experimental Gödel with Generic (Parametrised) Modules.
| Gödel, Turing y Cantor, más allá de la razón | |
| Next Video | |