= Logic and proof
{scope}
{title2=A10468W1}
Solutions to the three questions of the <University of Oxford> <computer science> Finals examination held on 10 June 2015. Question 3(d) has a false assertion as printed; its solution gives a <countermodel> and explains the additional hypotheses under which the usual <least Herbrand model> argument works.<Logic and Proof examination paper of the University of Oxford (2015)>[Cover and printed pp. 2–4, Questions 1–3; the unrestricted quantifier-free matrix in Question 3(d) is visible on printed p. 4]{ref}
Back to article page