FANDOM


Godel
1906-1978

In 1931, "he proved for any computable axiomatic system that is powerful enough to describe the arithmetic of the natural numbers (e.g., the Peano axioms or Zermelo–Fraenkel set theory with the axiom of choice), that:

  1. If the system is consistent, it cannot be complete.
  2. The consistency of the axioms cannot be proved within the system."

This is known as "Godel's Second Incompleteness Theorem". It implies:

  1. Infinite nature of any knowledge

Worked together with Einstein at Princeton Institute for the Advanced Studies.

Ad blocker interference detected!


Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.