earticle

영어

In this paper, I propose that Kayne’s(1994) LCA underlies the entire set of syntactic representations, even those at LF, imposing a tight relation between hierarchical structure and linear order. It will be shown that the Distinctness principle of Copies I suggested earlier(Son, 2015a, 2016) is a manifestation of the LCA. More specifically, the LCA applies to a Spell-Out domain shipped to LF, choosing only those representations that satisfy the LCA. An LF-representation bearing nondistinct copies in the head and tail of the chain will turn out to be a non-trivial chain since it conflicts with the requirements on linearization and thus cannot be linearized.