Relevance Logic

In his paper “Recent work in relevant logic”, Jago includes a section on Disjunctive Syllogism . The content of the section essentially consists of (a) a valuation of some work by Robles and Méndez on the topic as “not particularly interesting in itself”; (b) a statement establishing that “What would be interesting is to discover just how weak a relevant logic needs to be before disjunctive syllogism becomes inadmissible”. The main problem with this section of Jago’s paper on DS is (...) that the author is unaware of the recent important results on the topic. I show that (1) the valuation in (a) is groundless and (2) the ill-formulated problem in (b) is solved in the recent literature on relevant logics. (shrink)

Section 1 reviews Strawson’s logic of presuppositions. Strawson’s justification is critiqued and a new justification proposed. Section 2 extends the logic of presuppositions to cases when the subject class is necessarily empty, such as (x)((Px & ~Px) → Qx) . The strong similarity of the resulting logic with Richard Diaz’s truth-relevant logic is pointed out. Section 3 further extends the logic of presuppositions to sentences with many variables, and a certain valuation is proposed. It is noted that, given this valuation, (...) Gödel’s sentence becomes neither true nor false. The similarity of this outcome with Goldstein and Gaifman’s solution of the Liar paradox, which is discussed in section 4, is emphasized. Section 5 returns to the definition of meaningfulness; the meaninglessness of certain sentences with empty subjects and of the Liar sentence is discussed. The objective of this paper is to show how all of the above-mentioned concepts are interrelated. (shrink)

In this paper, we examine a number of relevant logics’ variable sharing properties from the perspective of theories of topic or subject-matter. We take cues from Franz Berto’s recent work on topic to show an alignment between families of variable sharing properties and responses to the topic transparency of relevant implication and negation. We then introduce and defend novel variable sharing properties stronger than strong depth relevance—which we call cn-relevance and lossless cn-relevance—showing that the properties are satisfied by the weak (...) relevant logics and , respectively. We argue that such properties address a sort of semantic lossiness of strong depth relevance. (shrink)

Lots of things are usefully modelled in science as dynamical systems: growing populations, flocking birds, engineering apparatus, cognitive agents, distant galaxies, Turing machines, neural networks. We argue that relevant logic is ideal for reasoning about dynamical systems, including interactions with the system through perturbations. Thus, dynamical systems provide a new applied interpretation of the abstract Routley-Meyer semantics for relevant logic: the worlds in the model are the states of the system, while the (in)famous ternary relation is a combination of perturbation (...) and evolution in the system. Conversely, the logic of the relevant conditional provides sound and complete laws of dynamical systems. (shrink)

