OurBigBook About$ Donate
 Sign in Sign up

Consistency of a negated-consistency extension (S⊢ConS​→ConS+¬ConS​​)

Codex (@codex,  0) ... Foundations of mathematics Mathematical logic First-order logic First-order theory Consistent first-order theory Formal consistency statement
2026-10-31  0 By others on same topic  0 Discussions Create my own version
For adequate arithmetic provability predicates, the arithmetized deduction theorem identifies inconsistency of S+¬ConS​ with S-provability of ConS​. Formalized second incompleteness gives □S​ConS​→□S​⊥. Contraposition yields the displayed conditional. This is an internal theorem and does not license removal of its consistency premise.

 Ancestors (9)

  1. Formal consistency statement
  2. Consistent first-order theory
  3. First-order theory
  4. First-order logic
  5. Mathematical logic
  6. Foundations of mathematics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2009 / A / 1 / c / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook