Hurford disjunctions: Embedded exhaustification and structural economy

Hurford’s Constraint, which bans disjunctions in which one disjunct entails the other, has been central to the debate between the pragmatic and the grammatical view on Scalar Implicatures. We provide evidence that Hurford’s Constraint should be derived from more basic principles, and we propose such a derivation using a pragmatic prohibition against redundant constituents. In a first, more conservative version, the redundancy is specific to disjunctions. In a second, more general version, redundancy is banned regardless of constituent type. Both versions make new predictions about the emergence of oddness in cases that are not covered by Hurford’s Constraint.
The first version is too restricted. The second one is incorrect. We explore a revised architecture in which the relevant redundancy principle applies locally in the semantic computation. This perspective makes different predictions about oddness than the first two and has a potentially interesting extension to oddness in quantificational constructions, which we discuss. All our attempts to generalize Hurford’s Constraint require the grammatical theory of Scalar Implicatures.