 Forcing name rank

The ordinal assigned recursively by $\mathrm{nrk}(\tau )=\sup \{\mathrm{nrk}(\sigma )+1:(\sigma ,p)\in \tau \}$. It measures dependency on subnames and justifies generic evaluation by recursion. The ordinary rank of a set also accounts for the coding of the ordered pairs and the forcing conditions; it need not equal this dependency rank of a set.