Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2017/iii/paper-121/2/ii/solution

Fix the base convention . For a transitive set , the relative constructible hierarchy is
Here the definable power set is
The satisfaction for a set structure in this definition is a definable set-theoretic relation, obtained by finite syntax coding and recursion on a first-order formula. The transfinite recursion therefore defines a class in ZF.
Each level is a transitive set. For transitive , every is a subset of definable using the parameter , so ; also using the always-true first-order formula. Thus the levels increase and . Starting instead with is another common indexing convention, but it is not the convention used here. The relative universe need not satisfy axiom of choice: arbitrary need not have an internally available well-order.

New to topics? Read the docs here!