Lesson plan
Tolerant sequence
In mathematical logic, a tolerant sequence is a sequence : T_1 ,..., T_n of formal theories such that there are consistent extensions : S_1 ,..., S_n of these theories with each S_{i+1} interpretable in S_i . Tolerance naturally generalizes from sequences of theories to trees of theories. Weak interpretability can be shown to be a special, binary case of tolerance. This concept, together with its dual concept of cotolerance, was introduced by Japaridze in 1992, who also proved that, for Peano arithmetic and any stronger theories with computable axiomatizations, tolerance is equivalent to \Pi_1 -consistency.
Article summary
In mathematical logic, a tolerant sequence is a sequence : T_1 ,..., T_n of formal theories such that there are consistent extensions : S_1 ,..., S_n of these theories with each S_{i+1} interpretable in S_i . Tolerance naturally generalizes from sequences of theories to trees of theories. Weak interpretability can be shown to be a special, binary case of tolerance. This concept, together with its dual concept of cotolerance, was introduced by Japaridze in 1992, who also proved that, for Peano arithmetic and any stronger theories with computable axiomatizations, tolerance is equivalent to \Pi_1 -consistency.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.