This paper critiques a number of standard ways of understanding the role of the metalanguage in a semantic theory for natural language, including the idea that disquotation plays a nontrivial role in any explanatory natural language semantics. It then proposes that the best way to understand the role of a semantic metalanguage involves recognizing that semantics is a model-based science. The metalanguage of semantics is language for articulating features of the theorist's model. Models are understood as mediating instruments---idealized structures used (...) to represent select aspects of the world, aspects the theorist is seeking some theoretical understanding of. The aspect of reality we are seeking some understanding of in semantics is a dimension of human linguistic competence---informally, knowledge of meaning. (shrink)

The paper investigates interpretations of propositional and firstorder logic in which validity is defined in terms of partial indices; sometimes called possibilities but here understood as non-empty subsets of a set W of possible worlds. Truth at a set of worlds is understood to be truth at every world in the set. If all subsets of W are permitted the logic so determined is classical first-order predicate logic. Restricting allowable subsets and then imposing certain closure conditions provides a modelling for (...) intuitionistic predicate logic. The same semantic interpretation rules are used in both logics for all the operators. (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)

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)

The notion of bilattice was introduced by Ginsberg, and further examined by Fitting, as a general framework for many applications. In the present paper we develop proof systems, which correspond to bilattices in an essential way. For this goal we introduce the notion of logical bilattices. We also show how they can be used for efficient inferences from possibly inconsistent data. For this we incorporate certain ideas of Kifer and Lozinskii, which happen to suit well the context of our work. (...) The outcome are paraconsistent logics with a lot of desirable properties.1. (shrink)

The article proposes an analysis of imperatives and possibility and necessity statements that (i) explains their differences with respect to the licensing of free choice any and (ii) accounts for the related phenomena of free choice disjunction in imperatives, permissions, and statements. Any and or are analyzed as operators introducing sets of alternative propositions. Free choice licensing operators are treated as quantifiers over these sets. In this way their interpretation can be sensitive to the alternatives any and or introduce in (...) their scope. (shrink)

Kleene’s well-known strong three-valued logic is shown to be one of a family of logics with similar mathematical properties. These logics are produced by an intuitively natural construction. The resulting logics have direct relationships with bilattices. In addition they possess mathematical features that lend themselves well to semantical constructions based on fixpoint procedures, as in logic programming.

This paper offers an explanation of the fact that sentences of the form (1) ‘X may A or B’ may be construed as implying (2) ‘X may A and X may B’, especially if they are used to grant permission. It is suggested that the effect arises because disjunctions are conjunctive lists of epistemic possibilities. Consequently, if the modal may is itself epistemic, (1) comes out as equivalent to (2), due to general laws of epistemic logic. On the other hand, (...) on a deontic reading of may, (2) is only implied under exceptional circumstances – which usually obtain when (1) is used performatively. (shrink)

Expressivists, such as Blackburn, analyse sentences such as 'S thinks that it ought to be the case that p' as S hoorays that p'. A problem is that the former sentence can be negated in three different ways, but the latter in only two. The distinction between refusing to accept a moral judgement and accepting its negation therefore cannot be accounted for. This is shown to undermine Blackburn's solution to the Frege-Geach problem.

Expressivists have a problem with negation. The problem is that they have not, to date, been able to explain why ‘murdering is wrong’ and ‘murdering is not wrong’ are inconsistent sentences. In this paper, I explain the nature of the problem, and why the best efforts of Gibbard, Dreier, and Horgan and Timmons don’t solve it. Then I show how to diagnose where the problem comes from, and consequently how it is possible for expressivists to solve it. Expressivists should accept (...) this solution, I argue, because it is demonstrably the only way of avoiding the problem, and because it generalizes. Once we see how to solve the negation problem, I show, it becomes easy to state a constructive, compositional expressivist semantics for a purely normative language with the expressive power of propositional logic, in which we can for the first time give explanatory, formally adequate expressivist accounts of logical inconsistency, logical entailment, and logical validity. As a corollary, I give what I take to be the first real expressivist explanation of why Geach’s original moral modus ponens argument is genuinely logically valid. This proves that the problem with expressivism cannot be that it can’t account for the logical properties of complex normative sentences. But it does not show that the same solution can work for a language with both normative and descriptive predicates, let alone that expressivists are able to deal with more complex linguistic constructions like tense, modals, or even quantifiers. In the final section, I show what kind of constraints the solution offered here would place expressivists under, in answering these further questions. (shrink)

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)

Barristers in England are obliged to follow the ‘cab rank rule’, according to which they must take any case offered to them, as long as they have time in their.

