Jump to ContentJump to Main Navigation
Where Does Binding Theory Apply?$
Users without a subscription are not able to see the full content.

David Lebeaux

Print publication date: 2009

Print ISBN-13: 9780262012904

Published to MIT Press Scholarship Online: August 2013

DOI: 10.7551/mitpress/9780262012904.001.0001

Show Summary Details
Page of

PRINTED FROM MIT PRESS SCHOLARSHIP ONLINE (www.mitpress.universitypressscholarship.com). (c) Copyright The MIT 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 monograph in MITSO for personal use (for details see www.mitpress.universitypressscholarship.com/page/privacy-policy).date: 24 September 2018

Another Negative Condition

Another Negative Condition

(p.79) Chapter 8 Another Negative Condition
Where Does Binding Theory Apply?

Samuel Jay Keyser

The MIT Press

This chapter presents another negative condition, the Stray Affix Filter of Lasnik ([1981] 1990), which also holds at all points in the derivation. It argues that the full construction of the grammar should have at least three negative conditions applying throughout the derivation: the two negative conditions of binding theory, Conditions B and C, and the negative condition of the Stray Affix Filter. The candidate set for reconstruction would be constructed throughout the derivation, and the Single Tree Condition, a coherence condition on positive binding conditions and quantification, would apply at LF.

Keywords:   negative conditions, grammar, binding theory, Condition B, Condition C, Stray Affix Filter, Single Tree Condition

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.