 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/7/a/solution

(A \to C) \to (B \to C) \equiv \neg (\neg A \lor C) \lor \neg B \lor C \equiv (A \land \neg C) \lor \neg B \lor C .

An absorption step simplifies this to the disjunctive normal form

A \lor \neg B \lor C .

 New to topics? Read the docs here!