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.

1. 들머리
2. 파이-구 설정의 문제점
    2.1. 표찰 알고리듬과 지정어
    2.2. 파이-구의 개념적 문제점
3. 겹전이(multiple Transfer)와 표찰 알고리듬
    3.1. 주어 조건
    3.2. 전이(Transfer)와 LA
    3.3. 겹전이/음운화와 LA
4. 맺음말
참고문헌

• 김용하(안동대학교) | Yong-Ha Kim