Tolerant sequence
≈ 2 min read
Names in other languages
- EnglishTolerant sequence
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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.
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.
References
G. Japaridze, The logic of linear tolerance. Studia Logica 51 (1992), pp. 249–277. G. Japaridze, A generalized notion of weak interpretability and the corresponding logic. Annals of Pure and Applied Logic 61 (1993), pp. 113–160. G. Japaridze and D. de Jongh, The logic of provability. Handbook of Proof Theory. S. Buss, ed. Elsevier, 1998, pp. 476–546.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1334265963 under CC BY-SA 4.0; modifications have been made.