The Copy Theory of Control and the Analysis of Finite Control

Under the Markovian property of derivations the history of the derivation is not preserved in the current state, hence chains cannot be read off it. Instead, a Copy relation applies between identical inscriptions at the phase level, before Transfer. Consequently, Copy can take place between two identical theta-marked arguments, each separately introduced by External Merge, yielding control. In this article, we apply the Copy Theory of Control (CTC) to finite control in Greek. In finite control, the lower member of a Copy relation is interpreted as a bound variable (i.e., a ‘PRO’). At the same time its deletion is licensed in a null subject configuration, defined by Agree with rich I (like a ‘pro’). Since by hypothesis under the CTC there are no empty categories but only copies, the potential contradiction between PRO and pro properties can be avoided, under appropriate assumptions about the modular organization of the interfaces. We further predict that the same (subjunctive) structure in Greek can be ambiguous between control and pronominal null subject readings, and that non-null subject languages like English cannot have finite control.