Disjunction

In his 1981 paper “From Worlds to Possibilities”, Lloyd Humberstone developed an approach to modal logic using possibilities rather than possible worlds. Possibilities, unlike worlds, may be incomplete. This paper sets out the possibility frame approach to modal logic, proves some results about its logic (including that some logics definable on Humberstone frames are not definable on Kripke frames), and surveys several applications, including to conditionals, vagueness, and fiction.

A general mathematical framework, based on countable partitions of Natural Numbers [1], is presented, that allows to provide a Semantics to propositional languages. It has the particularity of allowing both the valuations and the interpretation Sets for the connectives to discriminate complexity of the formulas. This allows different adequacy criteria to be used to assess formulas associated with the same connective, but that differ in their complexity. The presented method can be adapted potentially infinite number of connectives and truth values, (...) therefore, it can be considered a general framework to provide semantics to several of the known logic systems (eg, LC, L3 LP, FDE). The presented semantics allow to converge to different standard semantics if the separation complexity procedure is annulled. Therefore, it can be understood as a framework that allows greater precision (in complexity terms) with respect to formula satisfaction. Naturally, because of how it is built, it can be incorporated into non-deterministic semantics. The presented procedure also allows generating valuations that grant a different truth value to each formula of propositional language. As a positive side effect, our method allows a constructive proof of the equipotence between N and N^n for all Natural n. (shrink)

I explore constructions which contain an embedded disjunction ⌜p or q⌝which is interpreted as (p∨q) ∧♢p∧♢q, where ♢is a possibility modal whose flavor is epistemic, circumstantial, or deontic. I argue that no extant theory can account for these interpretations. I propose that the best way to do so is with a direct theory on which ⌜p or q⌝ simply means (p∨q) ∧♢p∧♢q. In addition to accounting for the novel cases I discuss, this theory explains both wide- and narrow-scope free choice (...) inferences, in a similar way as the theories of Zimmermann (2000); Geurts (2005); Goldstein (2019). It also accounts for recent observations about the relation between disjunction and possibility from Degano et al. 2025; Feinmann 2023. (shrink)

This paper is concerned with disjunctions of universal modals, such as ‘You have to clean your room or you have to walk the dog’, and disjunctions of conditionals, such as ‘If Alice dances, Charlie will dance, or if Bob dances, Charlie will dance’. We aim to provide a uniform account of their surprising behaviour. Our proposal combines three independently attested components. Firstly, disjunction's dynamic effect, familiar from presupposition projection: when we evaluate a disjunction ‘A or B’, we typically interpret B (...) assuming the negation of A, and optionally, also interpret A assuming the negation of B. Secondly, the fact that disjunctions often receive a conjunctive interpretation, familiar from free choice phenomena. Thirdly, that modal bases are restricted to local contexts, what Mandelkern has called ‘bounded modality’. (shrink)

The propositional connectives – and, or, not, if–then, etc. – are fundamental building blocks in formal as well as natural languages. In the Western tradition, they were first studied as such by the Stoics, and Propositional Logic is the fundament of practically all current systems of logic; every beginning logic course starts with it. Still, the proof theory and semantics of systems of propositional logic are far from trivial, and have been studied intensely by logicians in the last one and (...) a half centuries, not least in recent decades. It is actually a vast area of research, as witnessed by Lloyd Humberstone’s 1500 page tome The Connectives (2011), which overviews much of that research. Perhaps the most familiar recent work in this area concerns conditionals in formal and natural languages. The 4th Tsinghua Interdisciplinary Workshop on Logic, Language, and Meaning (TLLM 2024) also focused on the apparently simpler connectives expressing (various versions of) conjunction, disjunction, and negation. -/- Researchers working from a cross-linguistic perspective also study how the connectives are encoded in different languages, and ask whether classical logic is capable of capturing the variations and universals exhibited. Even in well-studied languages such as English, there are intricate phenomena that remain challenging for classical logic, including free choice disjunction, non-Boolean conjunction, and metalinguistic negation, to name just a few. There is also growing interest in the acquisition and processing of natural language connectives. In the context of the hotly discussed Large Language Models (LLMs), understanding connectives presents novel challenges that deserve in-depth exploration. (shrink)

