论《数学原理》及相关系统中的形式不可判定命题 I

简介

Kurt Gödel, aged 24 and working in Vienna, announced the result at a conference in Königsberg in September 1930; the paper appeared in the Monatshefte für Mathematik und Physik in 1931. It concerns formal systems strong enough to express elementary arithmetic, such as the system of Russell and Whitehead’s Principia Mathematica. Gödel encodes formulas and proofs as numbers (“Gödel numbering”) and constructs a sentence that in effect says of itself that it cannot be proved; if the system is consistent, this sentence is true but unprovable within it. The second theorem follows from this. The result is generally taken to have defeated the original aim of David Hilbert’s programme, to secure all of mathematics by a finitary consistency proof. The planned Part II never appeared.

联系

回应了

• 数学原理1910 · 伯特兰·罗素

被承接于

• 论可计算数及其在判定问题上的应用1936 · 艾伦·图灵

库尔特·哥德尔 的更多作品

• 1947什么是康托尔的连续统问题？