Solution

ID: past-exam-of-the-computer-science-course-of-the-university-of-oxford/2015/logic-and-proof/1/b/solution

Replace each implication by a logical disjunction and use the conjunctive normal form for exclusive or from part (a). The resulting Boolean clauses are
Here the displayed array is a list of the six Boolean clauses, whose logical conjunction is equivalent to all four constraints.
Use resolution first on , then on , and finally on :
Removing the repeated Boolean literal in the final Boolean clause uses idempotence. Neither nor is needed: even the weaker assumptions that the coin has at least one outcome and that at least one person wins already force , once the two implications hold.

New to topics? Read the docs here!