Gödel’s Theorem
Italian version In 1930, the Austrian logician and mathematician Kurt Gödel, one of the most profound minds of the century, formulated his two incompleteness theorems. The first theorem states that a formal system that includes arithmetic cannot be both consistent—that is, free of contradictions—and complete—that is, capable of proving all the truths of the system. If we do not want to sacrifice consistency, we must accept that there are propositions that cannot be proven—the so-called undecidable propositions.The liar’s paradox offers…