 | | PRINCIPIA CYBERNETICA WEB | - | © |
|
|
Parent Node(s):
INCOMPLETENESS THEOREM
Goedel's thesis initially about number theory but now found applicable to all formal systems that include the arithmetic of natural numbers: "any consistent axiomatic system does include propositions whose truth is undecidable within that system and its consistency is, hence, not provable within that system". The self-reference involved invokes the paradox: "a formal system of some complexity cannot be both consistent and decidable at the same time". The theorem rendered Frege, Russell and Whitehead's ideals of finding a few axions of mathematics from which all and only true statements can be deduced non-achievable. It has profound implications for theories of human cognition, computational linguistics and limits artificial intelligence in particular. (Krippendorff)
URL= http://cleamc11.vub.ac.be/ASC/INCOMP_THEOR.html