Godel s incompleteness theorem

Details

  • Code:  10452223
  • Loopable:  Yes
  • Duration:  00:20
  • Aspect:  16:9
  • Alpha / Matte:  No

Visualization of Godel's incompleteness theorem

Gödel's incompleteness theorems are two theorems of mathematical logic that demonstrate the inherent limitations of every formal axiomatic system containing basic arithmetic. These results, published by Kurt Gödel in 1931, are important both in mathematical logic and in the philosophy of mathematics. The theorems are widely, but not universally, interpreted as showing that Hilbert's program to find a complete and consistent set of axioms for all mathematics is impossible.

Share

You may also like