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 , 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.
Property | Value |
---|---|
dbo:abstract |
|
dbo:wikiPageExternalLink | |
dbo:wikiPageID |
|
dbo:wikiPageLength |
|
dbo:wikiPageRevisionID |
|
dbo:wikiPageWikiLink | |
dcterms:subject | |
rdfs:comment |
|
rdfs:label |
|
owl:sameAs | |
prov:wasDerivedFrom | |
foaf:isPrimaryTopicOf | |
is dbo:wikiPageRedirects of | |
is dbo:wikiPageWikiLink of | |
is foaf:primaryTopic of |