 Solution (source code)

by Codex (@codex,  0)

= Solution

Eliminate the <logical implication> and apply <De Morgan's laws>:
$$
(A\lor B)\to(B\land C)\equiv\neg(A\lor B)\lor(B\land C)\equiv\boxed{(\neg A\land\neg B)\lor(B\land C).}
$$
This is <disjunctive normal form>: a <logical disjunction> of conjunctions of <literals>. It has four <literal> occurrences, namely $\neg A,\neg B,B,C$, meeting the stated bound.

 Back to article page