It’s not always redundant to assert what can be presupposed∗ Comments on Mayr & Romoli (2016) Yasutada Sudo University College London
[email protected] Draft 1 Abstract Mayr & Romoli(2016) point out that the felicity of sentences of the form p φ _ pφ ^ qq is problematic for theories of redundancy, as the second occurrence of φ is predicted to be redundant. I call this the Disjunction Puzzle. They propose two solutions to it that make crucial use of (i) incrementality, and (ii) a grammatical mechanism of exhaustification, and conclude that the Disjunction Puzzle supports (i) and (ii). I take issue with their conclusion and argue that the Disjunction Puzzle does not necessarily motivate (i) and (ii), because the puzzle only arises under a specific assumption about presupposition satisfaction and redundancy of assertion, namely, that they refer to the same notion of entailment. It is natural to make this assumption in possible worlds semantics, but is not necessarily motivated in a more fine-grained theory of meaning. Adopting Situation Semantics, I will demonstrate that the Disjunction Puzzle disappears once it is assumed that redundancy is computed with reference to a stronger notion of entailment than presupposition satisfaction. 1 Introduction Mayr & Romoli(2016) point out that the felicity of disjunctive sentences like (1) poses a puzzle for theories of redundancy. (1) Either Mary isn’t pregnant, or she is and she is expecting a daughter. (Mayr & Romoli 2016:2) Specifically, the conjunct she is (pregnant) is redundant here. I will define the relevant notion of redundancy below, but the idea behind this can easily be illustrated when (1) is compared to the version of the sentence without this conjunct, (2), which means the same thing.