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.

In a series of experiments, Bott and Noveck (2004) found that the computation of scalar inferences, a variety of conversational implicature, caused a delay in response times. In order to determine what aspect of the inferential process that underlies scalar inferences caused this delay, we extended their paradigm to three other kinds of inferences: free choice inferences, conditional perfection, and exhaustivity in “it”‐clefts. In contrast to scalar inferences, the computation of these three kinds of inferences facilitated response times. Following a (...) suggestion made by Chemla and Bott (2014), we propose that the time it takes to compute a conversational implicature depends on the structural characteristics of the required alternatives. (shrink)

This paper discusses a set of observations, many of which are novel, concerning differences between the adjectival modals _certain_ and _possible_ and their adverbial counterparts _certainly_ and _possibly_. It argues that the observations can be derived from a standard interpretation of _certain_/_certainly_ as universal and _possible_/_possibly_ as existential quantifiers over possible worlds, in conjunction with the hypothesis that the adjectives quantify over knowledge and the adverbs quantify over belief. The claims on which the argument relies include the following: (i) knowledge (...) implies belief, (ii) agents have epistemic access to their belief, (iii) relevance is closed under speakers’ belief, and (iv) commitment is pragmatically inconsistent with explicit denial of belief. (shrink)

This paper explores the idea that scalar implicatures are computed with respect todiscourse referents. Given the general consensus that a proper account of pronominal anaphora in natural language requires discourse referents separately from the truth-conditional meaning, it is naturally expected that the anaphoric information that discourse referents carry play a role in the computation of scalar implicatures, but the literature has so far mostly exclusively focused on the truth-conditional dimension of meaning. This paper offers a formal theory of scalar implicatures (...) with discourse referents couched in dynamic semantics, and demonstrates its usefulness through a case study on the plurality inferences of plural nouns in English. (shrink)

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)

Disjunctions in the scope of possibility modals give rise to a conjunctive inference, generally referred to as ‘free choice.’ For example, Emma can take Spanish or Calculus suggests that Emma can take Spanish and can take Calculus. This inference is not valid on standard semantics for modals in combination with a Boolean semantics for disjunction. Hence free choice has sparked a whole industry of theories in philosophy of language and semantics. This paper investigates free choice in sentences involving a non-monotonic (...) modified numeral, under which we embed a possibility modal scoping over disjunction. One example is Exactly one student can take Spanish or Calculus. As we point out, the presence of certain readings of these sentences is a key test for a prominent approach, which analyzes free choice as a kind of scalar implicature. We report on two experiments investigating the readings of such sentences, using an inferential task. Our results are challenging for the implicature approach. We sketch two possible solutions within this approach, either adopting a different recent implicature algorithm, or exploring a different meaning for modified numerals with exactly. Both of them suffer from a variety of problems. We then discuss a third solution, which exploits a recent account of free choice based on homogeneity. This approach can account for our results, in combination with plausible assumptions about homogeneity projection, though it too has open issues with related cases. Regardless of which solution is chosen, non-monotonic contexts turn out to be an important test case for theories of free choice, implicature, and modified numerals. (shrink)

The notion of measurement plays a central role in human cognition. We measure people’s height, the weight of physical objects, the length of stretches of time, or the size of various collections of individuals. Measurements of height, weight, and the like are commonly thought of as mappings between objects and dense scales, while measurements of collections of individuals, as implemented for instance in counting, are assumed to involve discrete scales. It is also commonly assumed that natural language makes use of (...) both types of scales and subsequently distinguishes between two types of measurements. This paper argues against the latter assumption. It argues that natural language semantics treats all measurements uniformly as mappings from objects (individuals or collections of individuals) to dense scales, hence the Universal Density of Measurement (UDM). If the arguments are successful, there are a variety of consequences for semantics and pragmatics, and more generally for the place of the linguistic system within an overall architecture of cognition. (shrink)

Building on previous works which argued that scalar implicatures can be computed in embedded positions, this paper proposes a constraint on exhaustification which restricts the conditions under which an exhaustivity operator can be licensed. We show that this economy condition allows us to derive a number of generalizations, such as, in particular, the ‘Implicature Focus Generalization’: scalar implicatures can be embedded under a downward-entailing operator only if the scalar term bears pitch accent. Our economy condition also derives specific predictions regarding (...) the licensing of so-called Hurford disjunctions. (shrink)

We propose a modification of the exhaustivity operator from Fox Presupposition and implicature in compositional semantics, Palgrave Macmillan, London, pp 71–120, 2007. https://doi.org/10.1057/9780230210752_4) that on top of negating all the Innocently Excludable alternatives affirms all the ‘Innocently Includable’ ones. The main result of supplementing the notion of Innocent Exclusion with that of Innocent Inclusion is that it allows the exhaustivity operator to identify cells in the partition induced by the set of alternatives whenever possible. We argue for this property of (...) ‘cell identification’ based on the simplification of disjunctive antecedents and the effects on free choice that arise as the result of the introduction of universal quantifiers. We further argue for our proposal based on the interaction of only with free choice disjunction. (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)

The acceptability of _any_-DPs in existential modal sentences presents a challenge for theories of NPI licensing: existential modal sentences appear to differ substantially from other environments in which _any_-DPs are acceptable (in particular, they lack a downward-entailing operator). One approach to this challenge has been to, first, take _any_-DPs to be subject to an environment-based downward-entailingness condition—they have to occur in an environment that is Strawson downward-entailing with respect to their domain (cf. Kadmon and Landman 1993 )—and, second, to derive (...) such an environment in existential modal sentences by means of exhaustification (e.g., Fox 2007 ). This note presents new evidence for such a two-layered approach (cf. Crnič 2017, 2019 ). The evidence comes from a striking contrast in the behavior of singular vs. plural _any_-DPs in existential modal sentences. The paper concludes by charting some relations between _any_-DPs and other polarity items. (shrink)

