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)

Both the phenomenon of presupposition and that of vagueness have motivated the use of one form or another of trivalent logic, in which a declarative sentence can not only receive the standard values true and false , but also a third, non-standard truth-value which is usually understood as ‘undefined’ . The goal of this paper is to propose a multivalent framework which can deal simultaneously with presupposition and vagueness, and, more specifically, capture their projection properties as well as their different (...) roles in language. Now, there is a prima facie simple way of doing this, which simply consists in assimilating the two phenomena, and using an appropriate type of trivalent logic. On this view, we just need a compositional system that deals with the ‘undefined’ truth-value, and does not care about whether the source of undefinedness is ‘presuppositional’ or related to vagueness. I will argue that such a simple solution cannot succeed, and point out a number of desiderata that any successful approach must meet. I will then present and discuss two seven-valued semantics, inspired, respectively, by the Strong Kleene semantics and by supervaluationism, which meet these desiderata. (shrink)

Several theories of presupposition projection predict that some sentences which intuitively yield unconditional presuppositions should have weaker, conditional ones. For instance, If John is realistic, he knows that he is incompetent is predicted to have the presupposition that if John is realistic, he is incompetent, whereas one certainly infers that John is in fact incompetent. We summarize some difficulties faced by three solutions, DRT, Singh’s ‘Formal Alternatives’, and Singh’s ‘Interacting Alternatives’; we then offer a new analysis which is compatible with (...) several semantic theories of projection, and which does not require the addition of a new representational module. In essence, we obtain unconditional inferences by assuming that speakers may ignore certain parts of a sentence when they accommodate a presupposition—presumably to simplify their computational work. They do so by adding to the context an assumption that would satisfy the presupposition of the sentence no matter which meaning some of its elements have. Depending on which elements are ignored in this way, a variety of strengthened presuppositions are obtained. We speculate on a possible mechanism (which follows some of Singh’s earlier ideas) to determine which of these strengthened inferences are in fact obtained. The analysis correctly predicts some new instances of the Proviso Problem in quantificational examples. (shrink)

Recent semantic research has made increasing use of a principle, Maximize Presupposition, which requires that under certain circumstances the strongest possible presupposition be marked. This principle is generally taken to be irreducible to standard Gricean reasoning because the forms that are in competition have the same assertive content. We suggest, however, that Maximize Presupposition might be reducible to the theory of scalar implicatures. (i)First, we consider a special case: the speaker utters a sentence with a presupposition p which is not (...) initially taken for granted by the addressee, but the latter takes the speaker to be an authority on the matter. Signaling the presupposition provides new information to the addressee; but it also follows from the logic of presupposition qua common belief that the presupposition is thereby satisfied (Stalnaker, Ling Philos 25(5–6):701–721, 2002). (ii) Second, we generalize this solution to other cases. We assume that even when p is common belief, there is a very small chance that the addressee might forget it (‘Fallibility’); in such cases, marking a presupposition will turn out to generate new information by re-establishing part of the original context. We also adopt from Raj Singh (Nat Lang Semantics 19(2):149–168, 2011) the hypothesis that presupposition maximization is computed relative to local contexts—and we assume that these too are subject to Fallibility; this accounts for cases in which the information that justifies the presupposition is linguistically provided. (iii) Finally, we suggest that our assumptions have benefits in the domain of implicatures: they make it possible to reinterpret Magri’s ‘blind’ (i.e. context-insensitive) implicatures as context-sensitive implicatures which just happen to be misleading. (shrink)

Todd (2016) proposes an analysis of future-directed sentences, in particular sentences of the form 'will(φ)', that is based on the classic Russellian analysis of definite descriptions. Todd's analysis is supposed to vindicate the claim that the future is metaphysically open while retaining a simple Ockhamist semantics of future contingents and the principles of classical logic, i.e. bivalence and the law of excluded middle. Consequently, an open futurist can straightforwardly retain classical logic without appeal to supervaluations, determinacy operators, or any further (...) controversial semantical or metaphysical complication. In this paper, we will show that this quasi-Russellian analysis of 'will' both lacks linguistic motivation and faces a variety of significant problems. In particular, we show that the standard arguments for Russell's treatment of definite descriptions fail to apply to statements of the form 'will(φ)'. (shrink)

We distinguish three ways that a theory of linguistic meaning and communication might be considered dynamic in character. We provide some examples of systems which are dynamic in some of these senses but not others. We suggest that separating these notions can help to clarify what is at issue in particular debates about dynamic versus static approaches within natural language semantics and pragmatics.

