h=i+l
h=i+k
h=i+j
h=i
Figure 13: Example of c-commands.
5.2 Definition of C-command
Definition [13] p.134
Node A c-commands (constituent-commands) node B iff:
i) A does not dominate B and B does not dominate A,
ii) The first branching node dominating A also dominates B.
Remarks
The first requirement is that there is no direct route up or down from A to B
passing more than one higher node. The second requirement restricts A and
B to be ’close’. Haegeman’s first criterion for dominance needs to be adjusted:
if it is correct then h(A) > h(B) and h(B) > h(A) so that the set of all c-
commands is empty, therefore greater than or equal ≥ is used here instead of
greater than >. Haegeman’s second criterion for dominance also needs to be
adjusted: if no higher node is allowed the set of c-commands is again empty.
Chomsky (1986a) [6] p.161 approaches the sub ject in a different manner using
maximal projections.
Example:Figure 13 in the figure 0 < j < k < l. The corresponding ultra-
metric matrix is
• ABCD
A0kk l
(24)
U= B . 0 j l
C..0l
D. . .0
15
More intriguing information
1. The name is absent2. Giant intra-abdominal hydatid cysts with multivisceral locations
3. Mean Variance Optimization of Non-Linear Systems and Worst-case Analysis
4. Valuing Access to our Public Lands: A Unique Public Good Pricing Experiment
5. The name is absent
6. THE CHANGING RELATIONSHIP BETWEEN FEDERAL, STATE AND LOCAL GOVERNMENTS
7. Improvements in medical care and technology and reductions in traffic-related fatalities in Great Britain
8. TINKERING WITH VALUATION ESTIMATES: IS THERE A FUTURE FOR WILLINGNESS TO ACCEPT MEASURES?
9. How do investors' expectations drive asset prices?
10. Temporary Work in Turbulent Times: The Swedish Experience