The structural approach to alternatives :669–690, 2007; Fox and Katzir in Nat Lang Semant 19:87–107, 2011; Katzir in Semantics, pragmatics and the case of scalar implicatures, Palgrave Macmillan, London, pp 40–71, 2014) is the most developed attempt in the literature at solving the symmetry problem of scalar implicatures. Problematic data with indirect and particularised scalar implicatures have however been raised :249–270, 2015). To address these problems, Trinh and Haida proposed to augment the theory with the Atomicity Constraint. Here we show (...) that this constraint falls short of explaining minimal variants of the original problems, and moreover that it runs into trouble with the inferences of sentences involving gradable adjectives like full and empty. We furthermore discuss how the structural approach suffers at times from the problem of ‘too many lexical alternatives’ pointed out by Swanson :31–36, 2010), and at other times from the opposite problem of ‘too few lexical alternatives’. These three problems epitomise the challenge of constructing just enough alternatives under the structural approach to solve the symmetry problem in full generality. Finally, we also sketch another recent attempt at solving the symmetry problem, Bergen et al., 2016), which is based on relative informativity and complexity. We argue that Bergen et al. do not provide a general solution to the symmetry problem either, by pointing to some of the open problematic cases that remain for this approach as well. We conclude that while important progress has been made in the theory of alternatives for scalar implicatures in the last few years, a full solution to the symmetry problem has not yet been attained. (shrink)

The structural approach to alternatives :669–690, 2007; Fox and Katzir in Nat Lang Semant 19:87–107, 2011; Katzir in Semantics, pragmatics and the case of scalar implicatures, Palgrave Macmillan, London, pp 40–71, 2014) is the most developed attempt in the literature at solving the symmetry problem of scalar implicatures. Problematic data with indirect and particularised scalar implicatures have however been raised :249–270, 2015). To address these problems, Trinh and Haida proposed to augment the theory with the Atomicity Constraint. Here we show (...) that this constraint falls short of explaining minimal variants of the original problems, and moreover that it runs into trouble with the inferences of sentences involving gradable adjectives like full and empty. We furthermore discuss how the structural approach suffers at times from the problem of ‘too many lexical alternatives’ pointed out by Swanson :31–36, 2010), and at other times from the opposite problem of ‘too few lexical alternatives’. These three problems epitomise the challenge of constructing just enough alternatives under the structural approach to solve the symmetry problem in full generality. Finally, we also sketch another recent attempt at solving the symmetry problem, Bergen et al., 2016), which is based on relative informativity and complexity. We argue that Bergen et al. do not provide a general solution to the symmetry problem either, by pointing to some of the open problematic cases that remain for this approach as well. We conclude that while important progress has been made in the theory of alternatives for scalar implicatures in the last few years, a full solution to the symmetry problem has not yet been attained. (shrink)

The paper develops a uniform compositional analysis of the various readings of the scalar particle still and its German counterpart noch. Noch/still is a presuppositional scalar particle that gives rise to implicatures. Interpretive possibilities arise through different choices for the scale that the particle associates with, different attachment sites in the syntax, and interaction with focus. These interpretive parameters allow for a wide range of possible sentence interpretations, which overlap, but do not coincide for still and noch. The contrastive perspective (...) allows us to examine the role of scales in the grammar. The implicatures triggered by the scalar item open an interesting perspective for the generation of implicatures in general. (shrink)

We present a number of puzzles arising for the interpretation of modified numerals. Following Büring and others we assume that the main difference between comparative and superlative modifiers is that only the latter convey disjunctive meanings. We further argue that the inference patterns triggered by disjunction and superlative modifiers are hard to capture in existing semantic and pragmatic analyses of these phenomena (neo-Gricean or grammatical alike), and we propose a novel account of these inferences in the framework of bilateral state-based (...) modal logic defining a first order extension of Aloni (Semant Pragmat 15:5-EA, 2022. https://doi.org/10.3765/sp.15.5)’s. (shrink)

Two strong contenders for scalar implicature (SI) computation are the pragmatic and the grammatical theories. While the former sustains that context plays a major role, the latter suggests context is required but is lexically and monotonically constrained (Chierchia 2012). In particular, this paper discusses a processing account for SIs that is dependent on the satisfaction of the Strawsonian presupposition of existence, necessary for the realization of the asymmetric entailment pattern among relevant alternatives. This observation complies with the principles of the (...) grammatical view, for it predicts SIs in the presence of contextually empty domains, unlike the pragmatic account whose necessary access to contextual information will cause propositions with empty domains to always return a truth value false, hence blocking any inference. I present online experimental evidence of an acceptability judgment task and recorded response times of both existential and universal sentences containing entities of three kinds: existent (type-a), non-existent but conceivable (type-b), and non-existent and inconceivable (type-c). The data of 25 Colombian Spanish speaking participants were collected using PsychoPy, powered by Pavlovia. The results suggest SIs are computed in types a and b but relatively unsuccessful in type-c. I conclude that the relevant entailment pattern for implicature computation is the Strawson-entailment relation which, combined with the grammatical account, correctly predicts SIs with non-existent but conceivable entities but avoids inference with inconceivable terms. (shrink)