In many languages, the same particles that form quantifier words also serve as connectives, additive and scalar particles, question markers, roots of existential verbs, and so on. Do these have a unified semantics, or do they merely bear a family resemblance? Are they aided by silent operators in their varied roles―if yes, what operators? I dub the particles “quantifier particles” and refer to them generically with capitalized versions of the Japanese morphemes. I argue that both MO and KA can be (...) assigned a stable semantics across their various roles. The specific analysis I offer is motivated by the fact that MO and KA often combine with just one argument; I propose that this is their characteristic behavior. Their role is to impose semantic requirements that are satisfied when the immediately larger context is interpreted as the meet/join of their host’s semantic contribution with something else. They do not perform meet/join themselves. The obligatory vs. optional appearance of the particles depends on whether the meet/join interpretations arise by default in the given constellation. I explicate the proposal using the toolkit of basic Inquisitive Semantics. (shrink)

Crosslinguistically, questions frequently make crucial use of morphosyntactic elements which also occur outside of questions. Chief among these are focus, disjunctions, and wh-words with indefinite semantics. This paper provides a compositional account of the semantics of wh-, alternative, and polar questions in Yucatec Maya (YM), which are composed primarily of these elements. Key to the account is a theory of disjunctions and indefinites (extending work by others) which recognizes the inherently inquisitive nature of these elements. While disjunctions and indefinites are (...) inquisitive, they differ from questions since they are also truth-conditionally informative. Compositionally, then, the role of focus in YM questions is to presuppose the informative component of an indefinite wh-word or disjunction, rendering the inquisitive component the question’s only new contribution to the discourse. In addition to deriving question denotations compositionally, the account also captures a potentially surprising fact: focused disjunctions in YM can function as either questions or assertions, depending solely on the discourse context. (shrink)

This article develops a Gricean account for the computation of scalarimplicatures in cases where one scalar term is in the scope ofanother. It shows that a cross-product of two quantitative scalesyields the appropriate scale for many such cases. One exception iscases involving disjunction. For these, I propose an analysis that makesuse of a novel, partially ordered quantitative scale for disjunction andcapitalizes on the idea that implicatures may have different epistemic status.

In this essay, we propose that Peirce’s Existential Graphs can derive the desired uniqueness implication (or in a weaker claim, the definite description readings) of donkey pronouns in conjunctive discourse (A man walks in the park. He whistles), without postulating a separate category of E-type pronouns.

Explicatures are not cancellable. Theoretical considerations.

In this paper, the meanings of sentences containing the word or and a modal verb are used to arrive at a novel account of the meaning of or coordinations. It is proposed that or coordinations denote sets whose members are the denotations of the disjuncts; and that the truth conditions of sentences containing or coordinations require the existence of some set made available by the semantic environment which can be ‘divided up’ in accordance with the disjuncts. The relevant notion of (...) ‘dividing things up’ is made explicit in the paper. Detailed attention is given to the question of how the proposed truth conditions are derived from the syntactic input. The account offered allows for the derivation of both the disjunctive and the nondisjunctive readings of modal/or sentences, including the much-discussed free choice readings of may/or sentences. (shrink)

An exclusive disjunction is true when exactly one of the disjuncts is true. In the case of the familiar binary exclusive disjunction, we have a formula occurring as the first disjunct and a formula occurring as the second disjunct, so, if what we have is two formula-tokens of the same formula-type—one formula occurring twice over, that is—the question arises as to whether, when that formula is true, to count the case as one in which exactly one of the disjuncts is (...) true, counting by type, or as a case in which two disjuncts are true, counting by token. The latter is the standard answer: counting by tokens. James McCawley once suggested that, when the exclusively disjunctive construction in natural language is at issue, the construction should be treated as involving a multigrade connective whose semantic treatment is sensitive to the set of disjuncts rather than the corresponding multiset. Without any commitment as to whether there actually is such a construction, and conceding that for obvious pragmatic reasons such ‘repeated disjunct’ cases would be at best highly marginal, we note that for the binary case, this requires a nonstandard answer—count by type rather than by token—to the earlier question, and thus, an idempotent exclusive disjunction connective. Section 2 explores that idea and Section 3, a further idempotent variant for which it is the propositions expressed by the disjuncts, rather than the disjuncts themselves, that get counted once only in the case of repetitions. Sections 1 and 4 respectively set the stage for these investigations and conclude the discussion. More detailed considerations of points arising from the discussion but otherwise in danger of interrupting the flow are deferred to a ‘Longer Notes’ appendix at the end. (shrink)

