Gödel's Incompleteness Theorems/Second

Theorem

Let $T$ be the set of theorems of some recursive set of sentences in the language of arithmetic such that $T$ contains minimal arithmetic.

Let $\map {\mathrm {Cons} } T$ be the propositional function which states that $T$ is consistent.

Then it is not possible to prove $\map {\mathrm {Cons} } T$ by means of formal statements within $T$ itself.


Proof


This theorem requires a proof.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.


Also see


Source of Name

This entry was named for Kurt Friedrich Gödel.


Sources

  • 1998: David Nelson: The Penguin Dictionary of Mathematics (2nd ed.) ... (previous) ... (next): Gödel's proof
  • 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): Gödel's proof
  • 2014: Christopher Clapham and James Nicholson: The Concise Oxford Dictionary of Mathematics (5th ed.) ... (previous) ... (next): Gödel's Incompleteness Theorems
This article is issued from ProofWiki. The text is available under Creative Commons Attribution-ShareAlike License unless otherwise noted. Additional terms may apply for the media files.