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)

Stalnaker ( 1978 ) made two seminal claims about presuppositions. The most influential one was that presupposition projection is computed by a pragmatic mechanism based on a notion of ‘local context’ . Due to conceptual and technical difficulties, however, the latter notion was reinterpreted in purely semantic terms within ‘dynamic semantics’ (Heim 1983 ). The second claim was that some instances of presupposition generation should also be explained in pragmatic terms . But despite various attempts, the definition of a precise (...) ‘triggering algorithm’ has remained somewhat elusive. We discuss possible extensions of both claims. First, we offer a reconstruction of ‘local contexts’ which circumvents some of the difficulties faced by Stalnaker’s original analysis. We preserve the idea that local contexts are computed by a pragmatic mechanism that aggregates the information that follows from an incomplete sentence given the global context; but we crucially rely on a modified notion of entailment (‘R-entailment’), whose plausibility should be assessed on independent grounds. Second, we speculate that local contexts might prove necessary (though by no means sufficient) to understand how some presuppositions are triggered. In a nutshell, we suggest that a presupposition is triggered when the semantic contribution of an expression to its local context is in some sense ‘heterogeneous’. Without giving an analysis of the latter notion, we note that this architecture implies that presuppositions should be triggered on the basis of the meaning that an expression has relative to its local context (what we call its ‘local meaning’); we sketch some possible consequences of this analysis. (shrink)

In this paper, I give an analysis of neg-raising inferences as scalar implicatures. The main motivation for this account as opposed to a presupposition-based approach like Gajewski (Linguist Philos 30(3):289–328, 2007) comes from the differences between presuppositions and neg-raising inferences. In response to this issue, Gajewski (2007) argues that neg-raising predicates are soft presuppositional triggers and adopts the account of how their presuppositions arise by Abusch (J Semantics 27(1):1–44, 2010). However, I argue that there is a difference between soft triggers (...) and neg-raising predicates in their behavior in embeddings; a difference that is straightforwardly accounted for in the present approach. Furthermore, by adopting Abusch’s (2010) account of soft triggers, Gajewski (2007) inherits the assumptions of a pragmatic principle of disjunctive closure and of a non-standard interaction between semantics and pragmatics—assumptions that are not needed by the present proposal, which is just based on a regular theory of scalar implicatures. I also show that the arguments that Gajewski (2007) presents in favor of the presuppositional account can be explained also by the scalar implicatures-based approach proposed here. Finally, while the main point of the paper is a comparison with the presuppositional account, I sketch a preliminary comparison with more syntactic approaches to neg-raising. (shrink)

The computation of both Scalar Implicatures (SI) and Association with Focus (AF) is characterized with reference to sets of alternatives. However, it has generally been assumed that the relevant alternatives are determined in different ways for the two processes. Specifically, it has been assumed that the alternatives for SI – scalar alternatives – are computed by a special procedure specifically designed for implicatures, whereas the alternatives for AF – focus alternatives – are determined by the general theory of association with (...) focus – focus semantics. As far as we know, the only attempt to connect the two is Krifka (1995), under which scalar alternatives and focus alternatives are identical and determined by focus semantics. However, Krifka’s result is based on a specific stipulation about scalar items, which he borrows from Horn and incorporates into focus semantics, namely that scalar items are inherently focused and have their Horn Scale as their lexically specified focus values. (shrink)

In this paper I provide a unified analysis of a number of pragmatic anomalies that have been discussed in the literature. The paper’s main goal is to account for Sobel sequences of conditionals and sequences of disjunctive sentences, but I will also propose that this analysis can be extended to sequences of sentences with superlatives. The starting point is the observation that, while all these sequences are felicitous in one order, they are infelicitous when the order is reversed. Previous proposals (...) have focussed on particular types of infelicitous sequences Ken Hale: A life in language, MIT Press, Cambridge, 2001; Moss in Noûs 46:516–586, 2012; Lewis in Noûs 52:481–507, 2018; a.o.), or a subset of all the phenomena cited above Linguistic and psycholinguistic approaches on implicatures and presuppositions. Palgrave McMillan, Basingstoke, 2017; a.o.). I propose that sequences of sentences belonging to the same structured set of alternatives T are subject to a Specificity Constraint : sequences are acceptable if both alternatives are dominated by the same number of nodes in the structured set of alternatives T. Violations of SC can be avoided by strengthening the weaker alternative. However, covert strengthening violates an economy condition if the overtly stronger alternative is among those made salient by the preceding utterance in the sequence. I propose that the set of alternatives made salient by an utterance of a sentence s consists of s’s sisters and mother in T. I will show that the strengthening mechanism varies depending on the kind of sequence we have. (shrink)