Given any set _E_ of expressions freely generated from a set of atoms by syntactic operations, there exist trivially compositional functions on _E_ (to wit, the injective and the constant functions), but also plenty of non-trivially compositional functions. Here we show that within the space of non-injective functions (and so _a fortiori_ within the space of non-injective and non-constant functions), compositional functions are not sufficiently abundant in order to generate the consequence relation of every propositional logic. Logical consequence relations thus (...) impose substantive constraints on the existence of compositional functions when coupled with the condition of non-injectivity (though not without it). We ask how the _apriori_ exclusion of injective functions from the search space might be justified, and we discuss the prospects of claims to the effect that any function can be “encoded” in a compositional one. (shrink)

We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present a Fitch-style natural deduction system for the logic that contains only the introduction and elimination rules for the logical constants. From this starting point, if one adds the rule that Fitch called Reiteration, one obtains a proof system for intuitionistic logic in the given signature; (...) if instead of adding Reiteration, one adds the rule of Reductio ad Absurdum, one obtains a proof system for orthologic; by adding both Reiteration and Reductio, one obtains a proof system for classical logic. Arguably neither Reiteration nor Reductio is as intimately related to the meaning of the connectives as the introduction and elimination rules are, so the base logic we identify serves as a more fundamental starting point and common ground between proponents of intuitionistic logic, orthologic, and classical logic. The algebraic semantics for the logic we motivate proof-theoretically is based on bounded lattices equipped with what has been called a weak pseudocomplementation. We show that such lattice expansions are representable using a set together with a reflexive binary relation satisfying a simple first-order condition, which yields an elegant relational semantics for the logic. This builds on our previous study of representations of lattices with negations, which we extend and specialize for several types of negation in addition to weak pseudocomplementation; in an appendix, we further extend this representation to lattices with implications. Finally, we discuss adding to our logic a conditional obeying only introduction and elimination rules, interpreted as a modality using a family of accessibility relations. (shrink)

Fine (J. Philos. Logic 46(6):625–674, 2017a) sets out a theory of content based on truthmaker semantics which distinguishes two kinds of consequence between contents. There is entailment, corresponding to the relationship between disjunct and disjunction, and there is containment, corresponding to the relationship between conjunctions and their conjuncts. Fine associates these with two notions of parthood: disjunctive and conjunctive. Conjunctive parthood is a very useful notion, allowing us to analyse partial content and partial truth. In this chapter, I extend the (...) notion of disjunctive parthood in terms of a structural relation of refinement, which stands to disjunctive parthood much as mereological parthood stands to conjunctive parthood. Philosophically, this relation may be modelled on the determinable-determinate relation, or on a fact-to-fact notion of grounding. I discuss its connection to two other Finean notions: vagueness (understood via precisification) and arbitrary objects. I then investigate what a logic of truthmaking with refinement might look like. I argue that (i) parthood naturally gives rise to a relevant conditional; (ii) refinement underlies a relevant notion of disjunction; and so (iii) truthmaker semantics with refinement is a natural home for relevant logic. The resulting formal models draw on Fine’s (J. Philos. Logic 3(4):347–372, 1974) semantics for relevant logics. Finally, I use this understanding of relevant semantics to investigate the status of the mingle axiom. (shrink)

Orthodox semantics for natural language modals give rise to two puzzles for their interactions with disjunction: Ross’s puzzle and the puzzle of free choice permission. It is widely assumed that each puzzle can be explained in terms of the licensing of ‘Diversity’ inferences: from the truth of a possibility or necessity modal with an embedded disjunction, hearers infer that each disjunct is compatible with the relevant set of worlds. I argue that Diversity inferences are too weak to explain the full (...) range of data. Instead, I argue, modals with embedded disjunctions license ‘Independence’ inferences: from the truth of a modal with an embedded disjunction, hearers infer that each disjunct is an independent alternative among the relevant set of worlds. I then develop a bilateral inquisitive semantics for modals that predicts the validity of these Independence inferences. My account vindicates common intuitions about both Ross’s puzzle and the puzzle of free choice permission, and explains the full range of data. (shrink)

