Modified numerals, such as at least three and more than five, are known to sometimes give rise to ignorance inferences. However, there is disagreement in the literature regarding the nature of these inferences, their context dependence, and differences between at least and more than. We present a series of experiments which sheds new light on these issues. Our results show that the ignorance inferences of at least are more robust than those of more than, the presence and strength of the (...) ignorance inferences triggered by both at least and more than depends on the question under discussion, and whether ignorance inferences are detected in a given experimental setting depends partly on the task that participants are asked to perform. We offer an Optimality Theoretic account of these findings. In particular, the task effect is captured by assuming that in performing an acceptability task, participants take the speaker’s perspective in order to determine whether an expression is optimal given a certain epistemic state, while in performing an inference task they take the addressee’s perspective in order to determine what the most likely epistemic state of the speaker is given a certain expression. To execute the latter task in a fully rational manner, participants have to perform higher-order reasoning about alternative expressions the speaker could have used. Under the assumption that participants do not always perform such higher-order reasoning but also often resort to so-called unidirectional optimization, the task effect finds a natural explanation. This also allows us to relate our finding to asymmetries between comprehension and production that have been found in language acquisition. (shrink)

The principle of tolerance characteristic of vague predicates is sometimes presented as a soft rule, namely as a default which we can use in ordinary reasoning, but which requires care in order to avoid paradoxes. We focus on two ways in which the tolerance principle can be modeled in that spirit, using special consequence relations. The first approach relates tolerant reasoning to nontransitive reasoning; the second relates tolerant reasoning to nonmonotonic reasoning. We compare the two approaches and examine three specific (...) consequence relations in relation to those, which we call: strict-to-tolerant entailment, pragmatic-to-tolerant entailment, and pragmatic-to-pragmatic entailment. The first two are nontransitive, whereas the latter two are nonmonotonic. (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 exclusive component of unembedded disjunctions is standardly derived as a conversational implicature by assuming that or forms a lexical scale with and. It is well known, however, that this assumption does not suffice to determine the required scalar competitors of disjunctions with more than two atomic disjuncts (McCawley, Everything that linguists have always wanted to know about logic* (But were ashamed to ask). Chicago University Press, Chicago, 1993, p. 324; Simons, “Or”: Issues in the semantics and pragmatics of disjunction. (...) Ph.D. thesis, Cornell University, Ithaca, NY, 1998). To solve this, Sauerland (Linguist Philos 27(3): 367–391, 2004) assumes that or forms a lexical scale with two otherwise unattested silent connectives ( ${\mathbb{L}}$ and ${\mathbb{R}}$ ) that retrieve the left and right terms of a disjunction. A number of recent works have proposed an Alternative Semantics for indefinites and disjunction to account for their interaction with modals and other propositional operators (Kratzer and Shimoyama, In: Otsu Y (ed) The Proceedings of the Third Tokyo Conference on Psycholinguistics. Hituzi Syobo, Tokyo, pp. 1–25, 2002; Aloni, In: Weisgerber M (ed) Proceedings of the Conference “SuB7—Sinn und Bedeutung”. Arbeitspapier Nr. 114. Konstanz, pp. 28–37, 2003; Simons, Nat Lang Semantics 13: 271–316, 2005; Alonso-Ovalle, Disjunction in alternative semantics. Ph.D. thesis, University of Massachusetts, Amherst, MA, 2006). We note that the McCawley–Simons problem does not arise in an Alternative Semantics, if we assume that the set of pragmatic competitors to a disjunction is the closure under intersection of the set of propositions that it denotes. An adaptation of the strengthening mechanism presented in Fox (In: Sauerland U, Stateva P (eds) Presupposition and implicature in compositional semantics. MacMillan, Palgrave, pp. 71–120, 2007) allows for the derivation of the exclusive component of disjunctions with more than two atomic disjuncts without having to rely on the ${\mathbb{L}}$ and ${\mathbb{R}}$ operators. The proposal extends to the case of disjunctions with logically dependent disjuncts. (shrink)

In this paper, Universal any and Negative Polarity Item any are uniformly analyzed as ‘counterfactual’ donkey sentences (in disguise). Their difference in meaning is reduced here to the distinction between strong and weak readings of donkey sentences. It is shown that this explains the universal and existential character of Universal- and NPI-any, respectively, and the positive and negative contexts in which they are licensed. Our uniform analysis extends to the use of any in command and permission sentences. It predicts that (...) whereas the use of any in permission sentences is licensed and gives rise to a universal reading, it is not licensed in command sentences. (shrink)

We give derivations of two formal models of Gricean Quantity implicature and strong exhaustivity in bidirectional optimality theory and in a signalling games framework. We show that, under a unifying model based on signalling games, these interpretative strategies are game-theoretic equilibria when the speaker is known to be respectively minimally and maximally expert in the matter at hand. That is, in this framework the optimal strategy for communication depends on the degree of knowledge the speaker is known to have concerning (...) the question she is answering. In addition, and most importantly, we give a game-theoretic characterisation of the interpretation rule Grice (formalising Quantity implicature), showing that under natural conditions this interpretation rule occurs in the unique equilibrium play of the signalling game. (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)

The paper concerns the expression of non-strict comparison, focusing in particular on constructions of the form [no(t) . . .-er than] in modified numerals. The main empirical finding is the observation that negated comparatives contrast with regular comparatives in that the former but not the latter can give rise to (scalar) implicatures. It is shown that such a contrast falls out of theories of exhaustive interpretation that claim alternatives to form dense scales. An important result is that the paper sharpens (...) the desiderata for theories of exhaustification. (shrink)

Upon hearing “Some of Michelangelo’s sculptures are in Rome,” adults can easily generate a scalar implicature and infer that the intended meaning of the utterance corresponds to “Some but not all Michelangelo’s sculptures are in Rome.” Comprehension experiments show that preschoolers struggle with this kind of inference until at least 5 years of age. Surprisingly, the few studies having investigated children’s production of scalar expressions like some and all suggest that production is adult-like already in their third year of life. (...) Thus, children’s production of implicatures seems to develop at least 2 years before their comprehension of implicatures. In this paper, we present a novel account of scalar implicature generation in the framework of Bidirectional Optimality Theory: the Asymmetry Account. We show that the production–comprehension asymmetry is predicted to emerge because the comprehension of some requires the hearer to consider the speaker’s perspective, but the production of some does not require the speaker to consider the hearer’s perspective. Hence, children’s comprehension of scalar expressions, but not their production of scalar expressions, is predicted to be related to their theory of mind development. Not possessing fully developed theory of mind abilities yet, children thus have difficulty in comprehending scalar expressions such as some in an adult-like way. Our account also explains why variable performance is found in experimental studies testing children’s ability to generate scalar implicatures; moreover, it describes the differences between children’s and adults’ implicature generation in terms of their ability to recursively apply theory of mind; finally, it sheds new light on the question why the interpretation of numerals does not require implicature generation. (shrink)

Next SectionBy discussing a novel paradigm, it is shown that the likeliness of an operator to trigger an intervention effect in a wh-in-situ question is determined by the logical properties of that operator (contra Beck 1996a, 2006, for instance). A new empirical generalization accounting for the differences between operators in their ability to cause intervention and improving on existing analyses is suggested. This generalization is fully predictive and allows one to not have to list in the lexicon whether an intervener (...) is problematic or not. It is implemented as a formal condition on wh-questions in a version of Hamblin 1973's/Karttunen 1977's question semantics that makes crucial use of Chierchia 2006's domain alternatives. (shrink)

A disjunctive sentence like Olivia took Logic or Algebra conveys that Olivia didn’t take both classes and that the speaker doesn’t know which of the two classes she took. The corresponding sentence with a possibility modal, Olivia can take Logic or Algebra, conveys instead that she can take Logic and that she can take Algebra. These exclusivity, ignorance and free choice inferences are argued by many to be scalar implicatures. Recent work has looked at cases in which exclusivity and ignorance (...) appear to be computed instead at the presupposition level, independently from the assertion. On the basis of those data, Spector and Sudo :473–517, 2017) have argued for a hybrid account relying on a pragmatic principle for deriving implicatures in the presupposition. In this paper, we observe that a sentence like Noah is unaware that Olivia can take Logic or Algebra has a reading on which free choice appears in the presupposition, but not in the assertion, and we show that deriving this reading is challenging on Spector and Sudo’s hybrid account. Following the dialectic in Fox, we argue against a pragmatic approach to presupposition-based implicatures on the ground that it is not able to account for presupposed free choice. In addition, we raise a novel challenge for Spector and Sudo’s account coming from the conflicting presupposed ignorance triggered by sentences like #Noah is unaware that I have a son or a daughter, which is infelicitous even if it’s not common knowledge whether the speaker has a son or a daughter. More generally, our data reveals a systematic parallelism between the assertion and presupposition levels in terms of exclusivity, ignorance, and free choice. We argue that such parallels call for a unified analysis and we sketch how a grammatical theory of implicatures where meaning strengthening operates in a similar way at both levels :31–57, 2012; Magri in A theory of individual-level predicates based on blind mandatory scalar implicatures, MIT dissertation, 2009; Marty in Implicatures in the DP domain, MIT dissertation, 2017) can account for such parallels. (shrink)

