Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2005/calculus-linear-algebra-discrete-mathematics-logic-and-proof-and-models-of-computation/8/b/solution

Every pair of natural numbers has a maximum, itself a natural number. Given arbitrary , choose . Then , and any satisfying also satisfies . All three clauses of hold. Thus
This explicitly supplies the witness required by the existential quantifier for every pair chosen by the two universal quantifiers.

New to topics? Read the docs here!