In this paper I provide a unified analysis of a number of pragmatic anomalies that have been discussed in the literature. The paper’s main goal is to account for Sobel sequences of conditionals and sequences of disjunctive sentences, but I will also propose that this analysis can be extended to sequences of sentences with superlatives. The starting point is the observation that, while all these sequences are felicitous in one order, they are infelicitous when the order is reversed. Previous proposals (...) have focussed on particular types of infelicitous sequences Ken Hale: A life in language, MIT Press, Cambridge, 2001; Moss in Noûs 46:516–586, 2012; Lewis in Noûs 52:481–507, 2018; a.o.), or a subset of all the phenomena cited above Linguistic and psycholinguistic approaches on implicatures and presuppositions. Palgrave McMillan, Basingstoke, 2017; a.o.). I propose that sequences of sentences belonging to the same structured set of alternatives T are subject to a Specificity Constraint : sequences are acceptable if both alternatives are dominated by the same number of nodes in the structured set of alternatives T. Violations of SC can be avoided by strengthening the weaker alternative. However, covert strengthening violates an economy condition if the overtly stronger alternative is among those made salient by the preceding utterance in the sequence. I propose that the set of alternatives made salient by an utterance of a sentence s consists of s’s sisters and mother in T. I will show that the strengthening mechanism varies depending on the kind of sequence we have. (shrink)

This paper investigates propositional hyperintensionality in counterfactuals. It starts with a scenario describing two children playing on a seesaw and studies the truth-value predictions for counterfactuals by four different semantic theories. The theories in question are Kit Fine’s truthmaker semantics, Luis Alonso-Ovalle’s alternative semantics, inquisitive semantics and Paolo Santorio’s syntactic truthmaker semantics. These predictions suggest that the theories that distinguish more of a given set of intensionally equivalent sentences (Fine and Alonso-Ovalle’s) fare better than those that do not (inquisitive semantics (...) and Santorio’s). Then we investigate how inquisitive semantics and Santorio can respond to these results. They can respond to them by helping themselves to considerations from Hurford disjunctions, disjunctions whose disjuncts stand in an entailment relation to one another. I argue that considerations from Hurford disjunctions are ad hoc modifications merely to predict the expected results. I conclude that the scenarios suggest a need for more fine-grained theories of sentential meaning in general. (shrink)

The Free Choice effect—whereby \\) seems to entail both \ and \—has traditionally been characterized as a phenomenon affecting the deontic modal ‘may’. This paper presents an extension of the semantic account of free choice defended by Fusco to the agentive modal ‘can’, the ‘can’ which, intuitively, describes an agent’s powers. On this account, free choice is a nonspecific de re phenomenon that—unlike typical cases—affects disjunction. I begin by sketching a model of inexact ability, which grounds a modal approach to (...) agency in a Williamson -style margin of error. A classical propositional semantics combined with this framework can reflect the intuitions highlighted by Kenny ’s dartboard cases, as well as the counterexamples to simple conditional views recently discussed by Mandelkern et al.. In Section 3, I turn to an independently motivated actual-world-sensitive account of disjunction, and show how it extends free choice inferences into an object language for propositional modal logic. (shrink)

We present an argument for revising the theory of alternatives for Scalar Implicatures and for Association with Focus. We argue that in both cases the alternatives are determined in the same way, as a contextual restriction of the focus value of the sentence, which, in turn, is defined in structure-sensitive terms. We provide evidence that contextual restriction is subject to a constraint that prevents it from discriminating between alternatives when they stand in a particular logical relationship with the assertion or (...) the prejacent, a relationship that we refer to as symmetry. Due to this constraint on contextual restriction, discriminating between alternatives in cases of symmetry becomes the task of focus values. This conclusion is incompatible with standard type-theoretic definitions of focus values, motivating our structure-sensitive definition instead. (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)

In this book an introduction to the grammatical view of the scalar implicature phenomenon is presented. A detailed overview is offered concerning the embeddability of the exhaustivity operator, and the contextual dependance of the alternatives generation process. The theoretical implications of the grammatical view with respect to the abductive character of the scalar implicature are also discussed. A pragmatic account of the assertive content is proposed in correlation with a blindness-based account of the semantic content carried by scalar sentences, in (...) order to ensure that the information globally conveyed by the latter is sometimes different from the semantic content automatically generated. -/- . (shrink)

Negli ultimi quindici anni la letteratura filosofico-linguistica ha registrato un rinnovato interesse per i meccanismi di implicatura, specialmente del tipo scalare. In buona parte, l’interesse stato suscitato dall’emergere di una prospettiva grammaticale, secondo la quale i fenomeni di implicatura scalare sarebbero conseguenza di un meccanismo interpretativo incassato nella logica delle lingue naturali, e quindi riferibile al componente semantico dell’architettura cognitiva umana. L’obiettivo di questo testo fornire una presentazione di alcuni tra gli argomenti che hanno motivato l’emergere della prospettiva grammaticale. Inizieremo, (...) con una descrizione del fenomeno di implicatura scalare, sostanzialmente condivisa dai fautori delle diverse prospettive. Quindi, approfondiremo la nostra comprensione del fenomeno, pre- sentando alcuni punti fermi della prospettiva pragmaticista, e mostrandone i punti di debolezza individuati dai fautori della prospettiva grammaticale. Infine, presenteremo la prospettiva grammaticale, presentando da una parte i vantaggi che questo approccio presenta rispetto alla prospettiva pragmaticista, e dall’altra discutendo le sfide che attendono questa nuova prospettiva. (shrink)