Grounding necessitarianism (GN) is the view that full grounds necessitate what they ground. Although GN has been rather popular among philosophers, it faces important counterexamples: For instance, A=[Socrates died] fully grounds C=[Xanthippe became a widow]. However, A fails to necessitate C: A could have obtained together with B=[Socrates and Xanthippe were never married], without C obtaining. In many cases, the debate essentially reduces to whether A indeed fully grounds C – as the contingentist claims – or if instead C is (...) fully grounded in A+, namely A plus some supplementary fact S (e.g. [Xanthippe was married to Socrates]) – as the necessitarian claims. Both sides typically agree that A+ necessitates C, while A does not; they disagree on whether A or A+ fully grounds C. This paper offers a novel defence of the claim that, in these typical cases, unlike A+, A fails to fully ground C – thereby bringing further support to GN. First and foremost, unlike A+, A fails to fully ground C because it fails to contain just what is relevant to do so, in two distinct senses – explanatory and generative relevance. Second, going for A, rather than A+, as a full ground undermines not just grounding necessitarianism, but modally weaker views which even contingentists may want to preserve. (shrink)

The function of focus is to activate alternatives, and these activated alternatives are used to compute the corresponding inferences of an utterance. The experimental research reported here investigates the role of focus intonation in inference computation and its interplay with the overt focus particles only and also. In particular, I compare the mechanisms underlying the computation of exhaustivity implicatures, assertions, and additive presuppositions. A memory delay experiment revealed that contrastive intonation makes an exhaustive interpretation equally available as overt only. A (...) second experiment showed that in immediate processing, the implicature in bare focus conditions is delayed relative to the inferences associated with only and also. The findings thus indicate that L+H* accents do not conventionally encode an exhaustive meaning, but encourage implicature computation by making relevant alternatives salient and providing a strong cue that an inference should be derived. (shrink)

