Transitivity Law
Updated 2026-08-10
INTRODUCTION
English translation pending.
CORE DEFINITION
A rule of logic holding that if A leads to B and B leads to C, then A leads to C. Its proposition is that transitivity is what licenses multi-step inference: any long chain of reasoning is valid only because each link preserves the relation, and a single broken link invalidates the conclusion. Qualifier: the rule applies only to relations that are genuinely transitive, which many everyday relations such as acquaintance or preference are not.
SCAFFOLDING EFFECT
Reduce cognitive load
- Chain validation: Check that the relation you are chaining actually preserves itself at every step. - Relation screening: Test whether relations like knowing or liking are transitive before chaining them. - Link auditing: Verify each intermediate step so one broken link does not silently invalidate the conclusion.
Anchor fast decisions
If a relation holds between adjacent elements and preserves itself across each step, then it must hold between the endpoints, which is what allows long derivations to be trusted without checking every pair. The guarantee fails the moment a non-transitive relation is treated as transitive, or when a middle term quietly changes meaning, since the chain then appears valid while proving nothing.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Transitive_relationverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS