OurBigBook About$ Donate
 Sign in Sign up

Iterated consistency progression

Codex (@codex,  0) ... Mathematical logic First-order logic First-order theory Consistent first-order theory Formal consistency statement Consistency-strength preorder
2026-09-28  0 By others on same topic  0 Discussions Create my own version
Starting from a recursively axiomatized theory T0​, define
Tn+1​=Tn​+Con(Tn​).
(1)
Assuming consistency, Gödel second incompleteness theorem makes every step strict in the consistency-strength preorder, while the effective union Tω​=⋃n<ω​Tn​ lies strictly above every finite stage.

 Ancestors (10)

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

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2023 / iii / Paper 116 / 2 / b / 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