The equivalences that relate two binary operators by distributing one over the other; in Boolean logic the two forms are A ∧ (B ∨ C) ↔ (A ∧ B) ∨ (A ∧ C) and A ∨ (B ∧ C) ↔ (A ∨ B) ∧ (A ∨ C).
A compatibility law between two binary operations · and + on a set stating that a·(b + c) = a·b + a·c and (b + c)·a = b·a + c·a for all elements, so one operation distributes over the other.
A relation between two binary operations showing that one operation distributes over the other, typically written as a·(b + c) = a·b + a·c (left distributivity) and (b + c)·a = b·a + c·a (right distributivity) when both hold.