Solution

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

A first-order theory admits quantifier elimination when every first-order formula has a quantifier-free formula , in the same first-order signature and with no additional free variables, such that
Thus all first-order models of agree that the two first-order formulas define the same tuples. This definition concerns first-order formulas with free variables, as well as first-order sentences; merely deciding closed assertions would be weaker. The existence of an effective procedure is an additional issue, supplied by the explicit construction in part (d).

New to topics? Read the docs here!