wants, we might end up with quite few entities (for instance, a want to have a long and successful working life, a want to live in one's own country together with one's family) which may not differ so much between individuals. The other alternative of counting all elements in every chain leading up to the fulfilment of the basic wants is, at least in practice, an impossible alternative. For one...

The first displayed equation is a new requirement, while the second displayed equation tightens the previous condition that φ′ ∈ (0, 1 − λ) (note that ρ/[ρ + λ(1 − ρ)] < 1 − λ). Both conditions hold if λ and φ′ are not too large, which is the case we have in mind. The first addition ensures that the slope of φ(φ|g) with respect to φ, evaluated at zero, is positive. This ensures that there are v...

(3) a. [to John leave] (building the embedded IP) b. [John1 [to John1 leave] (moving John to the Spec IP) c. [wants[John1 [to John1 leave]] (building the matrix VP) d. [John1 [wants[John1 [to John1 leave]]] (moving John to the Spec VP) e. [John1 [John1 wants[John1 [to John1 leave]]]] (building TP and moving John to its Spec) f. [John1 [John1 wants[John1 [to John1 leave]]]] (deleting all copies ...