Hierarchical relations and linear ordering

TLDR: In this article, the authors show that the strict mapping of asymmetric c-command to linear precedence is questionable and that linear precedence relations are not relevant for syntax, with only hierarchy playing a fundamental role.

Abstract: The present squib’s discussion is centered on Kayne’s (1994, 2010) proposals, which postulate a direct relation between the order of asymmetric c-command relations and linear precedence relations at PF. To put it briefly, Kayne argues that asymmetric c-command is mapped to linear precedence at PF and concludes that there is a universal hierarchical/linear order: Specifier Head-Complement. This universal order would predict the canonical order SVO found in many languages. Any other linear order, whether canonical or not, would then be obtained through movement operations. Details of the arguments in Kayne (1994, 2010) are presented and discussed in the present squib with focus on two goals: first, to show that the strict mapping of asymmetric c-command to linear precedence is questionable and, second, that linear precedence relations are not relevant for syntax, with only hierarchy playing a fundamental role — as also argued elsewhere (see CHOMSKY, 1995, 2004, 2005, 2008; URIAGEREKA, 1999; GUIMARA˜ ES, 2000). In doing this, circularity problems in Kayne’s arguments are highlighted as well as other issues. Subsequently, an alternative account of the relationship between syntax and PF is suggested, in an effort to maintain the spirit of Kayne’s LCA while at the same time making it compatible with more recent minimalist views.