Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 19 / 5 / i

The valuation of a forcing name is defined recursively byThe recursion is on forcing name rank. Only pairs with an active condition in $H$ contribute elements, and their first coordinates are evaluated in the same filter. Thus a name is a ground-model set, while its value is a set in the generic extension.

A nice forcing name for a subset of a ground-model set $a$, often an ordinal, has the formwhere each $A_x$ is an antichain in $\mathbb{Q}$ and the entire construction belongs to $M$. Its value consists of the $x$ for which $H$ meets $A_x$. The antichains need not be maximal. Under the countable chain condition they are countable in $M$, which makes nice forcing names useful for counting possible subsets in extensions.

For a countable transitive ground model, the semantic forcing relation isThe forcing theorem identifies this with the recursively defined relation inside $M$ and makes it definable there. In particular, if $r\ge q$ is stronger, then $q⊩\phi$ implies $r⊩\phi$. The names are interpreted in each relevant generic filter, not replaced by their value in one fixed extension in the definition.