Gö'del's incomplete'ness the"orem
— Logic, Math. Logic,Math.
- 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.
- the corollary that the consistency of such a system cannot be proved within the system.
Random House Unabridged Dictionary, Copyright © 1997, by Random House, Inc., on Infoplease.