Upward monotonic semantics for necessity modals give rise to Ross’s Puzzle: they predict that □φ entails □(φ ∨ ψ), but common intuitions about arguments of this form suggest they are invalid. It is widely assumed that the intuitive judgments involved in Ross’s Puzzle can be explained in terms of the licensing of ‘Diversity’ inferences: from □(φ ∨ ψ), interpreters infer that the truth of each disjunct (φ, ψ) is compatible with the relevant set of worlds. I introduce two pieces of (...) data that this analysis fails to explain. Analyzing this data, I argue, suggests that necessity modals with embedded disjunctions license ‘Independence’ inferences: from the truth of □(φ ∨ ψ), interpreters infer that φ-without-ψ and ψ-without-φ are each compatible with the relevant set of worlds. I outline a bilateral inquisitive semantics for necessity modals that predicts the validity of the Independence inferences. I then argue that the resulting theory should be understood as one on which disjunctions denote pluralities of propositions, and necessity modals behave like collective predicates applied to these pluralities. (shrink)

The use of the symbol ∨for disjunction in formal logic is ubiquitous. Where did it come from? The paper details the evolution of the symbol ∨ in its historical and logical context. Some sources say that disjunction in its use as connecting propositions or formulas was introduced by Peano; others suggest that it originated as an abbreviation of the Latin word for “or,” vel. We show that the origin of the symbol ∨ for disjunction can be traced to Whitehead and (...) Russell’s pre-Principia work in formal logic. Because of Principia’s influence, its notation was widely adopted by philosophers working in logic (the logical empiricists in the 1920s and 1930s, especially Carnap and early Quine). Hilbert’s adoption of ∨ in his Grundzüge der theoretischen Logik guaranteed its widespread use by mathematical logicians. The origins of other logical symbols are also discussed. (shrink)

By pooling together exhaustive analyses of certain philosophical paradoxes, we can prove a series of fascinating results regarding philosophical progress, agreement on substantive philosophical claims, knockdown arguments in philosophy, the wisdom of philosophical belief, the epistemic status of metaphysics, and the power of philosophy to refute common sense. As examples, this Element examines the Sorites Paradox, the Liar Paradox, and the Problem of the Many – although many other paradoxes can do the trick too.

In this paper, we axiomatize the deontic logic in Fusco (2015), which uses a Stalnaker-inspired account of diagonal acceptance and a two-dimensional account of disjunction to treat Ross’s Paradox and the Puzzle of Free Choice Permission. On this account, disjunction-involving validities are a priori rather than necessary. We show how to axiomatize two-dimensional disjunction so that the introduction/elimination rules for boolean disjunction can be viewed as one-dimensional projections of more general two-dimensional rules. These completeness results help make explicit the restrictions (...) Fusco’s account must place on free-choice inferences. They are also of independent interest, as they raise difficult questions about how to “lift” a Kripke frame for a one-dimensional modal logic into two dimensions. (shrink)

In this paper, we study three representations of lattices by means of a set with a binary relation of compatibility in the tradition of Ploščica. The standard representations of complete ortholattices and complete perfect Heyting algebras drop out as special cases of the first representation, while the second covers arbitrary complete lattices, as well as complete lattices equipped with a negation we call a protocomplementation. The third topological representation is a variant of that of Craig, Haviar, and Priestley. We then (...) extend each of the three representations to lattices with a multiplicative unary modality; the representing structures, like so-called graph-based frames, add a second relation of accessibility interacting with compatibility. The three representations generalize possibility semantics for classical modal logics to non-classical modal logics, motivated by a recent application of modal orthologic to natural language semantics. (shrink)

