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 effective axiomatizations, tolerance is equivalent to \Pi_1-consistency. See also: interpretability, cointerpretability, interpretability logic.

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.

 

<< PreviousWord BrowserNext >>
garraf
list of kentucky rivers
david zinman
namakkal
international standard bibliographic description
principle of uniformity
happy together (song)
existence of god
saburo ishikura
interpretability
christianization
lake walen
reference ellipsoid
perineal massage
white castle (restaurant)
turan graph
obshtina nessebar
white castle
pale flax
emil petrovici
cointerpretability
list of asteroids (2001 3000)
lilydale
appalachian folk music
australian graduate school of management
list of population of canada by years
philip smith
crediton
jon faddis
hung jury
list of state leaders in 1988
transformationalism
cotolerant sequence
chris ward
canadian federal election, 1945
easy
beaumaris
lucienne robillard
stephen lee
guillermo coria
gluteus maximus
minister of industry (canada)
yves fremion
responsible drug use