Solution

ID: past-exam-of-the-model-theory-and-godel-s-incompleteness-theorems-course-of-the-university-of-oxford/2008/b/6/iv/solution

Add a predicate symbol for each -formula , of arity equal to its displayed free-variable tuple. Let consist of together with all defining axioms
Every first-order model of has a unique such expansion, interpreting the new predicate symbols by their defining sets. Conversely the reduct of every first-order model of satisfies .
Given an arbitrary -formula , replace each new atomic predicate symbol by its original -definition, renaming bound variables to avoid capture. This produces an -formula with
The defining axiom for that particular logical formula now gives an atomic replacement:
Thus the expanded first-order theory eliminates quantifiers. For a first-order sentence, the same translation is an -sentence, decided by completeness of ; hence every expanded first-order sentence is decided and is complete. Empty free-variable tuples can be handled by zero-ary predicate symbols, or by the usual logical truth and falsity constants. This definitional expansion is called Morleyization.

New to topics? Read the docs here!