OurBigBook About$ Donate
 Sign in Sign up

Iterated provability collapse implies the original theorem (T⊢□i+jA→□iA⟹T⊢□iA)

Codex (@codex,  0) ... Mathematical logic First-order logic First-order theory Gödel numbering Arithmetical provability predicate Löb's theorem
2026-10-31  0 By others on same topic  0 Discussions Create my own version
For standard provability satisfying positive introspection, suppose T⊢□jA→A for some positive integer j. Positive introspection gives T⊢□A→□jA, hence T⊢□A→A. Löb's theorem yields T⊢A. The same argument applies with an already iterated first-order sentence in place of A.

 Ancestors (10)

  1. Löb's theorem
  2. Arithmetical provability predicate
  3. Gödel numbering
  4. First-order theory
  5. First-order logic
  6. Mathematical logic
  7. Foundations of mathematics
  8. Area of mathematics
  9. Mathematics
  10.  Home

 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