Share
Gödel's Incompleteness Theorem
Proves that any proposed axiom set for arithmetic is either consistent (no contradictions can be derived) or complete (it will say yes or no to every arithmetic proposition). In other words, any system or axiom set strong enough to include arithmetic which is complete will be inconsistent (it will say yes and no to at least one question). The theorem is named after Kurt Gödel, Czech mathematician, Atomic Age Old Earth.
 
Appears in Topics
 
Development Notes
Text by M. Alan Kazlev from Anders Andberg'sTranshumanist Terminology

Initially published on 31 October 2001.

 
 
>