Solution

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

In proof by contradiction, assume the negation of the desired conclusion and derive logical falsity; discharge that assumption and infer the desired conclusion. Its sequent rule is
This is a rule of classical propositional logic. It follows from the paper's negation introduction rule, which first yields , and double-negation elimination, which yields . This is stronger than merely deriving by showing that leads to logical falsity.

New to topics? Read the docs here!