We suggest two precise abstract definitions of the notion of ‘relevance logic’ which are both independent of any proof system or semantics. We show that according to the simpler one, R → source is the minimal relevance logic, but R itself is not. In contrast, R and many other logics are relevance logics according to the second definition, while all fragments of linear logic are not.

We show that as long as the propositional constants t and f are not included in the language, any language-preserving extension of any important fragment of the relevance logics R and RMI can have only classical tautologies as theorems . This property is not preserved, though, if either t or f is added to the language, or if the contraction axiom is deleted.

Relevant logics are a family of non-classical logics characterized by the behavior of their implication connectives. Unlike some other non-classical logics, such as intuitionistic logic, there are multiple philosophical views motivating relevant logics. Further, different views seem to motivate different logics. In this article, we survey five major views motivating the adoption of relevant logics: Use Criterion, sufficiency, meaning containment, theory construction, and truthmaking. We highlight the philosophical differences as well as the different logics they support. We end with some (...) questions for future research. (shrink)

The aim of the present book is to give a comprehensive account of the ‘state of the art’ of substructural logics, focusing both on their proof theory and on their semantics (both algebraic and relational. It is for graduate students in either philosophy, mathematics, theoretical computer science or theoretical linguistics as well as specialists and researchers.

There are several features of law which rightly draw the interest of philosophers, especially those whose expertise lies in ethics and social and political philosophy. But the law also has features which haven’t stirred much in the way of philosophical investigation. I must say that I find this surprising. For the fact is that a well-run criminal trial is a master-class in logic and epistemology. Below I examine the logical and epistemological properties of greatest operational involvement in a criminal proceedings, (...) concepts such as evidence, proof, argument, inference, relevance, probability, and more. My principal objective is to expose the deep cleavage between establishment norms in epistemology and logic and standard practice in criminal proceedings. This gives us two options to reflect upon. In one, the establishment norms for the correct management of the concepts in question are basically sound. In that case, as I will show, common law criminal practice would be basically unsound; its convictions would be basically false and unjust. Seen from the other perspective, the criminal justice system would be basically sound, and its criminal convictions basically true and just. It turns out to matter that option one meets with widely spread common disbelief and is generally taken as contrary to common knowledge. What is needed here is an epistemology which gives these sentiments some air to breathe. I will argue that on balance it is the logico-epistemic establishment which requires some serious rethinking. (shrink)

This paper presents an information-based logic that is applied to the analysis of entailment, implicature and presupposition in natural language. The logic is very fine-grained and is able to make distinctions that are outside the scope of classical logic. It is independently motivated by certain properties of natural human reasoning, namely partiality, paraconsistency, relevance, and defeasibility: once these are accounted for, the data on implicature and presupposition comes quite naturally.The logic is based on the family of semantic spaces known as (...) bilattices, originally proposed by Ginsberg (1988), and used extensively by Fitting (1989, 1992). Specifically, the logic is based on a subset of bilattices that I call evidential bilattices, constructed as the Cartesian product of certain algebras with themselves. The specific details of the epistemic agent approach of the logical system is derived from the work of Belnap (1975, 1977), augmented by the use of evidential links for inferencing. An important property of the system is that it has been implemented using an extension of Fitting's work on bilattice logic programming (1989, 1991) to build a model-based inference engine for the augmented Belnap logic. This theorem prover is very efficient for a reasonably wide range of inferences. (shrink)

I discuss paradoxes of implication in the setting of a proof-conditional theory of meaning for logical constants. I argue that a proper logic of implication should be not only relevant, but also constructive and nonmonotonic. This leads me to select as a plausible candidate LL, a fragment of linear logic that differs from R in that it rejects both contraction and distribution.

It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMImin has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMImin is decidable.

Relevant logics have traditionally been viewed as paraconsistent. This paper shows that this view of relevant logics is wrong. It does so by showing forth a logic which extends classical logic, yet satisfies the Entailment Theorem as well as the variable sharing property. In addition it has the same S4-type modal feature as the original relevant logic E as well as the same enthymematical deduction theorem. The variable sharing property was only ever regarded as a necessary property for a logic (...) to have in order for it to not validate the so-called paradoxes of implication. The Entailment Theorem on the other hand was regarded as both necessary and sufficient. This paper shows that the latter theorem also holds for classical logic, and so cannot be regarded as a sufficient property for blocking the paradoxes. The concept of suppression is taken up, but shown to be properly weaker than that of variable sharing. (shrink)

I argue in favour of object languages of logics to be diversely-generated, that is, not having identical immediate sub-formulas. In addition to diversely-generated object languages constituting a more appropriate abstraction of the use of sentential connectives in natural language, I show that such language lead to a simplifications w.r.t. some specific issues: the identity of proofs, the factual equivalence and the Mingle axiom in Relevance logics. I also point out that some of the properties of classical logic based on freely-generated (...) object languagest. (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)

In this paper, I motivate the addition of an actuality operator to relevant logics. Straightforward ways of doing this are in tension with standard motivations for relevant logics, but I show how to add the operator in a way that permits one to maintain the intuitions behind relevant logics. I close by exploring some of the philosophical consequences of the addition.

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)

Modern belief revision theory is based to a large extent on partial meet contraction that was introduced in the seminal article by Carlos Alchourrón, Peter Gärdenfors, and David Makinson that appeared in 1985. In the same year, Alchourrón and Makinson published a significantly different approach to the same problem, called safe contraction. Since then, safe contraction has received much less attention than partial meet contraction. The present paper summarizes the current state of knowledge on safe contraction, provides some new results (...) and offers a list of unsolved problems that are in need of investigation. (shrink)