I propose a comprehensive account of negation as a modal operator, vindicating a moderate logical pluralism. Negation is taken as a quantifier on worlds, restricted by an accessibility relation encoding the basic concept of compatibility. This latter captures the core meaning of the operator. While some candidate negations are then ruled out as violating plausible constraints on compatibility, different specifications of the notion of world support different logical conducts for negations. The approach unifies in a philosophically motivated picture the following (...) results: nothing can be called a negation properly if it does not satisfy Contraposition and Double Negation Introduction; the pair consisting of two split or Galois negations encodes a distinction without a difference; some paraconsistent negations also fail to count as real negations, but others may; intuitionistic negation qualifies as real negation, and classical Boolean negation does as well, to the extent that constructivist and paraconsistent doubts on it do not turn on the basic concept of compatibility but rather on the interpretation of worlds. (shrink)

The paper reviews a number of approaches for handling restricted quantification in relevant logic, and proposes a novel one. This proceeds by introducing a novel kind of enthymematic conditional.

Our topic is the theory of topics. My goal is to clarify and evaluate three competing traditions: what I call the way-based approach, the atom-based approach, and the subject-predicate approach. I develop criteria for adequacy using robust linguistic intuitions that feature prominently in the literature. Then I evaluate the extent to which various existing theories satisfy these constraints. I conclude that recent theories due to Parry, Perry, Lewis, and Yablo do not meet the constraints in total. I then introduce the (...) issue-based theory—a novel and natural entry in the atom-based tradition that meets our constraints. In a coda, I categorize a recent theory from Fine as atom-based, and contrast it to the issue-based theory, concluding that they are evenly matched, relative to our main criteria of adequacy. I offer tentative reasons to nevertheless favour the issue-based theory. (shrink)

As is well known, the variable-sharing property (vsp) is, according to Anderson and Belnap, a necessary property of any relevant logic. In this paper, we shall consider two versions of the vsp, what we label the "weak vsp" (wvsp) and the "strong vsp" (svsp). In addition, the "no loose pieces property," a property related to the wvsp and the svsp, will be defined. Each one of these properties shall generally be characterized by means of a class of logical matrices. In (...) this way, any logic verified by an actual matrix in one of these classes has the property the class generally represents. Particular matrices (and so, logics) in each class are provided. (shrink)

Many logics in the relevant family can be given a proof theory in the style of Belnap's display logic. However, as originally given, the proof theory is essentially more expressive than the logics they seek to model. In this paper, we consider a modified proof theory which more closely models relevant logics. In addition, we use this proof theory to show decidability for a large range of substructural logics.

This chapter contains sections titled: Non‐Sequiturs are Bad The Real Use of Premises Implication From Proof Theory to Semantics Adding Conjunction The Problem of Disjunction Routley and Meyer's Ternary Relation Rules for Disjunction The Semantics of Negation Rules for Negation Disjunctive Syllogism Logics Stronger than R Logics Weaker than R Relevant Logics and Natural Language Conditionals Theory of Properties Summary.

Relevant logics infamously have the property that they only validate a conditional when some propositional variable is shared between its antecedent and consequent. This property has been strengthened in a variety of ways over the last half-century. Two of the more famous of these strengthenings are the strong variable sharing property and the depth relevance property. In this paper I demonstrate that an appropriate class of relevant logics has a property that might naturally be characterized as the supremum of these (...) two properties. I also show how to use this fact to demonstrate that these logics seem to be constructive in previously unknown ways. (shrink)

Formal symptoms of relevance usually concern the propositional variables shared between the antecedent and the consequent of provable conditionals. Among the most famous results about such symptoms are Belnap’s early results showing that for sublogics of the strong relevant logic R, provable conditionals share a signed variable between antecedent and consequent. For logics weaker than R stronger variable sharing results are available. In 1984, Ross Brady gave one well-known example of such a result. As a corollary to the main result (...) of the paper, we give a very simple proof of a related but strictly stronger result. (shrink)

