O formalnie nierozstrzygalnych zdaniach Principia Mathematica i pokrewnych systemów I

Wprowadzenie

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.

Powiązania

Odpowiada na

• Principia mathematica1910 · Bertrand Russell

Podjęte w

• On Computable Numbers, with an Application to the Entscheidungsproblem (O liczbach obliczalnych z zastosowaniem do problemu rozstrzygalności)1936 · Alan Turing

Więcej dzieł: Kurt Gödel

• 1947What Is Cantor’s Continuum Problem? (Czym jest problem continuum Cantora?)