Syntactic forcing relation
= Syntactic forcing relation
{title2=$p\Vdash^*\varphi$}
The syntactic forcing relation is defined recursively inside the ground model from the ranks of forcing names and the logical complexity of $\varphi$. The <forcing theorem> proves that it agrees with the <semantic forcing relation>.