Franke, Dulcinati and Pouscoulous also examine a form of covert lying, by considering to what extent speakers use implicatures to deceive their addressee. The participants in their online signaling game had to describe a card, which a virtual coplayer then had to select. When the goal was to deceive rather than help the coplayer, participants produced more false descriptions (overt lies), but also more uninformative descriptions (covert lies by means of an implicature). [73].

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)

Situation semantics was developed as an alternative to possible worlds semantics. In situation semantics, linguistic expressions are evaluated with respect to partial, rather than complete, worlds. There is no consensus about what situations are, just as there is no consensus about what possible worlds or events are. According to some, situations are structured entities consisting of relations and individuals standing in those relations. According to others, situations are particulars. In spite of unresolved foundational issues, the partiality provided by situation semantics (...) has led to some genuinely new approaches to a variety of phenomena in natural language semantics. In the way of illustration, this article includes relatively detailed overviews of a few selected areas where situation semantics has been successful: implicit quantifier domain restrictions, donkey pronouns, and exhaustive interpretations. It moreover addresses the question of how Davidsonian event semantics can be embedded in a semantics based on situations. Other areas where a situation semantics perspective has led to progress include attitude ascriptions, questions, tense, aspect, nominalizations, implicit arguments, point of view, counterfactual conditionals, and discourse relations. (shrink)