This paper develops a compositional, type-driven constraint semantic theory for a fragment of the language of subjective uncertainty. In the particular application explored here, the interpretation function of constraint semantics yields not propositions but constraints on credal states as the semantic values of declarative sentences. Constraints are richer than propositions in that constraints can straightforwardly represent assessments of the probability that the world is one way rather than another. The richness of constraints helps us model communicative acts in essentially the (...) same way that we model agents’ credences. Moreover, supplementing familiar truth-conditional theories of epistemic modals with constraint semantics helps capture contrasts between strong necessity and possibility modals, on the one hand, and weak necessity modals, on the other. (shrink)

We revisit a typological puzzle due to Horn (Doctoral Dissertation, UCLA, 1972) regarding the lexicalization of logical operators: in instantiations of the traditional square of opposition across categories and languages, the O corner, corresponding to ‘nand’ (= not and), ‘nevery’ (= not every), etc., is never lexicalized. We discuss Horn’s proposal, which involves the interaction of two economy conditions, one that relies on scalar implicatures and one that relies on markedness. We observe that in order to express markedness and to (...) account for a bigger typological puzzle, namely the absence of lexicalizations of ‘XOR’ (= exclusive or), ‘all-or-none’, and many other imaginable logical operators, one must restrict the basic lexicalizable elements to a small set of primitives. We suggest that an ordering based perspective, following Keenan and Faltz (Boolean semantics for natural language, 1985), makes the stipulated primitives that we arrive at more natural. We also propose a modification to Horn’s proposal, based on recent work on implicatures, in which only the implicature condition is operative and in which markedness is part of the definition of the alternatives for scalar implicatures rather than an independent condition. (shrink)

The epistemic modal auxiliaries must and might are vehicles for expressing the force with which a proposition follows from some body of evidence or information. Standard approaches model these operators using quantificational modal logic, but probabilistic approaches are becoming increasingly influential. According to a traditional view, must is a maximally strong epistemic operator and might is a bare possibility one. A competing account—popular amongst proponents of a probabilisitic turn—says that, given a body of evidence, must \ entails that \\) is (...) high but non-maximal and might \ that \\) is significantly greater than 0. Drawing on several observations concerning the behavior of must, might and similar epistemic operators in evidential contexts, deductive inferences, downplaying and retractions scenarios, and expressions of epistemic tension, I argue that those two influential accounts have systematic descriptive shortcomings. To better make sense of their complex behavior, I propose instead a broadly Kratzerian account according to which must \ entails that \ = 1\) and might \ that \ > 0\), given a body of evidence and a set of normality assumptions about the world. From this perspective, must and might are vehicles for expressing a common mode of reasoning whereby we draw inferences from specific bits of evidence against a rich set of background assumptions—some of which we represent as defeasible—which capture our general expectations about the world. I will show that the predictions of this Kratzerian account can be substantially refined once it is combined with a specific yet independently motivated ‘grammatical’ approach to the computation of scalar implicatures. Finally, I discuss some implications of these results for more general discussions concerning the empirical and theoretical motivation to adopt a probabilisitic semantic framework. (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)