The present volume contains a collection of papers presented at the 21st annual meeting “Sinn und Bedeutung” of the Gesellschaft fur Semantik, which was held at the University of Edinburgh on September 4th–6th, 2016. The Sinn und Bedeutung conferences are one of the leading international venues for research in formal semantics.

We present evidence that preschool children oftentimes understand disjunctive sentences as if they were conjunctive. The result holds for matrix disjunctions as well as disjunctions embedded under every. At the same time, there is evidence in the literature that children understand or as inclusive disjunction in downward-entailing contexts. We propose to explain this seemingly conflicting pattern of results by assuming that the child knows the inclusive disjunction semantics of or, and that the conjunctive inference is a scalar implicature. We make (...) two assumptions about implicature computation in the child: that children access only a proper subset of the adult alternatives, and that children possess the adult capacity to strengthen sentences with implicatures. As a consequence, children are expected to sometimes not compute any implicatures at all, but in other cases they are expected to compute an implicature that is different from the adult implicature. We argue that the child’s conjunctive strengthening of disjunctive sentences realizes the latter possibility: the adult infers that the conjunction is false but the child infers that the conjunction is true. This behaviour is predicted when our assumptions about child development are coupled with the assumption that a covert exhaustive operator is responsible for strengthening in both the child and the adult. Specifically, children’s conjunctive strengthening is predicted to follow from the same mechanism used by adults to compute conjunctive free choice implicatures in response to disjunctive permission sentences. We furthermore argue that this parallel between the child and the adult extends to disambiguation preferences. In particular, we present evidence that children prefer to strengthen disjunctions to conjunctions, in matrix and embedded positions ; this result mirrors previous findings that adults prefer to compute free choice, at the root and under every. We propose a disambiguation strategy that explains the preference for conjunctive strengthening – by both the child and the adult – even though there is no general preference for exhaustification. Specifically, we propose that the preference for a conjunctive strengthening follows from a pragmatic preference for a complete answer to the Question Under Discussion. (shrink)

The computation of scalar implicatures is sometimes costly relative to basic meanings. Among the costly computations are those that involve strengthening `some' to `not all' and strengthening inclusive disjunction to exclusive disjunction. The opposite is true for some other cases of strengthening, where the strengthened meaning is less costly than its corresponding basic meaning. These include conjunctive strengthenings of disjunctive sentences (e.g., free-choice inferences) and exactly-readings of numerals. Assuming that these are indeed all instances of strengthening via implicature/exhaustification, the puzzle (...) is to explain why strengthening sometimes increases costs while at other times it decreases costs. I develop a theory of processing costs that makes no reference to the strengthening mechanism or to other aspects of the derivation of the sentence's form/meaning. Instead, costs are determined by domain-general considerations of the grammar's output, and in particular by aspects of the meanings of ambiguous sentences and particular ways they update the context. Specifically, I propose that when the hearer has to disambiguate between a sentence's basic and strengthened meaning, the processing cost of any particular choice is a function of (i) a measure of the semantic complexity of the chosen meaning and (ii) a measure of how much relevant uncertainty it leaves behind in the context. I measure semantic complexity with Boolean Complexity in the propositional case and with semantic automata in the quantificational case, both of which give a domain-general measure of the minimal representational complexity needed to express the given meaning. I measure relevant uncertainty with the information-theoretic notion of entropy; this domain-general measure formalizes how `far' the meaning is from giving a complete answer to the question under discussion, and hence gives an indication of how much representational complexity is yet to come. Processing costs thus follow from domain-general considerations of current and anticipated representational complexity. The results might also speak to functional motivations for having strengthening mechanisms in the first place. Specifically, exhaustification allows language users to use simpler forms than would be available without it to both resolve relevant uncertainties and convey complex meanings. (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)

Sentences with disjunction in the scope of a universal quantifier, Every A is P or Q, tend to give rise to distributive inferences that each of the disjuncts holds of at least one individual in the domain of the quantifier, Some A is P & Some A is Q. These inferences are standardly derived as an entailment of the meaning of the sentence together with the scalar implicature that it is not the case that either disjunct holds of every individual (...) in the domain of the quantifier, \Every A is P &\Every A is Q. As we show, this derivation faces a challenge in that distributive inferences may obtain in the absence of plain negated inferences. We address this challenge by showing that on particular assumptions about alternatives, a derivation of distributive inferences as scalar implicatures can be maintained without in fact necessitating plain negated inferences. These assumptions accord naturally with the grammatical approach to scalar implicatures. We also present experimental data that suggest that plain negated inferences are not only unnecessary for deriving distributive inferences, but might in fact be unavailable. (shrink)