원문정보
초록
영어
This paper is designed to illustrate how the anaphoric relations are processed in the syntactic derivation under the C-command condition. Binding Theory has depended on the C-command condition, in that an antecedent must C-command a reflexive pronoun. However, the Minimalist perspectives claim that once entering into the syntax course, all lexical items should be processed via Agree and Merge. Especially, Agree mechanism demands that a probe with unvalued features should locate its potential goals all in its C-command area. Instead of indexing, the φ features specified on lexical items can show the reference identification between a reflexive/pronoun and its antecedent via syntactic operations. I propose that the modified φ feature specifications on each DP are more useful to reveal the relation between a reflexive and its antecedent than indexing. There is a remaining problem as to what makes a reflexive related to its antecedents. There is no probe-goal relation between an antecedent and a reflexive. It may be possible that a head T probes for both the two DPs. For this purpose, we should find out the way for a head T to probe the two multiply.
목차
II. Agree Mechanism
1. Probe-goal Relations
2. C-command Condition
3. An Agree-based Derivational Process
III. Anaphoric Dependencies
1. Syntactic Dependencies
2. Anaphoric Dependencies
IV. Syntactic Derivational Process
V. Conclusion
Works Cited
Abstract