In mathematical logic, a cotolerant sequence is a sequence <math>T_1, \ldots, T_n</math> of formal theories such that there are consistent extensions <math>S_1, \ldots, S_n</math> of these theories with each <math>S_{i+1}</math> is cointerpretable in <math>S_i</math>. Cotolerance naturally generalizes from sequences of theories to trees of theories.
| Property | Value |
|---|
| dbpprop:abstract
|
- In mathematical logic, a cotolerant sequence is a sequence <math>T_1, \ldots, T_n</math> of formal theories such that there are consistent extensions <math>S_1, \ldots, S_n</math> of these theories with each <math>S_{i+1}</math> is cointerpretable in <math>S_i</math>. Cotolerance naturally generalizes from sequences of theories to trees of theories. This concept, together with its dual concept of tolerance, was introduced by Japaridze in 1992, who also proved that, for Peano arithmetic and any stronger theories with effective axiomatizations, tolerance is equivalent to <math>\Sigma_1</math>-consistency.
|
| dbpprop:hasPhotoCollection
| |
| dbpprop:reference
| |
| rdfs:comment
|
- In mathematical logic, a cotolerant sequence is a sequence <math>T_1, \ldots, T_n</math> of formal theories such that there are consistent extensions <math>S_1, \ldots, S_n</math> of these theories with each <math>S_{i+1}</math> is cointerpretable in <math>S_i</math>. Cotolerance naturally generalizes from sequences of theories to trees of theories.
|
| rdfs:label
| |
| owl:sameAs
| |
| skos:subject
| |
| foaf:page
| |
| is dbpprop:redirect
of | |
![[RDF Data]](/statics/sw-cube.png)
