In
mathematical logic
Mathematical logic is the study of logic, formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic commonly addresses the mathematical properties of for ...
, a tolerant sequence is a sequence
:
,...,
of
formal theories such that there are
consistent
In classical deductive logic, a consistent theory is one that does not lead to a logical contradiction. The lack of contradiction can be defined in either semantic or syntactic terms. The semantic definition states that a theory is consisten ...
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
In mathematical logic, the Peano axioms, also known as the Dedekind–Peano axioms or the Peano postulates, are axioms for the natural numbers presented by the 19th century Italian mathematician Giuseppe Peano. These axioms have been used nearly ...
and any stronger theories with effective axiomatizations, tolerance is equivalent to
-consistency.
See also
*
Interpretability In mathematical logic, interpretability is a relation between formal theories that expresses the possibility of interpreting or translating one into the other.
Informal definition
Assume ''T'' and ''S'' are formal theories. Slightly simplified, '' ...
*
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.
and D. de Jongh, ''The logic of provability''. Handbook of Proof Theory. S. Buss, ed. Elsevier, 1998, pp. 476–546.
Proof theory