n. the theorem 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. Also called Gö′del's incomplete′ness the`orem.[after K. Gödel, who formulated it]