The existing literature treats of several investigations with a certain bearing on the question which is roughly indicated by the title “Imperatives and Logic.” Some of those investigations, however, are entirely outside the scope of the present work.Mally sets himself the task of developing a “Logik des Willens” constituting a parallel to the usual logic, the “Logik des Denkens". In order to emphasize its independence, the author also calls this “Logik des Willens” “Deontik”, and he conceives it as being based (...) on the “Wesensgesetze” of will in the same way as the usual logic is conceived as being based on the “Wesensgesetze” of thought. The author develops a formalistic deductive system on the basis of 5 axioms of demands, including the axiom that there is at least one fact which is unconditionally demanded, and through a lengthy series of theorems he arrives at the sentence that what is unconditionally demanded is identical with what is actually the case: “was sein soll, ist Tatsache”. Similarly, the author develops a system of axioms for “right” volition, including the axiom that right volition is non-contradictory. (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)

Hans Kamp; IV*—Free Choice Permission, Proceedings of the Aristotelian Society, Volume 74, Issue 1, 1 June 1974, Pages 57–74, https://doi.org/10.1093/aristoteli.

We discuss a well-known puzzle about the lexicalization of logical operators in natural language, in particular connectives and quantifiers. Of the many logically possible operators, only few appear in the lexicon of natural languages: the connectives in English, for example, are conjunction _and_, disjunction _or_, and negated disjunction _nor_; the lexical quantifiers are _all, some_ and _no_. The logically possible nand (negated conjunction) and Nall (negated universal) are not expressed by lexical entries in English, nor in any natural language. Moreover, (...) the lexicalized operators are all upward or downward monotone, an observation known as the Monotonicity Universal. We propose a logical explanation of lexical gaps and of the Monotonicity Universal, based on the dynamic behaviour of connectives and quantifiers. We define update potentials for logical operators as procedures to modify the context, under the assumption that an update by \( \phi \) depends on the logical form of \( \phi \) and on the speech act performed: assertion or rejection. We conjecture that the adequacy of update potentials determines the limits of lexicalizability for logical operators in natural language. Finally, we show that on this framework the Monotonicity Universal follows from the logical properties of the updates that correspond to each operator. (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)

Expressivists about epistemic modals deny that ‘Jane might be late’ canonically serves to express the speaker’s acceptance of a certain propositional content. Instead, they hold that it expresses a lack of acceptance. Prominent expressivists embrace pragmatic expressivism: the doxastic property expressed by a declarative is not helpfully identified with that sentence’s compositional semantic value. Against this, we defend semantic expressivism about epistemic modals: the semantic value of a declarative from this domain is the property of doxastic attitudes it canonically serves (...) to express. In support, we synthesize data from the critical literature on expressivism—largely reflecting interactions between modals and disjunctions—and present a semantic expressivism that readily predicts the data. This contrasts with salient competitors, including: pragmatic expressivism based on domain semantics or dynamic semantics; semantic expressivism à la Moss [2015]; and the bounded relational semantics of Mandelkern [2019]. (shrink)

We develop a novel solution to the negation version of the Frege-Geach problem by taking up recent insights from the bilateral programme in logic. Bilateralists derive the meaning of negation from a primitive *B-type* inconsistency involving the attitudes of assent and dissent. Some may demand an explanation of this inconsistency in simpler terms, but we argue that bilateralism’s assumptions are no less explanatory than those of *A-type* semantics that only require a single primitive attitude, but must stipulate inconsistency elsewhere. Based (...) on these insights, we develop a version of B-type expressivism called *inferential expressivism*. This is a novel semantic framework that characterises meanings by inferential roles that define which *attitudes* one can *infer* from the use of terms. We apply this framework to normative vocabulary, thereby solving the Frege-Geach problem generally and comprehensively. Our account moreover includes a semantics for epistemic modals, thereby also explaining normative terms under epistemic modals. (shrink)

Our topic is the notion of logical consequence: the link between premises and conclusions, the glue that holds together deductively valid argument. How can we understand this relation between premises and conclusions? It seems that any account begs questions. Painting with very broad brushtrokes, we can sketch the landscape of disagreement like this: “Realists” prefer an analysis of logical consequence in terms of the preservation of truth [29]. “Anti-realists” take this to be unhelpful and o:er alternative analyses. Some, like Dummett, (...) look to preservation of warrant to assert [9, 36]. Others, like Brandom [5], take inference as primitive, and analyse other notions in terms of it. There is plenty of disagreement on the “realist” side of the fence too. It is one thing to argue that logical consequence involves preservation of truth. It is another to explain how far truth must be preserved. Is the preservation essentially modal (in all circumstances [25]) or analytic (vouchsafed by.. (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)