This paper pursues some of the consequences of the idea that there are (at least) two sources for distributive/cumulative interpretations in English. One source is lexical pluralization: All predicative stems are born as plurals, as Manfred Krifka and Fred Landman have argued. Lexical pluralization should be available in any language and should not depend on the particular make-up of its DPs. I suggest that the other source of cumulative/distributive interpretations in English is directly provided by plural DPs. DPs with plural (...) agreement features can ‘release’ those features to pluralize adjacent verbal projections. If there is a lexical source for distributive/cumulative interpretations, there should be instances of such interpretations with singular DPs. But there should also be cases of distributive/cumulative interpretations that require the presence of DPs with plural agreement morphology. (shrink)

The natural interpretation of counterfactuals with disjunctive antecedents involves selecting from each of the disjuncts the worlds that come closest to the world of evaluation. It has been long noticed that capturing this interpretation poses a problem for a minimal change semantics for counterfactuals, because selecting the closest worlds from each disjunct requires accessing the denotation of the disjuncts from the denotation of the disjunctive antecedent, which the standard boolean analysis of or does not allow (Creary and Hill, Philosophy of (...) Science 43:341–344, 1975; Nute, Journal of Philosophy 72:773–778, 1975; Fine, Mind 84(335):451–458, 1975; Ellis et al. Journal of Philosophical Logic 6:335–357, 1977). This paper argues that the failure to capture the natural interpretation of disjunctive counterfactuals provides no reason to abandon a minimal change semantics. It shows that the natural interpretation of disjunctive counterfactuals is expected once we refine our assumptions about the semantics of or and the logical form of conditionals, and (i) we assume that disjunctions introduce propositional alternatives in the semantic derivation, in line with independently motivated proposals about the semantics of or (Aloni, 2003a; Simons, Natural Language Semantics 13:271–316, 2005; Alonso-Ovalle, Disjunction in Alternative Semantics. PhD thesis, 2006); and (ii) we treat conditionals as correlative constructions, as advocated in von Fintel (1994), Izvorski (Proceedings of NELS 26, 1996), Bhatt and Pancheva (2006), and Schlenker (2004). (shrink)

The Strongest Meaning Hypothesis of Dalrymple et al (1994,1998), which was originally proposed as a principle for the interpretation of reciprocals, is extended in this paper into a general principle of plural predication. This principle applies to complex predicates that are composed of lexical predicates that hold of atomic entities, and determines the pluralities in the extension of the predicate. The meaning of such a complex predicate is claimed to be the truth-conditionally strongest meaning that does not contradict lexical properties (...) of the simple predicates it contains. Weak interpretations of reciprocals (as in the books are stacked on top of each other), plural predicate conjunction (e.g. the books are old and new) and ’atomic’ distributivity in general are derived by a unified mechanism, which ’weakens’ the basic universal meanings of strong reciprocals, boolean conjunction and quantification over atomic entities. (shrink)

This paper develops a semantic analysis of data like It is getting colder and colder. Their meaning is argued to arise from a combination of a comparative with pluractionality. The analysis is embedded in a general theory of plural predication and pluractionality. It supports a semantic theory involving a family of syntactic plural operators.

The topic of this paper is the semantic analysis of the sentences in (1). (1a,b) contain the adverbial modifiers 'one after the other' and 'dog after dog', respectively, which add to the simple (1') information on how the overall event of the dogs entering the room is to be divided into subevents based on a division of the group of dogs into individual dogs. We call these adverbials pluractional adverbials, following e.g. Lasersohn's (1995) use of the term pluractionality for the (...) division of larger eventualities into subeventualities. (shrink)

I provide arguments in favor of an implicature approach to Homogeneity where the basic meaning of the kids laughed is some of the kids laughed, and its strengthened meaning is all of the kids laughed. The arguments come from asymmetries between positive and negatives sentences containing definite plurals with respect to children’s behavior, the availability of Non-maximal readings, and the robustness of neither-true-nor-false judgments :205–248, 2015). I propose to avoid some problems of Magri’s analysis by modeling the Implicature account of (...) Homogeneity after the Implicature account of Free Choice, based on a hitherto unnoticed analogy between the two phenomena. The approach that emerges has the advantages of Magri’s implicature account of Homogeneity, while at the same time bears a close resemblance to recent approaches to Non-maximality :1–58. https://doi.org/10.3765/sp.5.3, 2012; Križ and Spector in Interpreting plural predication: homogeneity and non-maximality, Ms., Institut Jean Nicod, 2017), which enables restating their account of Non-maximality as following from the context-sensitivity of implicature calculation. (shrink)

Some theories assume that sentences like (i) with a presupposition trigger in the scope of a quantifier carry an existential presupposition, as in (ii); others assume that they carry a universal presupposition, as in (iii). No student knows that he is lucky. Existential presupposition: At least one student is lucky.Universal presupposition: Every student is lucky. This work is an experimental investigation of this issue in French. Native speakers were recruited to evaluate the robustness of the inference from (i) to (iii). (...) The main result is that presuppositions triggered from the scope of the quantifier aucun‘no’ are in fact universal. But the present results also suggest that the presuppositions triggered from the scope of other quantifiers depend on the quantifier. This calls for important changes in the main theories of presupposition projection. (shrink)

This paper proposes a new explanation for the oddness of presuppositional and negative islands, as well as the puzzling observation that these islands can be obviated by certain quantificational elements. The proposal rests on two independently motivated assumptions: (i) the idea that the domain of manners contains contraries and (ii) the notion that degree expressions range over intervals. It is argued that, given these natural assumptions, presuppositional and negative islands are predicted to lead to a presupposition failure in any context.

We report two experiments which tested whether cognitive capacities are limited to those functions that are computationally tractable (PTIME-Cognition Hypothesis). In particular, we investigated the semantic processing of reciprocal sentences with generalized quantifiers, i.e., sentences of the form Q dots are directly connected to each other, where Q stands for a generalized quantifier, e.g. all or most. Sentences of this type are notoriously ambiguous and it has been claimed in the semantic literature that the logically strongest reading is preferred (Strongest (...) Meaning Hypothesis). Depending on the quantifier, the verification of their strongest interpretations is computationally intractable whereas the verification of the weaker readings is tractable. We conducted a picture completion experiment and a picture verification experiment to investigate whether comprehenders shift from an intractable reading to a tractable reading which should be dispreferred according to the Strongest Meaning Hypothesis. The results from the picture completion experiment suggest that intractable readings occur in language comprehension. Their verification, however, rapidly exceeds cognitive capacities in case the verification problem cannot be solved using simple heuristics. In particular, we argue that during verification, guessing strategies are used to reduce computational complexity. (shrink)