godels in-completeness theorems

Gödel's incompleteness theorem

noun Logic, Mathematics.
1.
the theorem that states that in a formal logical system incorporating the properties of the natural numbers, there exists at least one formula that can be neither proved nor disproved within the system.
2.
the corollary that the consistency of such a system cannot be proved within the system.

Origin:
after K. Gödel, who formulated it

Dictionary.com Unabridged
Based on the Random House Dictionary, © Random House, Inc. 2014.
Cite This Source Link To godels in-completeness theorems
Explore Dictionary.com
More from Thesaurus.com
Synonyms and Antonyms for godels in-completeness theorems
More from Reference.com
Search for articles containing godels in-completeness theorems
Dictionary.com Word FAQs

Dictionary.com presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014 Dictionary.com, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature