KURT GODEL

Tommy KingOctober 14, 2014

Kurt Godel

Godel was born on April 28, 1906

Kurt Godel was born Australian, but later became an American.

Godel died on January 14, 1978.

Personal Life

Kurt Godel was born in Brno, Australia to Rudolf and Marianne Godel.

Godel had one sibling named Rudolph.

Godel was married to Adele Nimbursky.

Kurt was known as “Mr.Why” because of his curiousity.

Kurt was sent to Evangelische Volksschule where he excelled in different languages and mathematics.

Godel was considered Jewish as he had many intelligent Jewish friends.

Awards

1975- National Medal of Science for Mathematics and Computer Science

1951- Albert Einstein Award

1967-Royal Academy and Honorary Member of the London Mathematical Society

1950-Speaker at International Congress

1951- AMS Gibbs Lecturer

Education

Kurt was educated in Deusches Staats Realgymnasium from 1916 to 1924.

Attended University of Vienna where he studied theoretical Physics.

Gained entrance into Institute of Advanced Study.

Early Work

Gordel completed his doctoral thesis in 1929.

Became an unpaid lecturer at University of Vienna.

In 1934, He traveled to Princeton where he gave a number of lectures.

He published his theorems in Uber Formal Unentscheidbare Satze der Principia Mathmatica in the year 1931.

He paid frequent visits to IAS in 1935. Became very close with Einstien and

Morgenstern. Received his first Albert Einstein

Award from Institute of Advanced Studies in 1951.

Wrote two papers before age 25.

Contributions to Computer Science

Pursued the ideal of establishing metaphysics as an exact axiomatic theory.

Published two technical papers on the general theory of relativity (1949).

Asserted that the axiom of constructability implies that there is a non-measurable set of real numbers.

Gödel's Incompleteness Theorems

First Incompleteness Theorem

Second Incompleteness Theorem

appeared as "Theorem VI" in Gödel's 1931 paper On Formally Undecidable Propositions in Principia Mathematica and Related Systems I.

shows that any consistent effective formal system that includes enough of the theory of the natural numbers is incomplete: there are true statements expressible in its language that are unprovable within the system.

appeared as "Theorem XI" in Gödel's 1931 paper On Formally Undecidable Propositions in Principia Mathematica and Related Systems I.

This strengthens the first incompleteness theorem, because the statement constructed in the first incompleteness theorem does not directly express the consistency of the theory.