Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE ( © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 05 June 2020

Abstract and Keywords

This article discusses the relation between structure and linear order in the minimalist approach to syntactic theory. The general idea of Kayne that linearization is a function of structural asymmetry among syntactic nodes can be maintained in the bare phrase structure theory of Chomsky, if we take the history of the derivation into account. On its simplest definition, Merge is the same at each step of the derivation, i.e., first Merge should have no special properties. This is achieved if Merge is taken to be an operation transferring one element at a time from a resource to a workspace (the object under construction). Simplifying even more, and adopting a top-down derivational approach, we can take structure to result from an operation that splits off one element at a time from the resource (‘Split Merge’) until the resource is empty. Either way, sister pairs are not sets but ordered pairs, and the set of elements merged/split off is a nest, which is equivalent to an ordered n-tuple. This allows us to consider structure-to-order conversion as a trivial equivalence relation (where material between slashes is ordered in time, i.e. realized one after the other in sound or gesture).

Keywords: linear order, syntax, grammar, syntactic theory, trivial equivalence relation

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.