ArticleslgStudy

mathematics

On Formally Undecidable Propositions of Principia Mathematica and Related Systems

On Formally Undecidable Propositions of Principia Mathematica and Related Systems is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand On Formally Undecidable Propositions of Principia Mathematica and Related Systems rather than just read about it. In short: "Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I" ("On Formally Undecidable Propositions of Principia Mathematica and Related Systems I") is a paper in mathematical logic by Kurt Gödel. Submitted November 17, 1930, it was originally published in German in the 1931 volume of Monatshefte für Mathematik und Physik.

Key takeaways

  • On Formally Undecidable Propositions of Principia Mathematica and Related Systems belongs to mathematics; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect On Formally Undecidable Propositions of Principia Mathematica and Related Systems to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of On Formally Undecidable Propositions of Principia Mathematica and Related Systems from memory before moving on to harder problems.

Reference excerpt

"Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I" ("On Formally Undecidable Propositions of Principia Mathematica and Related Systems I") is a paper in mathematical logic by Kurt Gödel. Submitted November 17, 1930, it was originally published in German in the 1931 volume of Monatshefte für Mathematik und Physik. Several English translations have appeared in print, and the paper has been included in two collections of classic mathematical logic papers. The paper contains Gödel's incompleteness theorems, now fundamental results in logic that have many implications for consistency proofs in mathematics. The paper is also known for introducing new techniques that Gödel invented to prove the incompleteness theorems.

Outline and key results The main results established are Gödel's first and second incompleteness theorems, which have had an enormous impact on the field of mathematical logic. These appear as theorems VI and XI, respectively, in the paper. In order to prove these results, Gödel introduced a method now known as Gödel numbering. In this method, each sentence and formal proof in first-order arithmetic is assigned a particular natural number. Gödel shows that many properties of these proofs can be defined within any theory of arithmetic that is strong enough to define the primitive recursive functions. (The contemporary terminology for recursive functions and primitive recursive functions had not yet been established when the paper was published; Gödel used the word rekursiv ("recursive") for what are now known as primitive recursive functions.) The method of Gödel numbering has since become common in mathematical logic. Because the method of Gödel numbering was novel, and to avoid any ambiguity, Gödel presented a list of 45 explicit formal definitions of primitive recursive functions and relations used to manipulate and test Gödel numbers. He used these to give an explicit definition of a formula Bew(x) that is true if and only if x is the Gödel number of a sentence φ and there exists a natural number that is the Gödel number of a proof of φ. The name of this formula derives from Beweis, the German word for proof. A second new technique invented by Gödel in this paper was the use of self-referential sentences. Gödel showed that the classical paradoxes of self-reference, such as "This statement is false", can be recast as self-referential formal sentences of arithmetic. Informally, the sentence employed to prove Gödel's first incompleteness theorem says "This statement is not provable." The fact that such self-reference can be expressed within arithmetic was not known until Gödel's paper appeared; independent work of Alfred Tarski on his indefinability theorem was conducted around the same time but not published until 1936. In footnote 48a, Gödel stated that a planned second part of the paper would establish a link between consistency proofs and type theory (hence the "I" at the end of the paper's title, denoting the first part), but Gödel did not publish a second part of the paper before his death. His 1958 paper in Dialectica did, however, show how type theory can be used to give a consistency proof for arithmetic.

Published English translations During his lifetime three English translations of Gödel's paper were printed, but the process was not without difficulty. The first English translation was by Bernard Meltzer; it was published in 1963 as a standalone work by Basic Books and has since been reprinted by Dover and reprinted by Hawking (God Created the Integers, Running Press, 2005:1097ff). The Meltzer version—described by Raymond Smullyan as a 'nice translation'—was adversely reviewed by Stefan Bauer-Mengelberg (1966). According to Dawson's biography of Gödel (Dawson 1997:216),

Fortunately, the Meltzer translation was soon supplanted by a better one prepared by Elliott Mendelson for Martin Davis's anthology The Undecidable; but it too was not brought to Gödel's attention until almost the last minute, and the new translation was still not wholly to his liking ... when informed that there was not time enough to consider substituting another text, he declared that Mendelson's translation was 'on the whole very good' and agreed to its publication. [Afterward he would regret his compliance, for the published volume was marred throughout by sloppy typography and numerous misprints.] The translation by Elliott Mendelson appears in the collection The Undecidable (Davis 1965:5ff). This translation also received a harsh review by Bauer-Mengelberg (1966), who in addition to giving a detailed list of the typographical errors also described what he believed to be serious errors in the translation. A translation by Jean van Heijenoort appears in the collection From Frege to Gödel: A Source Book in Mathematical Logic (van Heijenoort 1967). A review by Alonzo Church (1972) described this as "the most careful translation that has been made" but also gave some specific criticisms of it. Dawson (1997:216) notes:

The translation Gödel favored was that by Jean van Heijenoort ... In the preface to the volume van Heijenoort noted that Gödel was one of four authors who had personally read and approved the translations of his works.

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with On Formally Undecidable Propositions of Principia Mathematica and Related Systems

Start with the simplest possible case. Write down what On Formally Undecidable Propositions of Principia Mathematica and Related Systems claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to On Formally Undecidable Propositions of Principia Mathematica and Related Systems before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about On Formally Undecidable Propositions of Principia Mathematica and Related Systems ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of On Formally Undecidable Propositions of Principia Mathematica and Related Systems

In research
On Formally Undecidable Propositions of Principia Mathematica and Related Systems appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses On Formally Undecidable Propositions of Principia Mathematica and Related Systems in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
On Formally Undecidable Propositions of Principia Mathematica and Related Systems is common in secondary-school and first-year university syllabi. It links to neighbouring topics 1931 documents, 1931 in science, Logic literature, so understanding it makes those chapters shorter.
In everyday life
Look for On Formally Undecidable Propositions of Principia Mathematica and Related Systems outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “On Formally Undecidable Propositions of Principia Mathematica and Related Systems” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study On Formally Undecidable Propositions of Principia Mathematica and Related Systems in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what On Formally Undecidable Propositions of Principia Mathematica and Related Systems means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain On Formally Undecidable Propositions of Principia Mathematica and Related Systems out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is On Formally Undecidable Propositions of Principia Mathematica and Related Systems in simple terms?

"Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I" ("On Formally Undecidable Propositions of Principia Mathematica and Related Systems I") is a paper in mathematical logic by Kurt Gödel. Submitted November 17, 1930, it was originally published in German in the 19…

Why does On Formally Undecidable Propositions of Principia Mathematica and Related Systems matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study On Formally Undecidable Propositions of Principia Mathematica and Related Systems?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on On Formally Undecidable Propositions of Principia Mathematica and Related Systems.

Tags

  • 1931 documents
  • 1931 in science
  • Logic literature
  • Mathematical logic
  • Mathematics papers
  • Works by Kurt Gödel
  • Works originally published in German magazines
  • Works originally published in science and technology magazines

Keep exploring