In this paper we discuss the notions of adequacy and truth functionality in quantum logic from the point of view of a non-deterministic semantics. We give a characterization of the degree of non-functionality which is compatible with the propositional structure of quantum theory, showing that having truth-functional connectives, together with some assumptions regarding the relation of logical consequence, commits us to the adequacy of the interpretation sets of these connectives. An advantage of our proof is that it is independent of (...) the number of truth values involved, generalizing previous works. We also show the failure of the adequacy of every Nmatrix that is a model of the non-distributive lattice of quantum propositions. (shrink)

In this paper we discuss the notions of adequacy and truth functionality in quantum logic from the point of view of a non-deterministic semantics. We give a characterization of the degree of non-functionality which is compatible with the propositional structure of quantum theory, showing that having truth-functional connectives, together with some assumptions regarding the relation of logical consequence, commits us to the adequacy of the interpretation sets of these connectives. An advantage of our proof is that it is independent of (...) the number of truth values involved, generalizing previous works. We also show the failure of the adequacy of every Nmatrix that is a model of the non-distributive lattice of quantum propositions. En este trabajo discutimos las nociones de adecuación y veritativo-funcionalidad en la lógica cuántica, desde el punto de vista de una semántica no determinista. Damos una caracterización del grado de no-funcionalidad compatible con la estructura proposicional de la teoría cuántica, mostrando que tener conectivos veritativo-funcionales, junto con algunos presupuestos relativos a la relación de consecuencia lógica, nos compromete con la adecuación de los conjuntos de interpretación de estos conectivos. Un punto ventajoso de nuestra prueba es que se independiza de la cantidad de valores de verdad involucrados, generalizando trabajos previos. Probamos también que falla la adecuación de cualquier Nmatriz que sirva como modelo para el retículo no distributivo de proposiciones cuánticas. (shrink)

This paper introduces two new paradoxes for standard deontic logic (SDL). They are importantly related to, but distinct from Ross' paradox. These two new paradoxes for SDL are the simple weakening paradox and the complex weakening paradox. Both of these paradoxes arise in virtue of the underlaying logic of SDL and are consequences of the fact that SDL incorporates the principle known as weakening. These two paradoxes then show that SDL has counter-intuitive implications related to disjunctive obligations that arise in (...) virtue of deontic weakening and in virtue of decisions concerning how to discharge such disjunctive obligations. The main result here is then that theorem T1 is a problematic component of SDL that needs to be addressed. (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)

ABSTRACT ‘You may have beer or wine’ suggests that you may have beer and you may have wine. Following Klinedinst, I argue that this ‘free choice’ effect is a special kind of scalar implicature, arising from the application of an unspecific predicate to a plurality (of worlds). I show that the implicature can be derived from general norms of cooperative communication, without postulating new grammatical rules or hidden lexical items. The derivation calls for an extension to the classical neo-Gricean model. (...) I give independent arguments for this extension. (shrink)

The Free Choice effect—whereby \\) seems to entail both \ and \—has traditionally been characterized as a phenomenon affecting the deontic modal ‘may’. This paper presents an extension of the semantic account of free choice defended by Fusco to the agentive modal ‘can’, the ‘can’ which, intuitively, describes an agent’s powers. On this account, free choice is a nonspecific de re phenomenon that—unlike typical cases—affects disjunction. I begin by sketching a model of inexact ability, which grounds a modal approach to (...) agency in a Williamson -style margin of error. A classical propositional semantics combined with this framework can reflect the intuitions highlighted by Kenny ’s dartboard cases, as well as the counterexamples to simple conditional views recently discussed by Mandelkern et al.. In Section 3, I turn to an independently motivated actual-world-sensitive account of disjunction, and show how it extends free choice inferences into an object language for propositional modal logic. (shrink)

