In Boolean algebra, the consensus theorem or rule of consensus is the identity: x y ∨ x ¯ z ∨ y z = x y ∨ x ¯ z {\displaystyle xy\vee {\bar {x}}z\vee yz=xy\vee {\bar {x}}z} The consensus or resolvent of the terms x y {\displaystyle xy} and x ¯ z {\displaystyle {\bar {x}}z} is y z {\displaystyle yz}. Wikipedia

An identity in Boolean algebra. Wikipedia Disambiguation

Theorem Wikidata

The following theorem of Boolean algebra: X Y + X ′ Z + Y Z = X Y + X ′ Z where Y Z , the algebraically redundant term, is called the "consensus term", or its dual form ( X + Y ) ( X ′ + Z ) ( Y + Z ) = ( X + Y ) ( X ′ + Z ) , in which case Y + Z is the consensus term. (Note: X + Y , X ′ + Z ⊢ Y + Z is an example of the resolution inference rule (replacing the + with ∨ and the prime with prefix ¬ might make this more evident).). Wiktionary