Gödel's Incompleteness

mathematical theorem
GenRank Score
9.8

A mathematical theorem by Kurt Gödel (1931) stating that any consistent axiomatic system rich enough to contain arithmetic contains undecidable propositions.

Also Known As

Gödel's Incompleteness
1 question1 category

Score History

Loading score data...
Mention Rank: #11