Free Choice is the principle that possibly p or q implies and is implied by possibly p and possibly q. A variety of recent attempts to validate Free Choice rely on a nonclassical semantics for disjunction, where the meaning of p or q is not a set of possible worlds. This paper begins with a battery of impossibility results, showing that some kind of nonclassical semantics for disjunction is required in order to validate Free Choice. The paper then provides a (...) positive account of Free Choice, by identifying a family of dynamic semantics for disjunction that can validate the inference. On all such theories, the meaning of p or q has two parts. First, p or q requires that our information is consistent with each of p and q. Second, p or q narrows down our information by eliminating some worlds. It turns out that this second component of or is well behaved: there is a strongest such meaning that p or q can express, consistent with validating Free Choice. The strongest such meaning is the classical one, on which p or q eliminates any world where both p and q are false. In this way, the classical meaning of disjunction turns out to be intimately related to the validity of Free Choice. (shrink)

Vann McGee has recently argued that Belnap’s criteria constrain the formal rules of classical natural deduction to uniquely determine the semantic values of the propositional logical connectives and quantifiers if the rules are taken to be open-ended, i.e., if they are truth-preserving within any mathematically possible extension of the original language. The main assumption of his argument is that for any class of models there is a mathematically possible language in which there is a sentence true in just those models. (...) I show that this assumption does not hold for the class of models of classical propositional logic. In particular, I show that the existence of non-normal models for negation undermines McGee’s argument. (shrink)

The idea that an adequate language for science needs a negation operator was recently dismissed by Kripke as "yet another dogma of empiricism”. That a scientist could, and even should, drop negation implies at least three points: 1. negativist theories, i.e., theories formulated in languages that include negation, are conservative extensions of their affirmativist versions; 2. negativist theories have no serious advantages over their affirmativist versions; 3. negativist theories are dispensable and should better be replaced by their affirmativist versions. We (...) argue that all three points are problematic. (shrink)

This paper investigates the prospects for a semantic theory that treats disjunction as a modal operator. Potential motivation for such a theory comes from the way in which modals embed within disjunctions. After reviewing some of the relevant data, I go on to distinguish a variety of modal theories of disjunction. I analyze these theories by considering pairs of conflicting desiderata, highlighting some of the tradeoffs they must face.

In this paper, I argue that the disjunction elimination rule presupposes the principle that a true disjunction contains at least one true disjunct. However, in some contexts such as supervaluationism or quantum logic, we have good reasons to reject this principle. Hence, disjunction elimination is restricted in at least one respect: it is not applicable to disjunctions for which this principle does not hold. The insight that disjunction elimination presupposes the principle that a true disjunction contains at least one true (...) disjunct is applied to two arguments which argue for this very principle. I show that these arguments are rule-circular since they rest on disjunction elimination. I claim that rule-circularity better explains why the arguments fail than the explanations provided by Rumfitt (2015), which, for instance, rely on controversial principles about truth. (shrink)

In this paper we discuss the extent to which conjunction and disjunction can be rightfully regarded as such, in the context of infectious logics. Infectious logics are peculiar many-valued logics whose underlying algebra has an absorbing or infectious element, which is assigned to a compound formula whenever it is assigned to one of its components. To discuss these matters, we review the philosophical motivations for infectious logics due to Bochvar, Halldén, Fitting, Ferguson and Beall, noticing that none of them discusses (...) our main question. This is why we finally turn to the analysis of the truth-conditions for conjunction and disjunction in infectious logics, employing the framework of plurivalent logics, as discussed by Priest. In doing so, we arrive at the interesting conclusion that —in the context of infectious logics— conjunction is conjunction, whereas disjunction is not disjunction. (shrink)

This paper proposes a semantics for free choice permission that explains both the non-classical behavior of modals and disjunction in sentences used to grant permission, and their classical behavior under negation. It also explains why permissions can expire when new information comes in and why free choice arises even when modals scope under disjunction. On the proposed approach, deontic modals update preference orderings, and connectives operate on these updates rather than propositions. The success of this approach stems from its capacity (...) to capture the difference between expressing the preferences that give rise to permissions and conveying propositions about those preferences. (shrink)

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)

