• Facets (new session)
• Description
• Metadata
• Settings
  • Rule: asEquivalentb3sb3sifpdbprdf-labelfacetshttp://dbpedia.org/resource/inference/rules/dbpedia#http://dbpedia.org/resource/inference/rules/opencyc#http://dbpedia.org/resource/inference/rules/umbel#http://dbpedia.org/resource/inference/rules/yago#http://dbpedia.org/schema/property_rules#http://localhost:8890/dataspacehttp://www.ontologyportal.org/inference/rules/SUMO#http://www.ontologyportal.org/inference/rules/WordNet#http://www.w3.org/2002/07/owl#ldpoplwebskos-transvirtrdf-labelvirtrdf-urlNone
    
  • Inverse Functional Properties:
  • "Same As": Disabled (fastest) Apply to subjects, objects and predicates (not recommended on big datasets)

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.