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

In this first-order structure, says and . Thus is an upper bound of . The universally quantified clause says that if is any other upper bound, then . Therefore is their least upper bound. In the usual total order on the natural numbers, this is their maximum:
This describes a condition on the values assigned to the free variables ; itself is not a closed first-order sentence.

New to topics? Read the docs here!