Jump to ContentJump to Main Navigation
Contiguity Theory$
Users without a subscription are not able to see the full content.

Norvin Richards

Print publication date: 2016

Print ISBN-13: 9780262034425

Published to MIT Press Scholarship Online: January 2017

DOI: 10.7551/mitpress/9780262034425.001.0001

Show Summary Details
Page of

PRINTED FROM MIT PRESS SCHOLARSHIP ONLINE (www.mitpress.universitypressscholarship.com). (c) Copyright The MIT Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in MITSO for personal use.date: 04 August 2021



(p.337) 8 Conclusion
Contiguity Theory

Norvin Richards

The MIT Press

The overall theory is reviewed. Movement during the narrow-syntactic derivation is driven by two major conditions: Affix Support and Generalized Contiguity. The last two chapters have uncovered a number of operations that apply at Spell-out, as the grammar attempts to improve the representation before handing it off to PF: these include the lowering of affixes to suitable hosts, the fixing of word order made indeterminate by Untethering, and deletion of material which blocks the initial formation of Selectional Contiguity relations. The computation’s choice of operations is guided by conditions like Multitasking (which requires the grammar to perform operations that satisfy as many constraints as possible) and Hippocratic Altruism (which prevents elements from participating in an operation if the operation’s only effect on them will be to destroy Contiguity relations in which they participate).

Keywords:   movement, Multitasking, Hippocratic Altruism, Spell-out

MIT Press Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs, and if you can't find the answer there, please contact us.