 Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2022/digital-systems-linear-algebra-introduction-to-formal-proof-resit/7/b/solution

(A \lor B) \to (B \land C) \equiv \neg (A \lor B) \lor (B \land C) \equiv (\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.

 New to topics? Read the docs here!