Observe that complement questions can be either directly or indirectly conjoined, but they can only be indirectly disjoined. • What theories of questions and coordination predict this difference? • Look at Partition theory (Groenendijk & Stokhof 1984) and Inquisitive Semantics (Groenendijk & Roelofsen 2009, Ciardelli et al. 2012).

Expressivism promises an illuminating account of the nature of normative judgment. But worries about the details of expressivist semantics have led many to doubt whether expressivism's putative advantages can be secured. Drawing on insights from linguistic semantics and decision theory, I develop a novel framework for implementing an expressivist semantics that I call ordering expressivism. I argue that by systematically interpreting the orderings that figure in analyses of normative terms in terms of the basic practical attitude of conditional weak preference, (...) the expressivist can explain the semantic properties of normative sentences in terms of the logical properties of that attitude. Expressivism's problems with capturing the logical relations among normative sentences can be reduced to the familiar, more tractable problem of explaining certain coherence constraints on preferences. Particular attention is given to the interpretation of wide-scope negation. The proposed solution is also extended to other types of embedded contexts—most notably, disjunctions. (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)

There are certain uses of and and or that cannot be explained by their normal meanings as truth-functional connectives, even with sophisticated pragmatic resources. These include examples such as The cops show up, and a fight will break out (‘If the cops show up, a fight will break out’), and I have no friends, or I would throw a party (‘I have no friends. If I did have friends, I would throw a party.’). We argue that these uses are indeed (...) distinct from the more ordinary uses of and and or, but that they are nonetheless related in a principled way. To explain them we give an analysis of what we call the dynamic effects of connectives, which arise in all their uses. The special uses at issue are then argued to be instances where the connectives exhibit their dynamic effects without their truth-conditional meaning. (shrink)

I show that the model-theoretic meaning that can be read off the natural deduction rules for disjunction fails to have certain desirable properties. I use this result to argue against a modest form of inferentialism which uses natural deduction rules to fix model-theoretic truth-conditions for logical connectives.

We present a series of arguments for logical nativism, focusing mainly on the meaning of disjunction in human languages. We propose that all human languages are logical in the sense that the meaning of linguistic expressions corresponding to disjunction (e.g. English or, Chinese huozhe, Japanese ka ) conform to the meaning of the logical operator in classical logic, inclusive- or. It is highly implausible, we argue, that children acquire the (logical) meaning of disjunction by observing how adults use disjunction. Findings (...) from studies of child language acquisition and from cross-linguistic research invite the conclusion that children do not learn to be logical—it comes naturally to them. (shrink)

Imagine a dog tracing a scent to a crossroads, sniffing all but one of the exits, and then proceeding down the last without further examination. According to Sextus Empiricus, Chrysippus argued that the dog effectively employs disjunctive syllogism, concluding that since the quarry left no trace on the other paths, it must have taken the last. The story has been retold many times, with at least four different morals: (1) dogs use logic, so they are as clever as humans; (2) (...) dogs use logic, so using logic is nothing special; (3) dogs reason well enough without logic; (4) dogs reason better for not having logic. This paper traces the history of Chrysippus's dog, from antiquity up to its discussion by relevance logicians in the twentieth century. (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)

In this paper Grice's requirements for assertability are imposed on the disjunction of Classical Logic. Defining material implication in terms of negation and disjunction supplemented by assertability conditions, results in the disappearance of the most important paradoxes of material implication. The resulting consequence relation displays a very strong resemblance to Schurz's conclusion-relevant consequence relation.

Logical connectives (otherwise known as 'logical constants' or 'logical particles') have seemed challenging to philosophers of language. This article gives a concise account of logical connectives.

In the tradition of substructural logics, it has been claimed for a long time that conjunction and inclusive disjunction are ambiguous:we should, in fact, distinguish between ‘lattice’ connectives (also called additive or extensional) and ‘group’ connectives (also called multiplicative or intensional). We argue that an analogous ambiguity affects the quantifiers. Moreover, we show how such a perspective could yield solutions for two well-known logical puzzles: McGee’s counterexample to modus ponens and the lottery paradox.

