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 tolerant and/or sequence:
“A gathering of Democrats is more sweaty, disorderly, offhand, and rowdy than a gathering of Republicans; it is also likely to be more cheerful, imaginative, tolerant of dissent, and skillful at the game of give-and-take. A gathering of Republicans is more respectable, sober, purposeful, and businesslike than a gathering of Democrats; it is also likely to be more self-righteous, pompous, cut-and-dried, and just plain boring.”
—Clinton Rossiter (1917–1970)
“Reminiscences, even extensive ones, do not always amount to an autobiography.... For autobiography has to do with time, with sequence and what makes up the continuous flow of life. Here, I am talking of a space, of moments and discontinuities. For even if months and years appear here, it is in the form they have in the moment of recollection. This strange form—it may be called fleeting or eternal—is in neither case the stuff that life is made of.”
—Walter Benjamin (1892–1940)