Siteadmin, Bureaucrats, Check users, nsAm_Govt_101RO, nsAm_Govt_101RW, nsAm_Govt_101_ta, nsJudgesRO, nsJudgesRW, nsJudges_talkRO, nsJudges_talkRW, nsTeam2RO, nsTeam2RW, nsTeam2_talkRO, nsTeam2_talkRW, oversight, Administrators
125,794
edits
Changes
Jump to navigation
Jump to search
mLine 1:
Line 1: − +
Reverted edits by ComedyFan (Talk) to last version by RJJensen
[[Image:Goel.jpg|thumb|right|Kurt Godel at Institute for Advanced Study]]
[[Image:Goel.jpg|thumb|right|Kurt Godel at Institute for Advanced Study]]
'''Kurt Gödel''' (1906-1978) was an Austrian mathematician who did pioneering work in logic and the foundations of mathematics. His Incompleteness Theorem demonstrated some limitations of the program that would have placed all of mathematics on a complete axiomatic basis. He worked at the Institute for Advanced Study at princeton, NJ. His end was tragic: ''He was always somewhat prone to paranoia, was distrustful of doctors, and tended to feed himself poorly. When his wife was incapacitated with illness, these factors combined to cause his death from self-starvation. ''<ref>http://www.usna.edu/Users/math/meh/godel.html U.S. Naval Academy</ref>
'''Kurt Gödel''' (1906-1978) was an Austrian mathematician who did pioneering work in logic and the foundations of mathematics. His Incompleteness Theorem demonstrated some limitations of the program that would have placed all of mathematics on a complete axiomatic basis. He worked at the Institute for Advanced Study at princeton, NJ. he died insane after starving himself to death.
Gödel published his remarkable proof in 1931. He showed that in any consistent (first-order) axiomatic mathematical system there are always propositions that cannot be proved or disproved using the axioms of the system. He additionally showed that it is impossible to prove the consistency of the axioms from those same axioms. This was the famous incompleteness theorem: any axiomatic system powerful enough to describe arithmetic on natural numbers cannot be both consistent and complete. Moreover, the consistency of the axioms cannot be proven within the system.
Gödel published his remarkable proof in 1931. He showed that in any consistent (first-order) axiomatic mathematical system there are always propositions that cannot be proved or disproved using the axioms of the system. He additionally showed that it is impossible to prove the consistency of the axioms from those same axioms. This was the famous incompleteness theorem: any axiomatic system powerful enough to describe arithmetic on natural numbers cannot be both consistent and complete. Moreover, the consistency of the axioms cannot be proven within the system.