In mathematical logic, a tolerant sequence is a sequence
of formal theories such that there are consistent extensions
of these theories with each interpretable in . 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 -consistency.
Famous quotes containing the words sequence and/or tolerant:
“It isnt that you subordinate your ideas to the force of the facts in autobiography but that you construct a sequence of stories to bind up the facts with a persuasive hypothesis that unravels your historys meaning.”
—Philip Roth (b. 1933)
“There is not a Musselman alive who would not imagine that he was performing an action pleasing to God and his Holy Prophet by exterminating every Christian on earth, while the Christians are scarcely more tolerant on their side.”
—Denis Diderot (17131784)