초록 열기/닫기 버튼
This paper concerns ifself with the problem of the label <φ,φ>, which is suggested by Chomsky (2013) as the label of the syntactic object constructed by Merge of TP with the subject DP. To solve Adger’s (2012) specifier problem, Chomsky (2013) assumes that features can be the label of {XP, YP} when they are shared by the two phrases. The typical case for this labeling involves the syntactic object {Subject, TP}, which has <φ,φ> as its label. Considering that this labeling algorithm induces some conceptual problems, we would like to suggest in this paper that another mechanism be hired to solve the problems to the effect that the phi-phrase is eliminated. Adapting Uriagereka’s (1999) multiple spell-out and Takita, Goto, and Shibata’s (2016) visibility hypothesis for transferred elements, this paper can successfully solve the problem of phi-phrase.
키워드열기/닫기 버튼
labeling algorithm, phi-phrase, (un)interpretable features, multiple Spell-Out, subject condition
