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.