01
Classic MECE is the special case
MECE assumes one implicit connective — the parallel AND of a dimensional partition. Crift carries the connective as data and applies the right completeness-and-distinctness law per type. Classic MECE is what you get when every node is an AND node.
02
Generated and audited, not described
MECE is a property a human eyeballs a hand-built tree against, after the fact. Crift produces the structure and measures completeness as a stored, type-local signal that feeds repair.
03
Overlap forbidden locally, allowed where it's truth
Real causal reasoning requires reconvergence — two paths sharing an enabling fact. Crift enforces exclusivity inside a partition and lets the graph reconverge across them. MECE scores that a violation; Crift calls it fidelity.
04
The named residual is the stronger claim
Not “there are no gaps” but “every gap is named” — a first-class object you can act on. Falsifiable, and far more credible than a bald “exhaustive.”