godel demostration?

0 ⤊

simple

2006-12-10 22:31:35 · 2 answers · asked by javavall2003 1 in Science & Mathematics ➔ Mathematics

2 answers

In mathematical logic, Gödel's incompleteness theorems are two celebrated theorems about the limitations of formal systems, proved by Kurt Gödel in 1931.

These theorems show that there is no complete, consistent formal system that correctly describes the natural numbers, and that no sufficiently strong system describing the natural numbers can prove its own consistency. These theorems are widely regarded as showing that Hilbert's program to find a complete and consistent set of axioms for all of mathematics is impossible. The theorems have also been interpreted in philosophy and popular culture.

2006-12-10 22:39:51 · answer #1 · answered by Don 2 · 0⤊ 0⤋

see the link

2006-12-10 22:40:45 · answer #2 · answered by maussy 7 · 0⤊ 0⤋