In Boolean algebra, the consensus theorem or rule of consensus is the identity:
x
y
∨
x
¯
z
∨
y
z
=
x
y
∨
x
¯
z
The consensus or resolvent of the terms
x
y
and
x
¯
z
is
y
z
. It is the conjunction of all the unique literals of the terms, excluding the literal that appears unnegated in one term and negated in the other.
The conjunctive dual of this equation is:
(
x
∨
y
)
(
x
¯
∨
z
)
(
y
∨
z
)
=
(
x
∨
y
)
(
x
¯
∨
z
)
x
y
∨
x
¯
z
∨
y
z
=
x
y
∨
x
¯
z
∨
(
x
∨
x
¯
)
y
z
=
x
y
∨
x
¯
z
∨
x
y
z
∨
x
¯
y
z
=
(
x
y
∨
x
y
z
)
∨
(
x
¯
z
∨
x
¯
y
z
)
=
x
y
(
1
∨
z
)
∨
x
¯
z
(
1
∨
y
)
=
x
y
∨
x
¯
z
The consensus or consensus term of two conjunctive terms of a disjunction is defined when one term contains the literal
a
and the other the literal
a
¯
, an opposition. The consensus is the conjunction of the two terms, omitting both
a
and
a
¯
, and repeated literals; the consensus is undefined if there is more than one opposition. For example, the consensus of
x
¯
y
z
and
w
y
¯
z
is
w
x
¯
z
.
The consensus can be derived from
(
x
∨
y
)
and
(
x
¯
∨
z
)
through the resolution inference rule. This shows that the LHS is derivable from the RHS (if A → B then A → AB; replacing A with RHS and B with (y ∨ z) ). The RHS can be derived from the LHS simply through the conjunction elimination inference rule. Since RHS → LHS and LHS → RHS (in propositional calculus), then LHS = RHS (in Boolean algebra).
In Boolean algebra, repeated consensus is the core of one algorithm for calculating the Blake canonical form of a formula.
In digital logic, including the consensus term in a circuit can eliminate race hazards.
The concept of consensus was introduced by Archie Blake in 1937. It was rediscovered by Samson and Mills in 1954 and by Quine in 1955. Quine coined the term 'consensus'. Robinson used it for clauses in 1965 as the basis of his "resolution principle".