Hurford’s Constraint (Hurford, Foundations of Language, 11, 409–411, 1974) states that a disjunction is infelicitous if its disjuncts stand in an entailment relation: #John was born in Paris or in France. Gazdar (Pragmatics, Academic Press, NY, 1979) observed that scalar implicatures can obviate the constraint. For instance, sentences of the form (A or B) or (Both Aand B) are felicitous due to the exclusivity implicature of the first disjunct: A or B implicates ‘not (A and B)’. Chierchia, Fox, and Spector (...) (Handbook of semantics, 2008) use the obviation of Hurford’s Constraint in these cases to argue for a theory of local implicature. I present evidence indicating that the constraint needs to be modified in two ways. First, implicatures can obviate Hurford’s Constraint only in earlier disjuncts, not later ones: #(Both A and B) or (A or B). Second, the constraint rules out not only disjuncts that stand in an entailment relation, but also disjuncts that are even mutually consistent: #John is from Russia or Asia. I propose to make sense of these facts by providing an incremental evaluation procedure which checks that each new disjunct to the right is inconsistent with the information to its left, before the disjunct can be strengthened by local implicature. (shrink)

This paper refutes the widespread view that disjunctions of imperatives invariably grant free choice between the actions named by their disjuncts. Like other disjunctions they can also express a correlation with some factual distinction, but as with modalized declaratives used for non-assertive speech acts this needs to be indicated explicitly. A compositional analysis of one such indicator, depending on, constitutes the point of departure for a uniform analysis of disjunctions across clause types. Disjunctions are analyzed as sets of propositional alternatives (...) that correlate with a partition that the speaker may or may not be able to indicate explicitly. Free choice arises as the specific case where the partition is induced by the preferences of the addressee. (shrink)

The exclusive component of unembedded disjunctions is standardly derived as a conversational implicature by assuming that or forms a lexical scale with and. It is well known, however, that this assumption does not suffice to determine the required scalar competitors of disjunctions with more than two atomic disjuncts (McCawley, Everything that linguists have always wanted to know about logic* (But were ashamed to ask). Chicago University Press, Chicago, 1993, p. 324; Simons, “Or”: Issues in the semantics and pragmatics of disjunction. (...) Ph.D. thesis, Cornell University, Ithaca, NY, 1998). To solve this, Sauerland (Linguist Philos 27(3): 367–391, 2004) assumes that or forms a lexical scale with two otherwise unattested silent connectives ( ${\mathbb{L}}$ and ${\mathbb{R}}$ ) that retrieve the left and right terms of a disjunction. A number of recent works have proposed an Alternative Semantics for indefinites and disjunction to account for their interaction with modals and other propositional operators (Kratzer and Shimoyama, In: Otsu Y (ed) The Proceedings of the Third Tokyo Conference on Psycholinguistics. Hituzi Syobo, Tokyo, pp. 1–25, 2002; Aloni, In: Weisgerber M (ed) Proceedings of the Conference “SuB7—Sinn und Bedeutung”. Arbeitspapier Nr. 114. Konstanz, pp. 28–37, 2003; Simons, Nat Lang Semantics 13: 271–316, 2005; Alonso-Ovalle, Disjunction in alternative semantics. Ph.D. thesis, University of Massachusetts, Amherst, MA, 2006). We note that the McCawley–Simons problem does not arise in an Alternative Semantics, if we assume that the set of pragmatic competitors to a disjunction is the closure under intersection of the set of propositions that it denotes. An adaptation of the strengthening mechanism presented in Fox (In: Sauerland U, Stateva P (eds) Presupposition and implicature in compositional semantics. MacMillan, Palgrave, pp. 71–120, 2007) allows for the derivation of the exclusive component of disjunctions with more than two atomic disjuncts without having to rely on the ${\mathbb{L}}$ and ${\mathbb{R}}$ operators. The proposal extends to the case of disjunctions with logically dependent disjuncts. (shrink)