In what does the sense of a sentential connective consist? Like many others, I hold that its sense lies in rules that govern deductions. In the present paper, however, I argue that a classical logician should take the relevant deductions to be arguments involving affirmative or negative answers to yes-or-no questions that contain the connective. An intuitionistic logician will differ in concentrating exclusively upon affirmative answers. I conclude by arguing that a well known intuitionistic criticism of classical logic fails if (...) the answer "No" is accorded parity with the answer "Yes". (shrink)

This article surveys the state of the art in the field of semantic universals. We examine potential semantic universals in three areas: (i) the lexicon, (ii) semantic “glue” (functional morphemes and composition principles), and (iii) pragmatics. At the level of the lexicon, we find remarkably few convincing semantic universals. At the level of functional morphemes and composition principles, we discuss a number of promising constraints, most of which require further empirical testing and/or refinement. In the realm of pragmatics, we predict (...) that Gricean mechanisms are universal, but suggest that the precise nature of presuppositions may be subject to cross-linguistic variation. Finally, we follow E.L. Keenan in concluding that the overarching universal of effability or translatability between languages cannot be upheld in its strongest form. A recurring theme throughout this survey is how much work still remains to be done in the relatively young field of cross-linguistic formal semantics. (shrink)

Natural language does not express all connectives definable in classical logic as simple lexical items. Coordination in English is expressed by conjunction and, disjunction or, and negated disjunction nor. Other languages pattern similarly. Non-lexicalized connectives are typically expressed compositionally: in English, negated conjunction is typically expressed by combining negation and conjunction (not both). This is surprising: if $$\wedge $$ ∧ and $$\vee $$ ∨ are duals, and the negation of the latter can be expressed lexically (nor), why not the negation (...) of the former? I present a two-tiered model of the semantics of the binary connectives. The first tier captures the expressive power of the lexicon: it is a bilateral state-based semantics that, under a restriction, can express all and only the distinctions that can be expressed by the lexicon of natural language (and, or, nor). This first tier is characterized by rejection as non-assertion and a Neglect Zero assumption. The second tier is obtained by dropping the Neglect Zero assumption and enforcing a stronger notion of rejection, thereby recovering classical logic and thus definitions for all Boolean connectives. On the two-tiered model, we distinguish the limited expressive resources of the lexicon and the greater combinatorial expressive power of the language as a whole. This gives us a logic-based account of compositionality for the Boolean fragment of the language. (shrink)

Given current data, only a few binary Boolean operators are expressed in lexically simple fashion in the world's languages: and, or, nor. These do not occur in every combination, for example, nor is not observed by itself. To explain these cross‐linguistic patterns, we propose an encoding of Boolean operators as update procedures to accept or reject information in a context. We define a measure of conceptual simplicity for such updates, on which attested operators are conceptually simpler than the remaining Booleans. (...) Moreover, we show that language evolution selects for the attested lexical inventories by minimizing the complexity of using a lexical inventory compositionally to convey precise information. (shrink)

Utterances of natural language sentences can be used to communicate not just contents, but also forces. This paper examines this topic from a cross-linguistic perspective on sentential mood. Recent work in this area focuses on conversational dynamics: the three sentence types can be associated with distinctive kinds of conversational effects called sentential forces, modeled as three kinds of updates to the discourse context. This paper has two main goals. First, it provides two arguments, on empirical and methodological grounds, for treating (...) sentential force as part of a compositional dynamic semantics, rather than a dynamic pragmatics. Second, it formulates a minimal dynamic semantic analysis that covers the data at the heart of these arguments, incorporating existing analyses of the three major moods, evidentials and conjunction. A further aim of the paper is to sharpen the distinction between sentential force and utterance force, and discuss its implications. (shrink)

We present and defend the Australian Plan semantics for negation. This is a comprehensive account, suitable for a variety of different logics. It is based on two ideas. The first is that negation is an exclusion-expressing device: we utter negations to express incompatibilities. The second is that, because incompatibility is modal, negation is a modal operator as well. It can, then, be modelled as a quantifier over points in frames, restricted by accessibility relations representing compatibilities and incompatibilities between such points. (...) We defuse a number of objections to this Plan, raised by supporters of the American Plan for negation, in which negation is handled via a many-valued semantics. We show that the Australian Plan has substantial advantages over the American Plan. (shrink)

One of the great successes of the application of generalized quantifiers to natural language has been the ability to formulate robust semantic universals. When such a universal is attested, the question arises as to the source of the universal. In this paper, we explore the hypothesis that many semantic universals arise because expressions satisfying the universal are easier to learn than those that do not. While the idea that learnability explains universals is not new, explicit accounts of learning that can (...) make good on this hypothesis are few and far between. We propose a model of learning — back-propagation through a recurrent neural network — which can make good on this promise. In particular, we discuss the universals of monotonicity, quantity, and conservativity and perform computational experiments of training such a network to learn to verify quantifiers. Our results are able to explain monotonicity and quantity quite well. We suggest that conservativity may have a different source than the other universals. (shrink)

ABSTRACTLinguistic evidence supports the claim that certain, weak rejections are less specific than assertions. On the basis of this evidence, it has been argued that rejected sentences cannot be premisses and conclusions in inferences. We give examples of inferences with weakly rejected sentences as premisses and conclusions. We then propose a logic of weak rejection which accounts for the relevant phenomena and is motivated by principles of coherence in dialogue. We give a semantics for which this logic is sound and (...) complete, show that it axiomatizes the modal logic KD45 and prove that it still derives classical logic on its asserted fragment. Finally, we defend previous logics of strong rejection as being about the linguistically preferred interpretations of weak rejections. (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.

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)

This book offers a unique synthesis of past and current work on the structure, meaning, and use of negation and negative expressions, a topic that has engaged thinkers from Aristotle and the Buddha to Freud and Chomsky. Horn's masterful study melds a review of scholarship in philosophy, psychology, and linguistics with original research, providing a full picture of negation in natural language and thought; this new edition adds a comprehensive preface and bibliography, surveying research since the book's original publication.

We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consists of definable update rules for changing plausibility relations between worlds, which have been proposed independently in the dynamic-epistemic literature on preference change. Our analysis yields two new types of modal result. First, we obtain complete logics for concrete mechanisms of belief revision, based on compositional reduction axioms. Next, we show how various abstract postulates for (...) belief revision can be analyzed by standard modal frame correspondences for model-changing operations. (shrink)

Presents a version of dynamic semantics for a language with presuppositions that predicts basic facts about presupposition projection in a non-stipulative way.