The meaning of definite descriptions (like ‘the King of France’, ‘the girl’, etc.) has been a central topic in philosophy and linguistics for the past century. Indefinites (‘Something is on the floor’, ‘A child sat down’, etc.) have been relatively neglected in philosophy, under the Russellian assumption that they can be unproblematically treated as existential quantifiers. However, an important tradition, drawing from Stoic logic, has pointed to patterns which suggest that indefinites cannot be treated simply as existential quantifiers. The standard (...) dynamic semantic treatment of those phenomena, however, has well-known problems with negation and disjunction. -/- In this paper I develop a new approach to (in)definites. On my theory, truth-conditions are classical. But in addition to truth-conditions, meanings comprise a second dimension of what I call bounds. It is at the level of bounds, not truth-conditions, that I locate the characteristically dynamic coordination between indefinites and definites. The resulting system thus has a classical logic. This approach avoids dynamic semantics’ logical problems, and, more generally, yields a new perspective on the relation between truth-conditional and dynamic effects in natural language. (shrink)

Two recent and influential papers, van Rooij 2007 and Lassiter 2012, propose solutions to the proviso problem that make central use of related notions of independence—qualitative in the first case, probabilistic in the second. We argue here that, if these solutions are to work, they must incorporate an implicit assumption about presupposition accommodation, namely that accommodation does not interfere with existing qualitative or probabilistic independencies. We show, however, that this assumption is implausible, as updating beliefs with conditional information does not (...) in general preserve independencies. We conclude that the approach taken by van Rooij and Lassiter does not succeed in resolving the proviso problem. (shrink)

We argue that definite noun phrases give rise to uniqueness inferences characterized by a pattern we call definiteness projection. Definiteness projection says that the uniqueness inference of a definite projects out unless there is an indefinite antecedent in a position that filters presuppositions. We argue that definiteness projection poses a serious puzzle for e-type theories of (in)definites; on such theories, indefinites should filter existence presuppositions but not uniqueness presuppositions. We argue that definiteness projection also poses challenges for dynamic approaches, which (...) have trouble generating uniqueness inferences and predicting some filtering behavior, though unlike the challenge for e-type theories, these challenges have mostly been noted in the literature, albeit in a piecemeal way. Our central aim, however, is not to argue for or against a particular view, but rather to formulate and motivate a generalization about definiteness which any adequate theory must account for. (shrink)

This paper discusses some formal properties of trivalent approaches to presupposition projection, and in particular of the middle Kleene system of Peters (1977) and Krahmer (1998). After exploring the relationship between trivalent truth-functional accounts and dynamic accounts in the tradition of Heim (1983), I show how the middle Kleene trivalent account can be formulated in a way which shows that it meets the explanatory challenge of Schlenker (2006, 2008a,b), and provide some results relating to the application of the middle Kleene (...) approach to generalised quantifiers. (shrink)

In this paper I revive two important formal approaches to the interpretation of natural language, that of Montague and that of Karttunen and Peters. Armed with insights from dynamic semantics (Heim, Krifka) the two turn out to stand up against age-old criticisms in an orthodox fashion. The plan is mainly methodological, as I only want to illustrate the technical feasibility of the revived proposals. Even so, there are illuminating and welcome empirical consequences on the subject of scope islands (as discussed (...) by Abusch and Kratzer, among many others), as well as unintended theoretical implications in the contextualist debate (Grice, Recanati, Simons, Stanley, and many others again). (shrink)

Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic consequence relations $st$, $ss$, $tt$, $ss\cap tt$, and $ts$, when the connectives are negation, conjunction, and disjunction. For $ts$ and $ss\cap tt$ the answer is trivial (no scheme works), and for $ss$ and $tt$ it is straightforward (they are the collapsible schemes, in which (...) the middle value acts like one of the classical values). For $st$, the schemes in question are the Boolean normal schemes that are either monotonic or collapsible. (shrink)

This paper distinguishes between definiteness and determinacy. Definiteness is seen as a morphological category which, in English, marks a uniqueness presupposition, while determinacy consists in denoting an individual. Definite descriptions are argued to be fundamentally predicative, presupposing uniqueness but not existence, and to acquire existential import through general type-shifting operations that apply not only to definites, but also indefinites and possessives. Through these shifts, argumental definite descriptions may become either determinate or indeterminate. The latter option is observed in examples like (...) ‘Anna didn’t give the only invited talk at the conference’, which, on its indeterminate reading, implies that there is nothing in the extension of ‘only invited talk at the conference’. The paper also offers a resolution of the issue of whether possessives are inherently indefinite or definite, suggesting that, like indefinites, they do not mark definiteness lexically, but like definites, they typically yield determinate readings due to a general preference for the shifting operation that produces them. (shrink)

