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)

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 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)

In 1988, Kit Fine published a semantic theory for quantified relevant logics. He referred to this theory as stratified semantics. While it has received some attention in the literature, 1–20, 1992; Mares & Goldblatt, Journal of Symbolic Logic 71, 163–187, 2006), stratified semantics has overall received much less attention than it deserves. There are two plausible reasons for this. First, the only two dedicated treatments of stratified semantics available are, 27–59, 1988; Mares, Studia Logica 51, 1–20, 1992), both of which (...) are quite dense and technically challenging. Second, there are a number of prima facie reasons to be worried about stratified semantics. The purpose of this paper is to revitalize research on stratified semantics. I will do so by giving a ‘user friendly’ presentation of the semantics, and by giving reasons to think that the prima facie reasons to be worried about it are too simplistic. (shrink)

There is a natural story about what logic is that sees it as tied up with two operations: a ‘throw things into a bag’ operation and a ‘closure’ operation. In a pair of recent papers, Jc Beall has fleshed out the account of logic this leaves us with in more detail. Using Beall’s exposition as a guide, this paper points out some problems with taking the second operation to be closure in the usual sense. After pointing out these problems, I (...) then turn to fixing them in a restricted case and modulo a few simplifying assumptions. In a followup paper, the simplifications and restrictions will be removed. (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.

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)

Logic: the Basics is an accessible introduction to the core philosophy topic of standard logic. Focussing on traditional Classical Logic the book deals with topics such as mathematical preliminaries, propositional logic, monadic quantified logic, polyadic quantified logic, and English and standard ‘symbolic transitions’. With exercises and sample answers throughout this thoroughly revised new edition not only comprehensively covers the core topics at introductory level but also gives the reader an idea of how they can take their knowledge further and the (...) philosophical questions around logic. -/- Logic: the Basics is essential reading for first-year undergraduate philosophy students on standard introductory logic courses. (shrink)

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)

This paper presents a new semantics for the weak relevant logic DW that makes the role of the infamous Routley star more explicable. Central to this rewriting is combining aspects of both the American and Australian plan for understanding negations in relevance logics.

I present a version of Kit Fine's stratified semantics for the logic RWQ and define a natural family of related structures called RW hyperdoctrines. After proving that RWQ is sound with respect to RW hyperdoctrines, we show how to construct, for each stratified model, a hyperdoctrine that verifies precisely the same sentences. Completeness of RWQ for hyperdoctrinal semantics then follows from completeness for stratified semantics, which is proved in an appendix. By examining the base category of RW hyperdoctrines, we find (...) reason to be worried about the ontology of stratified models. (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.

In this paper we introduce a novel way of building arithmetics whose background logic is R. The purpose of doing this is to point in the direction of a novel family of systems that could be candidates for being the infamous R#1/2 that Meyer suggested we look for.

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)

Linnebo and Pettigrew present some objections to category theory as an autonomous foundation. They do a commendable job making clear several distinct senses of ‘autonomous’ as it occurs in the phrase ‘autonomous foundation’. Unfortunately, their paper seems to treat the ‘categorist’ perspective rather unfairly. Several infelicities of this sort were addressed by McLarty. In this note I address yet another apparent infelicity.

Abstraction principles provide implicit definitions of mathematical objects. In this paper, an abstraction principle defining categories is proposed. It is unsatisfiable and inconsistent in the expected ways. Two restricted versions of the principle which are consistent are presented.

Categorial logic, as its name suggests, applies the techniques and machinery of category theory to topics traditionally classified as part of logic. We claim that these tools deserve attention from a greater range of philosophers than just the mathematical logicians. We support this claim with an example. In this paper we show how one particular tool from categorial logic---hyperdoctrines---suggests interesting metaphysics. Hyperdoctrines can provide semantics for quantified languages, but this account of quantification suggests a metaphysical picture quite different from the (...) one suggested by standard model-theoretic semantics. (shrink)

This essay will examine some rather serious trouble confronting claims that mathematicalia might be social constructs. Because of the clarity with which he makes the case and the philosophical rigor he applies to his analysis, our exemplar of a social constructivist in this sense is Julian Cole, especially the work in his 2009 and 2013 papers on the topic. In a 2010 paper, Jill Dieterle criticized the view in Cole’s 2009 paper for being unable to account for the atemporality of (...) mathematical existents. Cole’s 2013 paper addresses this objection, providing a modification of his 2009 paper allowing for atemporal mathematicalia. An unusual consequence of Cole’s account is that at least some existential claims about mathematicalia used to be false but now have always been true. By examining the semantics of such claims, we demonstrate that social constructivism is in fact, despite Cole’s attempts to rectify matters, incompatible with atemporal mathematicalia. In the course of examining these semantic details, however, an alternative hybrid view of fictionalism and social constructivism emerges. Those tempted by social constructivism, while perhaps disappointed by the negative results of the paper, may be encouraged by how much of their view can be recovered in this alternative account. (shrink)