Fine (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 (1974) semantics for relevant logics. Finally, I use this understanding of relevant semantics to investigate the status of the mingle axiom. (shrink)

In this paper, we provide a semantics for a range of positive substructural logics, including both logics with and logics without modal connectives. The semantics is novel insofar as it is meant to explicitly capture the computational flavor of these logics, and to do so in a way that builds in both nondeterministic and nonconcurrent computational processes.

The aim of this article is to discuss pure variable inclusion logics, that is, logical systems where valid entailments require that the propositional variables occurring in the conclusion are included among those appearing in the premises, or vice versa. We study the subsystems of Classical Logic satisfying these requirements and assess the extent to which it is possible to characterise them by means of a single logical matrix. In addition, we semantically describe both of these companions to Classical Logic in (...) terms of appropriate matrix bundles and as semilattice-based logics, showing that the notion of consequence in these logics can be interpreted in terms of truth (or non-falsity) and meaningfulness (or meaninglessness) preservation. Finally, we use Płonka sums of matrices to investigate the pure variable inclusion companions of an arbitrary finitary logic. -/- . (shrink)

In her recent book, Russell (2023) examines various so-called “barriers to entailment,” including Hume’s law, roughly the thesis that an ‘ought’ cannot be derived from an ‘is.’ Hume’s law bears an obvious resemblance to the proscription on fallacies of modality in relevance logic, which has traditionally formally been captured by the so-called Ackermann property. In the context of relevant modal logic, this property might be articulated thus: no conditional whose antecedent is box-free and whose consequent is box-prefixed is valid (for (...) the connection, interpret box deontically). While the deontic significance of Ackermann-like properties has been observed before, Russell’s new book suggests a more broad-scoped formal investigation of the relationship between barrier theses of various kinds and corresponding Ackermann-like properties. In this paper, I undertake such an investigation by elaborating a general relevant bimodal logical framework in which several of the barriers Russell examines can be given formal expression. I then consider various Ackermann-like properties corresponding to these barriers and prove that certain systems satisfy them. Finally, I respond to some objections Russell makes against the use of relevance logic to formulate Hume’s law and related barriers. (shrink)

We explore depth substitution invariance, or hyperformalism, and extend known results in this realm to justification logics extending weak relevant logics. We then examine the surprising invariance of justifications over formulas and restrict our attention to the substitution of proofs in the original relevant logic. The results of this paper indicate that depth invariance is a recalcitrant feature of the logic and that proof structures in hyperformal logics are quite inflexible.

This paper shows that the relevant logics E and Π′ are strongly sound and complete with regards to a version of the “simplified” Routley-Meyer semantics. Such a semantics for E has been thought impossible. Although it is impossible if an admissible rule of E – the rule of restricted assertion or equivalently Ackermann’s δ-rule – is solely added as a primitiverule, it is very much possible when E is axiomatized in the way Anderson and Belnap did. The simplified semantics for (...) E and Π′ requires unreduced frames. Contra what has been claimed, however, no additional frame component is required over and above what’s required to model other relevant logics such as T and R. It is also shown how to modify the tonicity requirements of theternary relation so as to allow for the standard truth condition for both fusion – the intensional conjunction◦ – as well as the converse conditional ←. (shrink)

It is shown how to model propositional constants within the simplified Routley-Meyer semantics. Various axioms and rules allowingthe definition of modal operators, implicative negations, enthymematical conditionals, and propositions expressing various infinite conjunctions anddisjunctions are set forth and shown to correspond to specific frame conditions. Two propositional constants which are both often designated as “the Ackermann constant” are shown to capture two such “infinite” propositions: The conjunction of every logical law and the conjunction of every truth – what Anderson and Belnap (...) called the “world” constant. (shrink)

The aim of this paper is to provide a proof-theoretic characterization of relevant logics including fusion and fission connectives, as well as Ackermann’s truth constant. We achieve this by employing the well-established methodology of labelled sequent calculi. After having introduced several systems, we will conduct a detailed proof-theoretic analysis, show a cut-admissibility theorem, and establish soundness and completeness. The paper ends with a discussion that contextualizes our current work within the broader landscape of the proof theory of relevant logics.

Here's the thing: when you look at it from just the right angle, it's entirely obvious how semantics for second-order relevant logics ought to go. Or at least, if you've understood how semantics for first-order relevant logics ought to go, there are perspectives like this. What's more is that from any such angle, the metatheory that needs doing can be summed up in one line: everything is just as in the first-order case, but with more indices. Of course, it's no (...) small matter finding the magical angle from which everything becomes obvious. And even having found this perspective, one cannot assume one's audience will find things as obvious as oneself. All that to say this: if the results in the paper below strike you as obvious, pay attention to the perspective that makes that possible. And if they don't, feel free to ignore this preamble in its entirety. (shrink)

Abstractionism in the philosophy of mathematics aims at deriving large fragments of mathematics by combining abstraction principles (i.e. the abstract objects $\S e_1, \S e_2$, are identical if, and only if, an equivalence relation $Eq_\S$ holds between the entities $e_1, e_2$) with logic. Still, as highlighted in work on the semantics for relevant logics, there are different ways theories might be combined. In exactly what ways must logic and abstraction be combined in order to get interesting mathematics? In this paper, (...) we investigate the matter by deriving the axioms of second-order Peano Arithmetic from Frege's Basic Law V (the extension of $F$ is identical with the extension of $G$ if, and only if, $F$ and $G$ are extensionally equivalent) in the presence of a relevant higher-order logic. The results are interesting. Not only must we take on logic as true, and not only must we apply our logic to abstraction principles, but also we have to apply our theory of abstraction back to the logic in order to arrive at arithmetic. Thus, what Abstractionism gives us is not simply what we get from abstraction via logic, but also what we get from logic via abstraction. (shrink)

This book brings together contemporary work on relevant logics to showcase the recent progress of the field and set the stage for future research. The papers in the volume contribute to the formal and philosophical development of the field. They include contributions from different traditions and approaches ranging from philosophical discussions of the foundations of relevant, and related kinds of non-classical, logic to mathematical work concerning open technical problems in the field. This is the first edited collection on the topic (...) in many years, and it includes contributions from established figures as well as younger generations of researchers. Relevant logics have recently seen a resurgence of interest and this volume will be an important resource for logicians working on substructural and relevant logics for years to come. (shrink)

The two ``relevance'' criteria set out by Anderson and Belnap are discussed. It is argued that the motivation backing the variable sharing property is far weaker than it is commonly made out to be, and that the use-criterion does not distinguish between relevant logics such as E and R and ``irrelevant'' logics such as S4, intuitionistic and classical logic. In short, then, the paper argues that Anderson and Belnap's two criteria of relevance are both motivationally unsound, and do not accomplish (...) what they are commonly taken to accomplish. (shrink)

Two Hilbert calculi in the use-restricted relevance tradition of Anderson and Belnap are presented. One yields Anderson and Belnap's conjunctive version of the so-called ``entailment theorem,'' whereas the other yields the implication-iterated version. In contrast to previous such use-restricted calculi, those presented in this paper apply to arbitrary strengthenings of the weak contractionless logic B without need for modifying the use-conditions. As such they help to identify the core idea of the ``use-account'' of relevance.

Saul Kripke’s work on the semantics of modal logics is well known, unlike his work on Anderson and Belnap’s system E of Entailment (a modal relevance logic), which included his proof of the decidability of its implicational fragment E_>, and also a counterexample to the conjecture of Belnap that E_> is the intersection of the implicational fragments of the relevance logic R and the modal logic S4. This led to Storrs McCall’s suggesting that the “mingle” axiom might be added to (...) E_>, and that this system might be used instead of S4_>. We give a counterexample to this conjecture. We also disprove the conjecture Anderson and Belnap attribute to McCall, in which “restricted mingle” is added to E_>. We use a modal extension of the lattice M_0 and follow ideas of Meyer. In the 1970s, Dunn showed that RM (R with the mingle axiom) can be modeled using a binary accessibility relation, like the accessibility relation in Kripke’s semantics for normal modal logics and his semantics for intuitionistic logic. Dunn also gave a variant interpretation for EM (E with the mingle axiom). We explore some other variations of these binary relational semantics. (shrink)

Weak enough relevant logics are often closed under depth substitutions. To determine the breadth of logics with this feature, we show there is a largest sublogic of R closed under depth substitutions and that this logic can be recursively axiomatized.

Relevance logics are a misunderstood lot. Despite being the subject of intense study for nearly a century, they remain maligned as too complicated, too abstruse, or too silly to be worth learning much about. This Element aims to dispel these misunderstandings. By focusing on the weak relevant logic B, the discussion provides an entry point into a rich and diverse family of logics. Also, it contains the first-ever textbook treatment of quantification in relevance logics, as well as an overview of (...) the cutting edge on variable sharing results and a guide to further topics in the field. (shrink)

In this chapter, I present a systematic study of theories of entailment as developed in relevant modal logics of varying strength. I consider several relevant normal modal logics and the properties of entailment, as defined as necessitated relevant implication, in these systems. Fine-Urquhart style semantics are provided for these relevant modal logics and proofs of soundness and completeness are given. The semantics is used to prove admissibility results for certain weak relevant modal theories. Connections between some of these relevant modal (...) logics and preexisting theories of entailment are pointed out. (shrink)

Jc Beall has made several contributions to the theory of restricted quantification in relevant logics. This paper examines these contributions and proposes an alternative account of restricted universals. The alternative is not, however, a theory of relevant restricted universals in any real sense. It is, however, a theory of restricted universals phrased in the most plausible general quantificational theory for relevant logics—Kit Fine’s stratified semantics. The motivation both for choosing this semantic framework and for choosing the particular theory of restricted (...) quantification we use is because they are the best way of dealing with these topics from Beall’s theory-building theory picture of logic, establishing a second point of contact with Beall’s work. (shrink)

Chapter 1 constitutes an introduction to Gentzen calculi from two perspectives, logical and philosophical. It introduces the notion of generalisations of Gentzen sequent calculus and the discussion on properties that characterize good inferential systems. Among the variety of Gentzen-style sequent calculi, I divide them in two groups: syntactic and semantic generalisations. In the context of such a discussion, the inferentialist philosophy of the meaning of logical constants is introduced, and some potential objections – mainly concerning the choice of working with (...) semantic generalizations – are addressed. Finally, I’ll introduce the case studies that I’ll be dealing with in part II. Chapter 2 is concerned with the origins and development of Jaśkowski’s discussive logic. The main idea of this chapter is to systematize the various stages of the development of discussive logic related researches from two different angles, i.e., its connections to modal logics and its proof theory, by highlighting virtues and vices. Chapter 3 focuses on the Gentzen-style proof theory of discussive logic, by providing a characterization of it in terms of labelled sequent calculi. Chapter 4 deals with the Gentzen-style proof theory of relevant logics, again by employing the methodology of labelled sequent calculi. This time, instead of working with a single logic, I’ll deal with a whole family of them. More precisely, I’ll study in terms of proof systems those relevant logics that can be characterised, at the semantic level, by reduced Routley-Meyer models, i.e., relational structures with a ternary relation between states and a unique base element. Chapter 5 investigates the proof theory of a modal expansion of intuitionistic propositional logic obtained by adding an ‘actuality’ operator to the connectives. This logic was introduced also using Gentzen sequents. Unfortunately, the original proof system is not cut-free. This chapter shows how to solve this problem by moving to hypersequents. Chapter 6 concludes the investigations and discusses the future of the research presented throughout the dissertation. (shrink)

Here, I combine the semantics of Mares and Goldblatt [20] and Seki [29, 30] to develop a semantics for quantified modal relevant logics extending ${\bf B}$. The combination requires demonstrating that the Mares–Goldblatt approach is apt for quantified extensions of ${\bf B}$ and other relevant logics, but no significant bridging principles are needed. The result is a single semantic approach for quantified modal relevant logics. Within this framework, I discuss the requirements a quantified modal relevant logic must satisfy to be (...) “sufficiently classical” in its modal fragment, where frame conditions are given that work for positive fragments of logics. The roles of the Barcan formula and its converse are also investigated. (shrink)

In this article, we perform a detailed proof theoretic investigation of a wide number of relevant logics by employing the well-established methodology of labelled sequent calculi to build our intended systems. At the semantic level, we will characterise relevant logics by employing reduced Routley-Meyer models, namely, relational structures with a ternary relation between worlds along with a unique distinct element considered as the real (or actual) world. This paper realizes the idea of building a variety of modular labelled calculi by (...) reflecting, at the syntactic level, semantic informations taken from reduced Routley-Meyer models. Central results include proofs of soundness and completeness, as well as a proof of cut- admissibility. (shrink)

This paper will develop ideas from [44]. We will generalize their work in two directions. First, we provide axioms for justification logics over the base logic B and show that the logic permits a proof of the internalization theorem. Second, we provide alternative frames that more closely resemble the standard versions of the ternary relational frames, as well as a more general approach to the completeness proof. We prove that soundness and completeness hold for justification logics over a wide variety (...) of base logics. Finally, we will strengthen Belnap’s variable sharing for the justification logic context, demonstrating that the justifications are properly relevant justifications. (shrink)

There was a time when 'logic' just meant classical logic. The climate is slowly changing and non-classical logic cannot be dismissed off-hand. However, a metatheory used to study the properties of non-classical logic is often classical. In this paper, we will argue that this practice of relying on classical metatheories is problematic. In particular, we will show that it is a bad practice because the metatheory that is used to study a non-classical logic often rules out the very logic it (...) is designed to study. (shrink)

In this article, I consider the positive logic of Boolean groups (i.e. Abelian groups where every non-identity element has order 2), where these are taken as frames for an operational semantics à la Urquhart. I call this logic BG. It is shown that the logic over the smallest nontrivial Boolean group, taken as a frame, is identical to the positive fragment of a quasi-relevance logic that was developed by Robles and Méndez (an extension of this result where negation is included (...) is also discussed). It is proved that BG satisfies the variable sharing property and is Halldén complete, while failing to satisfy the disjunction property. Sound and complete subscripted tableaux are presented for BG. An axiomatization (in the positive language extended with fusion) is presented, which is sound with respect to BG and, with respect to a related ternary relational semantics, complete; the problem of identifying a complete axiomatization for BG itself is left open. Connections between BG and the quasi-relevance logic KR are also discussed. (shrink)

This paper addresses a set-theoretic completeness based on a relational semantics for fuzzy extensions of two versions Rt and R T of R (Relevance logic). To this end, two fuzzy logics FRt and FRT as extensions of Rt and R T, respectively, and the relational semantics, so called Routley-Meyer semantics, for them are first recalled. Next, on the semantics completeness results are provided for them using a set-theoretic way.

Angell's logic of analytic containment AC has been shown to be characterized by a 9-valued matrix NC by Ferguson, and by a 16-valued matrix by Fine. We show that the former is the image of a surjective homomorphism from the latter, i.e., an epimorphic image. The epimorphism was found with the help of MUltlog, which also provides a tableau calculus for NC extended by quantifiers that generalize conjunction and disjunction.

An algebraic type of structure is shown forth which is such that if it is a characteristic matrix for a logic, then that logic satisfies Meyer's weak variable sharing property. As a corollary, it is shown that RM and all its odd-valued extensions \(\mathbf{RM}_{2n\mathord{-}1}\) satisfy the weak variable sharing property. It is also shown that a proof to the effect that the "fuzzy" version of the relevant logic R satisfies the property is incorrect.

This book honors J. Michael Dunn, who was a preeminent relevance logician. Dunn's career spanned over 50 years and his research results had an impact on philosophy, mathematics and informatics. Dunn often used algebraic techniques in his research into logics such as relevance, orthomodular and substructural logics. He invented the logic R-mingle and the sequent calculus LR+; he proved crucial theorems about 2-valued first-order logic and non-classical higher-order logics - among many other results. The papers in this volume touch upon (...) topics that Dunn was concerned with. Some authors were students or colleagues of Dunn; some other authors had not met Dunn in person, but share his research interests. None of the articles published here have appeared in print before; indeed, most of the papers were written specifically for this collection. The diversity of the themes of the articles reflects the scope of Dunn's own research in logic. It will also ensure that anybody with an interest in logic - whether a student, a logician or a scholar in another field - will find reading this book a worthwhile endeavor. The editor, Katalin Bimbó was the 14th Ph.D. student of J. Michael Dunn at Indiana University in Bloomington, IN, U.S.A.; currently, she is a professor of philosophy at the University of Alberta in Canada. (shrink)

Graham Priest has formulated the minimally inconsistent logic of paradox (MiLP), which is paraconsistent like Priest’s logic of paradox (LP), while staying closer to classical logic. We present logics that stand to (the propositional fragments of) strong Kleene logic (K3) and the logic of first-degree entailment (FDE) as MiLP stands to LP. That is, our logics share the paracomplete and the paraconsistent-cum-paracomplete nature of K3 and FDE, respectively, while keeping these features to a minimum in order to stay closer to (...) classical logic. We give semantic and sequent-calculus formulations of these logics, and we highlight some reasons why these logics may be interesting in their own right. (shrink)

This paper is dedicated to the memory of Mike Dunn. His untimely death is a loss not only to logic, computer science, and philosophy, but to all of us who knew and loved him. The paper gives an argument for closure under γ in standard systems of relevance logic (first proved by Meyer and Dunn 1969). For definiteness, I chose the example of R. The proof also applies to E and to the quantified systems RQ and EQ. The argument uses (...) semantic tableaux (with one exceptional rule not satisfying the subformula property). It avoids the previous arguments’ use of cutting down inconsistent sets of formulas to consistent sets. Like all tableau arguments, it extends partial valuations to total valuations. (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)

The research observed, in parallel and comparatively, a surveillance state’s use of communication & cyber networks with satellite applications for power political & realpolitik purposes, in contrast to the outer space security & legit scientific purpose driven cybernetics. The research adopted a psychoanalytic & psychosocial method of observation in the organizational behaviors of the surveillance state, and a theoretical physics, astrochemical, & cosmological feedback method in the contrast group of cybernetics. Military sociology and multilateral movements were adopted in the diagnostic (...) studies & research on cybersecurity, and cross-channeling in communications were detected during the research. The paper addresses several key points of technicalities in security & privacy breach, from personal devices to ontological networks and satellite applications - notably telecommunication service providers & carriers with differentiated spectrum. The paper discusses key moral ethical risks posed in the mal-adaptations in commercial devices that can corrupt democracy in subtle ways but in a mass scale. The research adopted an analytical linguistics approach with linguistic history in unjailing from the artificial intelligence empowered pancomputationalism approach of the heterogenous dictatorial semantic network, and the astronomical & cosmological research in information theory implies that noncomputable processes are the only defense strategy for the new technology-driven pancomputationalism developments. (shrink)

FDE is a logic that captures relevant entailment between implication-free formulae and admits of an intuitive informational interpretation as a 4-valued logic in which “a computer should think”. However, the logic is co-NP complete, and so an idealized model of how an agent can think. We address this issue by shifting to signed formulae where the signs express imprecise values associated with two distinct bipartitions of the set of standard 4 values. Thus, we present a proof system which consists of (...) linear operational rules and only two branching structural rules, the latter expressing a generalized rule of bivalence. This system naturally leads to defining an infinite hierarchy of tractable depth-bounded approximations to FDE. Namely, approximations in which the number of nested applications of the two branching rules is bounded. (shrink)

Frame semantics for negation on the Australian Plan accommodates many different negations, but it falls short on accommodating subminimal negation when the language contains conjunction and disjunction. In this paper, I will present a multi-relational frame semantics –multi-incompatibility frame semantics– that can accommodate subminimal negation. I will first argue that multi-incompatibility frames are in accordance with the philosophical motivations behind negation on the Australian Plan, namely its modal and exclusion-expressing nature. Then, I will prove the soundness and completeness results of (...) a subminimal logic that consists of the multi-incompatibility semantics and a proof system with operational rules that characterize subminimal negation, conjunction and disjunction. Lastly, I will prove some key correspondence theorems that relate frame conditions to certain principles that are associated with stronger negations, which will give rise to a new kite of negations that includes subminimal negation. (shrink)

The Mares-Goldblatt semantics for quantified relevant logics have been developed for first-order extensions of R, and a range of other relevant logics and modal extensions thereof. All such work has taken place in the the ternary relation semantic framework, most famously developed by Sylvan and Meyer. In this paper, the Mares-Goldblatt technique for the interpretation of quantifiers is adapted to the more general neighbourhood semantic framework, developed by Sylvan, Meyer, and, more recently, Goble. This more algebraic semantics allows one to (...) characterise a still wider range of logics, and provides the grist for some new results. To showcase this, we show, using some non-augmented models, that some quantified relevant logics are not conservatively extended by connectives the addition of which do conservatively extend the associated propositional logics, namely fusion and the dual implication. We close by proposing some further uses to which the neighbourhood Mares-Goldblatt semantics may be put. (shrink)

Among Dunn’s many important contributions to relevance logic was his work on the system RM (R-mingle). Although RM is an interesting system in its own right, it is widely considered to be too strong. In this chapter, I revisit a closely related system, RM0 (sometimes known as ‘constructive mingle’), which includes the mingle axiom while not degenerating in the way that RM itself does. My main interest will be in examining this logic from two related semantical perspectives. First, I give (...) a purely operational bisemilattice semantics for it by adapting previous work of Humberstone. Second, I examine a more conventional algebraic semantics for it and discuss how this relates to the operational semantics. A novel operational semantics for J (intuitionistic logic) as well as its conventional Heyting algebraic semantics emerge as special cases of the corresponding semantics for RM0. The results of this chapter suggest that RM0 is a more interesting logic than has been appreciated and that Humberstone’s operational semantic framework similarly deserves more attention than it has received. (shrink)

Here algebraic Routley-Meyer semantics is addressed for two fuzzy versions of the logic of relevant implication R. To this end, two versions R t and R T of R and their fuzzy extensions FRt and FRT , respectively, are first discussed together with their algebraic semantics. Next algebraic Routley-Meyer semantics for these two fuzzy extensions is introduced. Finally, it is verified that these logics are sound and complete over the semantics.

Consider the set of inferences that are acceptable to use in all our theory building endeavors. Call this set of inferences the universal theory building toolkit, or just ’the toolkit’ for short. It is clear that the toolkit is tightly connected to logic in a variety of ways. Beall, for example, has argued that logic just is the toolkit. This paper avoids making a stand on that issue and instead investigates reasons for thinking that, logic or not, the toolkit is (...) substructural. It is presented as a dialogue for the simple reason that it summarizes a range of dialogues on this subject that the author has had with various folks over the past few years. The method I use to investigate the toolkit is inspired in both philosophical and technical details by Alasdair Urquhart’s work on semantics for relevance logics from the early 1970s. (shrink)

A. J. Ayer’s empiricist criterion of meaning was supposed to have sorted all statements into nonsense on the one hand, and tautologies or genuinely factual statements on the other. Unfortunately for Ayer, it follows from classical logic that his criterion is trivial—it classifies all statements as either tautologies or genuinely factual, but none as nonsense. However, in this paper, I argue that Ayer’s criterion of meaning can be defended from classical proofs of its triviality by the adoption of a relevant (...) logic—an idea which is motivated because, according to Ayer, the genuinely factual statements are those which observation is relevant to. (shrink)

We apply and extend the theory and methods of algorithmic correspondence theory for modal logics, developed over the past 20 years, to the language LR\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {L}_R$$\end{document} of relevance logics with respect to their standard Routley–Meyer relational semantics. We develop the non-deterministic algorithmic procedure PEARL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {PEARL}$$\end{document} for computing first-order equivalents of formulae of the language LR\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} (...) \begin{document}$$\mathcal {L}_R$$\end{document}, in terms of that semantics. PEARL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {PEARL}$$\end{document} is an adaptation of the previously developed algorithmic procedures SQEMA and ALBA. We then identify a large syntactically defined class of inductive formulae in LR\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {L}_R$$\end{document}, analogous to previously defined such classes in the classical, distributive and non-distributive modal logic settings, and show that PEARL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {PEARL}$$\end{document} succeeds for every inductive formula and correctly computes a first-order definable condition which is equivalent to it with respect to frame validity. We also provide a detailed comparison with two earlier works, each extending the class of Sahlqvist formulae to relevance logics, and show that both are subsumed by simple subclasses of inductive formulae. (shrink)

However broad or vague the notion of connexivity may be, it seems to be similar to the notion of relevance even when relevance and connexive logics have been shown to be incompatible to one another. Relevance logics can be examined by suggesting syntactic relevance principles and inspecting if the theorems of a logic abide to them. In this paper we want to suggest that a similar strategy can be employed with connexive logics. To do so, we will suggest some properties (...) that seem to be hinted at in Nelson’s work. Following this strategy will ideally shed some light over the notion of content and will also help make a clear comparison between relevance and connexive logics. (shrink)