The presupposition triggered by an expression E is generally satisfied by information that comes before rather than after E in the sentence or discourse. In Heim’s classic theory (1983), this left-right asymmetry is encoded in the lexical semantics of dynamic connectives and operators. But several recent analyses offer a more nuanced approach, in which presupposition satisfaction has two separate components: a general principle (which varies from theory to theory) specifies under what conditions a presupposition triggered by an expression E is (...) satisfied; and an ‘incremental’ component specifies that the principle must be checked on the basis of information that comes before E. Several researchers take this incremental component to be a processing bias, which can be overcome at some cost. If so, it should be possible, though costly, to satisfy presuppositions ‘symmetrically’, i.e. by taking into account linguistic material that comes both before and after the presupposition trigger. We test this claim with experimental means. Using inferential (and to some extent acceptability) tasks involving the anaphoric trigger aussi (‘too’) in French, we argue that symmetric readings are indeed possible (albeit degraded) in environments involving the connectives if, or, and unless. (shrink)

In this paper it is shown how a partial semantics for presuppositions can be given which is empirically more satisfactory than its predecessors, and how this semantics can be integrated with a technically sound, compositional grammar in the Montagovian fashion. Additionally, it is argued that the classical objection to partial accounts of presupposition projection, namely that they lack “flexibility,” is based on a misconception. Partial logics can give rise to flexible predictions without postulating any ad hoc ambiguities. Finally, it is (...) shown how the partial foundation can be combined with a dynamic system of common-ground maintenance to account for accommodation. (shrink)

In this paper it is shown how a partial semantics for presuppositions can be given which is empirically more satisfactory than its predecessors, and how this semantics can be integrated with a technically sound, compositional grammar in the Montagovian fashion. Additionally, it is argued that the classical objection to partial accounts of presupposition projection, namely that they lack “flexibility,” is based on a misconception. Partial logics can give rise to flexible predictions without postulating any ad hoc ambiguities. Finally, it is (...) shown how the partial foundation can be combined with a dynamic system of common-ground maintenance to account for accommodation. (shrink)

In this paper, we use antecedent-final conditionals to formulate two problems for parsing-based theories of presupposition projection and triviality of the kind given in Schlenker 2009. We show that, when it comes to antecedent-final conditionals, parsing-based theories predict filtering of presuppositions where there is in fact projection, and triviality judgments for sentences which are in fact felicitous. More concretely, these theories predict that presuppositions triggered in the antecedent of antecedent-final conditionals will be filtered (i.e. will not project) if the negation (...) of the consequent entails the presupposition. But this is wrong: John isn’t in Paris, if he regrets being in France intuitively presupposes that John is in France, contrary to this prediction. Likewise, parsing-based approaches to triviality predict that material entailed by the negation of the consequent will be redundant in the antecedent of the conditional; but John isn’t in Paris, if he’s in France and Mary is with him is intuitively felicitous, contrary to these predictions. Importantly, given that the trigger appears in sentence-final position, both incremental (left-to-right) and symmetric versions of such theories make the same predictions. These data constitute a challenge to the idea that presupposition projection and triviality should be computed on the basis of parsing. This issue is important because it relates to the more general question as to whether presupposition and triviality calculation should be thought of as a pragmatic post-compositional phenomenon or as part of compositional semantics (as in the more traditional dynamic approaches). We discuss a solution which allows us to maintain the parsing-based pragmatic approach; it is based on an analysis of conditionals which incorporates a presupposition that their antecedent is compatible with the context, together with a modification to Schlenker’s (2009) algorithm for calculating local contexts so that it takes into account presupposed material. As we will discuss, this solution works within a framework broadly similar to that of Schlenker’s (2009), but it doesn’t extend in an obvious way to other parsing-based accounts (e.g. parsing-based trivalent approaches). We conclude that a parsing-based theory can be maintained, but only if we adopt a substantial change of perspective on the framework. (shrink)

I propose a new theory of semantic presupposition, which I call dissatisfaction theory. I first briefly review a cluster of problems − known collectively as the proviso problem − for most extant theories of presupposition, arguing that the main pragmatic response to them faces a serious challenge. I avoid these problems by adopting two changes in perspective on presupposition. First, I propose a theory of projection according to which presuppositions project unless they are locally entailed. Second, I reject the standard (...) assumption that presuppositions are contents which must be entailed by the input context; instead, I propose that presuppositions are contents which are marked as backgrounded. I show that, together, these commitments allow us to avoid the proviso problem altogether, and generally make plausible predictions about presupposition projection out of connectives and attitude predicates. I close by sketching a two-dimensional implementation of my theory which allows us to make further welcome predictions about attitude predicates and quantifiers. (shrink)

The Proviso Problem is the discrepancy between the predictions of nearly every major theory of semantic presupposition about what is semantically presupposed by conditionals, disjunctions, and conjunctions, versus observations about what speakers of certain sentences are felt to be presupposing. I argue that the Proviso Problem is a more serious problem than has been widely recognized. After briefly describing the problem and two standard responses to it, I give a number of examples which, I argue, show that those responses are (...) inadequate. I conclude by briefly exploring alternate approaches to presupposition that avoid this problem. -/- . (shrink)