This paper is a contribution to the program of constructing formal representations of pragmatic aspects of human reasoning. We propose a formalization within the framework of Adaptive Logics of the exclusivity implicature governing the connective ‘or’.Keywords: exclusivity implicature, Adaptive Logics.

The connective or can be treated as an inclusive disjunction or else as an exclusive disjunction. Although researchers are aware of this distinction, few have examined the conditions under which each interpretation should be anticipated. Based on linguistic-pragmatic analyses, we assume that interpretations are initially inclusive before either (a) remaining so, or (b) becoming exclusive by way of an implicature ( but not both ). We point to a class of situations that ought to predispose disjunctions to inclusive interpretations and (...) to situations that encourage exclusive interpretations. A disjunction's ultimate interpretation is based on its potential informativeness, where the interpretation of the disjunctive utterance having the smallest number of true conditions is considered most informative. Our investigation leads to five experiments employing arbitrary materials. Among the problems expected to encourage inclusive interpretations are those that present disjunctions in the antecedents of conditionals and in question forms. The best candidates to produce implicatures are those disjunctions that underdetermine an expected conjunctive conclusion, although other disjunctive utterances that are more informative as exclusive are discussed and tested. (shrink)

The de Morgan laws characterize how negation, conjunction, and disjunction interact with each other. They are fundamental in any semantics that bases itself on the propositional calculus/Boolean algebra. This paper is primarily concerned with the second law. In English, its validity is easy to demonstrate using linguistic examples. Consider the following: (3) Why is it so cold in here? We didn’t close the door or the window. The second sentence is ambiguous. It may mean that I suppose we did not (...) close the door or did not close the window, but I am not sure which. This `I am not sure which’ reading is irrelevant to us because it has disjunction scoping over negation. But the sentence may equally well mean (and indeed this is the preferred reading) that we didn’t close the door and did not close the window. This `neither’ reading bears out de Morgan law (2). (shrink)

The quantum logical `or' is analyzed from a physical perspective. We show that it is the existence of EPR-like correlation states for the quantum mechanical entity under consideration that make it nonequivalent to the classical situation. Specifically, the presence of potentiality in these correlation states gives rise to the quantum deviation from the classical logical `or'. We show how this arises not only in the microworld, but also in macroscopic situations where EPR-like correlation states are present. We investigate how application (...) of this analysis to concepts could alleviate some well known problems in cognitive science. (shrink)

Tūsī, a thirteenth century logician writing in Arabic, uses two logical connectives to build up molecular propositions: ‘if-then’, and ‘either-or’. By referring to a dichotomous Tree, Tūsī shows how to choose the proper disjunction relative to the terms in the disjuncts. He also discusses the disjunctive propositions which follow from a conditional proposition.

I argue that the conjunctive distribution of permissibility over or, which is a puzzling feature of free-choice permission is just one instance of a more general class of conjunctive occurrences of the word, and that these conjunctive uses are more directly explicable by the consideration that or is a descendant of oper than by reference to the disjunctive occurrences which logicalist prejudices may tempt us to regard as semantically more fundamental. I offer an account of how the disjunctive uses of (...) or may have come about through an intermediate discourse-adverbial use of or, drawing a parallel with but, which, etymologically, is disjunctive rather than conjunctive and whose conjunctive uses seem to represent just such a discourse-adverbial application. (shrink)

This chapter aims to portray the language of meaning. The notion of the scope of an occurrence of a logical constant is familiar and precise. On a Geachian account, it is just the scope that has changed, the meaning remains the same. The notion of scope may be of only illusory relevance. The question of the scope of an occurrence of a ‘logical’ word of English, far from settling questions about the local meaning of such words, cannot itself be settled (...) before semantical questions have been dealt with; the formulation of those questions of representation and interpretation may require a subtlety of discrimination beyond any that the language of ‘meaning’ can support. The role of ‘any’ has the same role as 'some’, although ‘any’ is disjunctive in a sense, i.e. its role is different from that of ‘some’. (shrink)