Many languages have past-and-counterfactuality markers such as English simple past. There have been various attempts to find a common definition for both uses, but I will argue in this paper that they all have problems with ruling out unacceptable interpretations, or accounting for the contrary-to-fact implicature of counterfactual conditionals, or predicting the observed cross-linguistic variation, or a combination thereof. By combining insights from two basic lines of reasoning, I will propose a simple and transparent approach that solves all the observed (...) problems and offers a new understanding of the concept of counterfactuality. (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 investigate the interactions between scalar implicatures and presuppositions in sentences containing both a scalar item and presupposition trigger. We first critically discuss Gajewski and Sharvit’s previous approach. We then closely examine two ways of integrating an exhaustivity-based theory of scalar implicatures with a trivalent approach to presuppositions. The empirical side of our discussion focuses on two novel observations: the interactions between prosody and monotonicity, and what we call presupposed ignorance. In order to account for these observations, our final proposal (...) relies on two mechanisms of scalar strengthening, the Presupposed Ignorance Principle and an exhaustivity operator which lets the presuppositions of negated alternatives project. (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)

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)

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)

Questions embedded under responsive predicates and definite descriptions both give rise to a variety of phenomena which can be grouped under the term plurality effects: quantificational variability, cumulativity, and homogeneity effects. This similarity has not gone unnoticed, and many proposals have taken inspiration in theories of definite plurals to account for these effects with embedded questions. Recently these phenomena have received less attention, as the field has focused on the so-called intermediate exhaustive reading of embedded questions instead, after Spector called (...) into question the traditional dichotomy between weak and strong exhaustive readings. As a result, the intermediate exhaustive reading has been accounted for at the expense of empirical coverage in other areas. In this paper, I propose a modular theory which derives the currently much discussed exhaustive readings without giving up the rich semantics necessary to account for plurality effects. My account of quantificational variability, cumulativity, and homogeneity effects builds on recent work on these phenomena in the nominal domain by adopting a categorial approach to embedded questions, while the strong and intermediate exhaustive readings are implemented using an independent strengthening mechanism suggested in Klinedinst and Rothschild :1–23, 2011). The resulting theory not only recovers important results on plurality effects; it offers new, simple solutions for some puzzles presented in George :166–177, 2013) and Paillé and Schwarz Proceedings of WCCFL 36, vol 36, Cascadilla Proceedings Project, Somerville, 2018), naturally derives readings that had been postulated in previous literature, makes correct predictions in many unexplored cases, and is compatible with recent results in psycholinguistics. In the last sections I justify my assumptions and show how possible limitations I inherit from the theories I build on can be accommodated under standard assumptions. (shrink)

One of the central topics in semantic theory over the last few decades concerns the nature of local contexts. Recently, theorists have tried to develop general, non-stipulative accounts of local contexts (Schlenker, 2009; Ingason, 2016; Mandelkern & Romoli, 2017a). In this paper, we contribute to this literature by drawing attention to the local contexts of subclausal expressions. More specifically, we focus on the local contexts of quantificational determiners, e.g. `all', `both', etc. Our central tool for probing the local contexts of (...) subclausal elements is the principle Maximize Presupposition! (Percus, 2006; Singh, 2011). The empirical basis of our investigation concerns some data discussed by Anvari (2018b), e.g. the fact that sentences such as `All of the two presidential candidates are crooked' are unacceptable. In order to explain this, we suggest that the local context of determiners needs to contain the information carried by their restrictor. However, no existing non-stipulative account predicts this. Consequently, we think that the local contexts of subclausal expressions will likely have to be stipulated. This result has important consequences for debates in semantics and pragmatics, e.g. those around the so-called "explanatory problem" for dynamic semantics (Soames, 1982; Heim, 1990; Schlenker, 2009). (shrink)