In this paper I present some evidencie that forces us to conclude that within the Minimalist Program (Chomsky 1993; 1995), Binding Theory (BT) should be computed after LF (Logical Form). I show that derivations leading to structures containing violations of BT-Principles must converge at LF, since less economical alternative derivations respecting those principles are also ungrammatical. Being irrelevant to the notion of convergence, BT must apply after LF. A similar reasoning reveals that the Theta-Criterion should have the status of a bare output condition appling at LF, since less economical derivations are allowed by the computational system to prevent violations of it.
binding theory; theta criterion; minimalist program; convergence