Premium
Antisymmetry and the leftness condition: Leftness as anti‐c‐command[Note 1. I wish to thank two anonymous reviewers for Studia ...]
Author(s) -
Bianchi Valentina
Publication year - 2001
Publication title -
studia linguistica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.187
H-Index - 28
eISSN - 1467-9582
pISSN - 0039-3193
DOI - 10.1111/1467-9582.00073
Subject(s) - antisymmetry , denotation (semiotics) , quantifier (linguistics) , argument (complex analysis) , referent , variable (mathematics) , modularity (biology) , mathematics , extensionality , recursion (computer science) , component (thermodynamics) , computer science , pure mathematics , linguistics , discrete mathematics , algorithm , philosophy , artificial intelligence , physics , mathematical analysis , biochemistry , chemistry , biology , semiotics , genetics , thermodynamics
This paper proposes a restatement of the Leftness Condition on quantifier binding in configurational terms in the framework of Kayne's (1994) Antisymmetry Theory. The Leftness Condition is reduced to an anti‐c‐command condition whereby a syntactic constituent that depends on a variable for its denotation cannot asymmetrically c‐command that variable. It is argued that this condition also constrains denotational equality between two R‐expressions that independently denote the same referent, thus subsuming Principle C. This proposal yields a unified account of strong, weak, weakest, and secondary crossover. I also take into account Culicover & Jackendoff's (1995) argument that binding is sensitive to Conceptual Structure superiority; I argue that in the framework of Representational Modularity (Jackendoff 1997) CS‐superiority, asymmetric c‐command, and PF precedence may correlate in virtue of correspondence rules. This suggests that the syntactic component may be thought of as mediating between the inherently linear nature of PF and the inherently recursive nature of Conceptual Structure.