According to the `grammatical account', scalar implicatures are triggered by a covert exhaustification operator present in logical form. This account covers considerable empirical ground, but there is a peculiar pattern that resists treatment given its usual implementation. The pattern centers on odd assertions like #"Most lions are mammals" and #"Some Italians come from a beautiful country", which seem to trigger implicatures in contexts where the enriched readings conflict with information in the common ground. Magri (2009, 2011) argues that, to account (...) for these cases, the basic grammatical approach has to be supplemented with the stipulations that exhaustification is obligatory and is based on formal computations which are blind to information in the common ground. In this paper, I argue that accounts of oddness should allow for the possibility of felicitous assertions that call for revision of the common ground, including explicit assertions of unusual beliefs such as "Most but not all lions are mammals" and "Some but not all Italians come from Italy". To adequately cover these and similar cases, I propose that Magri's version of the Grammatical account should be refined with the novel hypothesis that exhaustification triggers a bifurcation between presupposed (the negated relevant alternatives) and at-issue (the prejacent) content. The explanation of the full oddness pattern, including cases of felicitous proposals to revise the common ground, follows from the interaction between presupposed and at-issue content with an independently motivated constraint on accommodation. Finally, I argue that treating the exhaustification operator as a presupposition trigger helps solve various independent puzzles faced by extant grammatical accounts, and motivates a substantial revision of standard accounts of the overt exhaustifier "only". (shrink)

This paper investigates how the distribution of negative polarity items can inform our understanding of the underlying semantic representation of constituent questions. It argues that the distribution of NPIs in questions is governed by the same logical properties that govern their distribution in declarative constructions. Building on an observation due to Guerzoni and Sharvit that strength of exhaustivity in questions correlates with the acceptability of NPIs, I propose a revision of the semantics of questions that can explain this link in (...) terms already familiar from the literature of negative polarity, namely the availability of a local downward entailing environment. I argue for a new theory of questions that takes strength of exhaustivity to be encoded internal to the question nucleus rather than in different answer-hood operators. This switch, while conceptually a simple move, has far-reaching consequences in the domain of questions. I also show how this new analysis can account for a host of issues related to NPIs, such as the subject–object asymmetry noted by Han and Siegel, the interaction between NPIs and high versus low wh-adjuncts, the varying acceptability of NPIs in the restrictor of which-phrases, and the contrast between weak and strong NPIs. (shrink)

Plural definite descriptions across many languages display two well-known properties. First, they can give rise to so-called non-maximal readings, in the sense that they ‘allow for exceptions’. Second, while they tend to have a quasi-universal quantificational force in affirmative sentences, they tend to be interpreted existentially in the scope of negation. Building on previous works, we offer a theory in which sentences containing plural definite expressions trigger a family of possible interpretations, and where general principles of language use account for (...) their interpretation in various contexts and syntactic environments. Our theory solves a number of problems that these previous works encounter, and has broader empirical coverage in that it offers a precise analysis for sentences that display complex interactions between plural definites, quantifiers and bound variables, as well as for cases involving non-distributive predicates. The resulting proposal is briefly compared with an alternative proposal by Križ, which has similar coverage but is based on a very different architecture and sometimes makes subtly different predictions. (shrink)

I show that wish, an attitude verb presupposing the counterfactuality of its complement, raises a problem for grammatical theories of scalar implicatures when a scalar item is embedded in its complement.

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)

Next SectionThis paper provides a lexical entry schema for exclusives covering the adverbs only, just, exclusively, merely, purely, solely, simply, and the adjectives only, sole, pure, exclusive and alone. We argue, on the basis of inter-paraphrasability relations among these exclusives and entailments involving at least and at most, that all of these items make an at-issue contribution of an upper bound on the viable answers to the current question under discussion (expressible with at most), and signal that a lower bound (...) on those answers (expressible with at least) is taken for granted. The lexical entry schema accommodates two main points of variation, which makes it possible to capture the differences in meaning among these terms: (i) semantic type (restricted to the class of modifiers), and (ii) constraints on the current question under discussion or the strength ranking over its alternative possible answers. We propose 22 different specific instantiations of the schema for exclusives in English. (shrink)

When used next to a predicate at the extreme of a scale such as perfect, the exclusive modifiers just and simply convey a distinctive intensifying effect, presenting a puzzle for theories of exclusivity and alternative-based meanings more broadly. In this article, I develop an analysis of these modifiers as a special kind of alternative-targeting operator, whereby the speaker signals that more specific descriptions than the one they just asserted—modeled here as granularity-based alternatives—are not assertion-worthy in the context—i.e., they need not (...) be asserted in order for a complete representation of the facts to be provided. On this analysis, the intensifying effect of these modifiers are derived from the interaction of exclusivity, granularity, and the distinctive semantic properties of predicates denoting the extreme of a scalar extreme. More broadly, the proposal affords a jumping-off point for further work exploring the interaction between scalarity and exclusive operators, highlighting a number of intriguing lines of future research across semantics and pragmatics. (shrink)