Open AccessSluicing as anaphora to issues
Author(s) -
Scott AnderBois
Publication year - 2015
Publication title -
proceedings from semantics and linguistic theory
Language(s) - English
Resource type - Journals
eISSN - 2163-5951
pISSN - 2163-5943
DOI - 10.3765/salt.v0i20.2574
Subject(s) - ellipsis (linguistics) , equivalence (formal languages) , linguistics , anaphora (linguistics) , semantics (computer science) , computer science , natural language processing , artificial intelligence , philosophy , resolution (logic) , programming language
Since Merchant 2001, it has been widely agreed that the licensing condition on Sluicing is at least partly semantic in nature. This paper argues that the relevant semantic condition is one of symmetric entailment over a semantics which includes not only truth-conditional information, but also issues in the sense of Groenendijk & Roelofsen 2009. One kind of evidence for the proposal comes from expressions like doubly-negated inde?nites and implicit passive agents which do not license Sluicing despite truth-conditional equivalence to overt inde?nites. In addition to these facts, the paper examines novel data which show that Sluicing is not licensed by even overt inde?nites inside of appositive relative clauses, arguing that these facts (and related facts regarding VP-Ellipsis) follow from the account together with an independently motivated semantics for appositives.