I develop and defend a truthmaker semantics for the relevant logic R. The approach begins with a simple philosophical idea and develops it in various directions, so as to build a technically adequate relevant semantics. The central philosophical idea is that truths are true in virtue of specific states. Developing the idea formally results in a semantics on which truthmakers are relevant to what they make true. A very natural notion of conditionality is added, giving us relevant implication. I then (...) investigate ways to add conjunction, disjunction, and negation; and I discuss how to justify contraposition and excluded middle within a truthmaker semantics. (shrink)

Semantics are given for modal extensions of relevant logics based on the kind of frames introduced in [7]. By means of a simple recipe we may obtain from a class FRM (L) of unreduced frames characterising a (non-modal) logic L, frame-classes FRM (L.M) characterising conjunctively regular modal extensions L.M of L. By displaying an incompleteness phenomenon, it is shown how the recipe fails when reduced frames are under consideration.

I provide a truthmaker semantics for Angell’s system of analytic implication and establish completeness.

Although logical settings are typically concerned with tracking alethic considerations, frameworks exist in which topic-theoretic considerations—e.g., tracking subject-matter or topic—are given equal importance. Intuitions about extending topic through a propositional language are generally straightforward for extensional cases. For a number of reasons, arriving at a compelling account of the subject-matter of intensional operators—such as intensional conditionals—is a more difficult task. In particular, the framework of topic-sensitive intentional modals (TSIMs) championed by Francesco Berto and his collaborators leave the topics of intensional (...) formulae undefined, which artificially constricts the expressivity of the theory. This paper proposes an approach to fill in this lacuna, emphasizing an analogous problem in Parry-style containment logics. In this setting, the approach receives a proof-of-concept through the introduction of a natural and general family of subsystems of Parry’s $${\textsf{PAI}}$$ PAI —with sound and complete axiomatizations—that allow a fine degree of control over the topics of intensional conditionals. (shrink)

The Routley star, an involutive function between possible worlds or set-ups against which negation is evaluated, is a hallmark feature of Richard Sylvan and Val Plumwood's set-up semantics for the logic of first-degree entailment. Less frequently acknowledged is the weaker mate function described by Sylvan and his collaborators, which results from stripping the requirement of involutivity from the Routley star. Between the mate function and the Routley star, however, lies an broad field of intermediate semantical conditions characterizing an infinite number (...) of consequence relations closely related to first-degree entailment. In this paper, we consider the semantics and proof theory for deductive systems corresponding to set-up models in which the mate function is cyclical. We describe modifications to Anderson and Belnap's consecution calculus LE_fde2 that correspond to these constraints, for which we prove soundness and completeness with respect to the set-up semantics. Finally, we show that a number of familiar metalogical properties are coordinated with the parity of a mate function's period, including refined versions of the variable-sharing property and the property of gentle explosiveness. (shrink)

Recently, some proponents and practitioners of inconsistent mathe- matics have argued that the subject requires a conditional with ir- relevant features, i.e. where antecedent and consequent in a valid conditional do not behave as expected in relevance logics —by shar- ing propositional variables, for example. Here we argue that more fine-grained notions of content and content-sharing are needed to ex- amine the language of (inconsistent) arithmetic and set theory, and that the conditionals needed in inconsistent mathematics are not as irrelevant (...) as it is suggested in the current literature. (shrink)

The quantified relevant logic RQ is given a new semantics in which a formula for all xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are modelled as functions from variable-assignments to propositions, where a proposition is a set of worlds in a relevant model structure. A completeness proof is given for a basic quantificational system QR from which RQ is obtained by adding the axiom EC of 'extensional confinement': for all x(A V (...) B) -> (A V for all xB). with x not free in A. Validity of EC requires an additional model condition involving the boolean difference of propositions. A QR-model falsifying EC is constructed by forming the disjoint union of two natural arithmetical structures in which negation is interpreted by the minus operation. (shrink)

It will be an essential resource for philosophers, mathematicians, computer scientists, linguists, or any scholar who finds connectives, and the conceptual issues surrounding them, to be a source of interest.This landmark work offers both ...