Consequence is at the heart of logic; an account of consequence, of what follows from what, offers a vital tool in the evaluation of arguments. Since philosophy itself proceeds by way of argument and inference, a clear view of what logical consequence amounts to is of central importance to the whole discipline. In this book JC Beall and Greg Restall present and defend what thay call logical pluralism, the view that there is more than one genuine deductive consequence relation, a (...) position which has profound implications for many linguists as well as for philosophers. We should not search for one true logic, since there are many. (shrink)

This book introduces an important group of logics that have come to be known under the umbrella term 'susbstructural'. Substructural logics have independently led to significant developments in philosophy, computing and linguistics. _An Introduction to Substrucural Logics_ is the first book to systematically survey the new results and the significant impact that this class of logics has had on a wide range of fields.The following topics are covered: * Proof Theory * Propositional Structures * Frames * Decidability * Coda Both (...) students and professors of philosophy, computing, linguistics, and mathematics will find this to be an important addition to their reading. (shrink)

Consequence is at the heart of logic; an account of consequence, of what follows from what, offers a vital tool in the evaluation of arguments. Since philosophy itself proceeds by way of argument and inference, a clear view of what logical consequence amounts to is of central importance to the whole discipline. In this book JC Beall and Greg Restall present and defend what thay call logical pluralism, the view that there is more than one genuine deductive consequence relation, a (...) position which has profound implications for many linguists as well as for philosophers. We should not search for one true logic, since there are many. (shrink)

We present and defend the Australian Plan semantics for negation. This is a comprehensive account, suitable for a variety of different logics. It is based on two ideas. The first is that negation is an exclusion-expressing device: we utter negations to express incompatibilities. The second is that, because incompatibility is modal, negation is a modal operator as well. It can, then, be modelled as a quantifier over points in frames, restricted by accessibility relations representing compatibilities and incompatibilities between such points. (...) We defuse a number of objections to this Plan, raised by supporters of the American Plan for negation, in which negation is handled via a many-valued semantics. We show that the Australian Plan has substantial advantages over the American Plan. (shrink)

A good argument is one whose conclusions follow from its premises; its conclusions are consequences of its premises. But in what sense do conclusions follow from premises? What is it for a conclusion to be a consequence of premises? Those questions, in many respects, are at the heart of logic (as a philosophical discipline). Consider the following argument: 1. If we charge high fees for university, only the rich will enroll. We charge high fees for university. Therefore, only the rich (...) will enroll. There are many different things one can say about this argument, but many agree that if we do not equivocate (if the terms mean the same thing in the premises and the conclusion) then the argument is valid, that is, the conclusion follows deductively from the premises. This does not mean that the conclusion is true. Perhaps the premises are not true. However, if the premises are true, then the conclusion is also true, as a matter of logic. This entry is about the relation between premises and conclusions in valid arguments. (shrink)

Our topic is the notion of logical consequence: the link between premises and conclusions, the glue that holds together deductively valid argument. How can we understand this relation between premises and conclusions? It seems that any account begs questions. Painting with very broad brushtrokes, we can sketch the landscape of disagreement like this: “Realists” prefer an analysis of logical consequence in terms of the preservation of truth [29]. “Anti-realists” take this to be unhelpful and o:er alternative analyses. Some, like Dummett, (...) look to preservation of warrant to assert [9, 36]. Others, like Brandom [5], take inference as primitive, and analyse other notions in terms of it. There is plenty of disagreement on the “realist” side of the fence too. It is one thing to argue that logical consequence involves preservation of truth. It is another to explain how far truth must be preserved. Is the preservation essentially modal (in all circumstances [25]) or analytic (vouchsafed by.. (shrink)

In this paper we introduce a distinct metaethical position, fictionalism about morality. We clarify and defend the position, showing that it is a way to save the 'moral phenomena' while agreeing that there is no genuine objective prescriptivity to be described by moral terms. In particular, we distinguish moral fictionalism from moral quasi-realism, and we show that fictionalism possesses the virtues of quasi-realism about morality, but avoids its vices.

One of the most dominant approaches to semantics for relevant (and many paraconsistent) logics is the Routley-Meyer semantics involving a ternary relation on points. To some (many?), this ternary relation has seemed like a technical trick devoid of an intuitively appealing philosophical story that connects it up with conditionality in general. In this paper, we respond to this worry by providing three different philosophical accounts of the ternary relation that correspond to three conceptions of conditionality. We close by briefly discussing (...) a general conception of conditionality that may unify the three given conceptions. (shrink)

In this paper I urge friends of truth-value gaps and truth-value gluts – proponents of paracomplete and paraconsistent logics – to consider theories not merely as sets of sentences, but as pairs of sets of sentences, or what I call ‘bitheories,’ which keep track not only of what holds according to the theory, but also what fails to hold according to the theory. I explain the connection between bitheories, sequents, and the speech acts of assertion and denial. I illustrate the (...) usefulness of bitheories by showing how they make available a technique for characterising different theories while abstracting away from logical vocabulary such as connectives or quanti- fiers, thereby making theoretical commitments independent of the choice of this or that particular non-classical logic. (shrink)

Beall and Restall’s Logical Pluralism (2006) characterises pluralism about logical consequence in terms of the different ways cases can be selected in the analysis of logical consequence as preservation of truth over a class of cases. This is not the only way to understand or to motivate pluralism about logical consequence. Here, I will examine pluralism about logical consequence in terms of different standards of proof. We will focus on sequent derivations for classical logic, imposing two different restrictions on classical (...) derivations to produce derivations for intuitionistic logic and for dual intuitionistic logic. The result is another way to understand the manner in which we can have different consequence relations in the same language. Furthermore, the proof-theoretic perspective gives us a different explanation of how the one concept of negation can have three different truth conditions, those in classical, intuitionistic and dual-intuitionistic models. (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.

Paraconsistent logics are often semantically motivated by considering "impossible worlds." Lewis, in "Logic for equivocators," has shown how we can understand paraconsistent logics by attributing equivocation of meanings to inconsistent believers. In this paper I show that we can understand paraconsistent logics without attributing such equivocation. Impossible worlds are simply sets of possible worlds, and inconsistent believers (inconsistently) believe that things are like each of the worlds in the set. I show that this account gives a sound and complete semantics (...) for Priest's paraconsistent logic LP, which uses materials any modal logician has at hand. (shrink)

The two-dimensional modal logic of Davies and Humberstone [3] is an important aid to our understanding the relationship between actuality, necessity and a priori knowability. I show how a cut-free hypersequent calculus for 2D modal logic not only captures the logic precisely, but may be used to address issues in the epistemology and metaphysics of our modal concepts. I will explain how the use of our concepts motivates the inference rules of the sequent calculus, and then show that the completeness (...) of the calculus for Davies–Humberstone models explains why those concepts have the structure described by those models. The result is yet another application of the completeness theorem. (shrink)

In this paper, I distinguish different kinds of pluralism about logical consequence. In particular, I distinguish the pluralism about logic arising from Carnap’s Principle of Tolerance from a pluralism which maintains that there are different, equally “good” logical consequence relations on the one language. I will argue that this second form of pluralism does more justice to the contemporary state of logical theory and practice than does Carnap’s more moderate pluralism.

The formulation and proof of Hume’s Law and several related inference barrier theses.

In this paper I introduce a sequent system for the propositional modal logic S5. Derivations of valid sequents in the system are shown to correspond to proofs in a novel natural deduction system of circuit proofs (reminiscient of proofnets in linear logic, or multiple-conclusion calculi for classical logic). -/- The sequent derivations and proofnets are both simple extensions of sequents and proofnets for classical propositional logic, in which the new machinery—to take account of the modal vocabulary—is directly motivated in terms (...) of the simple, universal Kripke semantics for S5. The sequent system is cut-free and the circuit proofs are normalising. (shrink)

I present an account of truth values for classical logic, intuitionistic logic, and the modal logic S5, in which truth values are not a fundamental category from which the logic is defined, but rather, an idealisation of more fundamental logical features in the proof theory for each system. The result is not a new set of semantic structures, but a new understanding of how the existing semantic structures may be understood in terms of a more fundamental notion of logical consequence.

This paper continues the work of Priest and Sylvan in Simplified Semantics for Basic Relevant Logics, a paper on the simplified semantics of relevant logics, such as B⁺ and B. We show that the simplified semantics can also be used for a large number of extensions of the positive base logic B⁺, and then add the dualising '*' operator to model negation. This semantics is then used to give conservative extension results for Boolean negation.

A logic is said to be contraction free if the rule from A→(A→B) to A→B is not truth preserving. It is well known that a logic has to be contraction free for it to support a non-trivial naïve theory of sets or of truth. What is not so well known is that if there is another contracting implication expressible in the language, the logic still cannot support such a naïve theory. A logic is said to be robustly contraction free if (...) there is no such operator expressible in its language. We show that a large class of finitely valued logics are each not robustly contraction free, and demonstrate that some other contraction free logics fail to be robustly contraction free. Finally, the sublogics of Łω (with the standard connectives) are shown to be robustly contraction free. (shrink)

This paper gives an outline of three different approaches to the four-valued semantics for relevant logics (and other non-classical logics in their vicinity). The first approach borrows from the 'Australian Plan' semantics, which uses a unary operator '⋆' for the evaluation of negation. This approach can model anything that the two-valued account can, but at the cost of relying on insights from the Australian Plan. The second approach is natural, well motivated, independent of the Australian Plan, and it provides a (...) semantics for the contraction-free relevant logic C (or RW). Unfortunately, its approach seems to model little else. The third approach seems to capture a wide range of formal systems, but at the time of writing, lacks a completeness proof. (shrink)

This essay is structured around the bifurcation between proofs and models: The first section discusses Proof Theory of relevant and substructural logics, and the second covers the Model Theory of these logics. This order is a natural one for a history of relevant and substructural logics, because much of the initial work — especially in the Anderson–Belnap tradition of relevant logics — started by developing proof theory. The model theory of relevant logic came some time later. As we will see, (...) Dunn’s algebraic models [76, 77] Urquhart’s operational semantics [267, 268] and Routley and Meyer’s relational semantics [239, 240, 241] arrived decades after the initial burst of activity from Alan Anderson and Nuel Belnap. The same goes for work on the Lambek calculus: although inspired by a very particular application in linguistic typing, it was developed first proof-theoretically, and only later did model theory come to the fore. Girard’s linear logic is a different story: it was discovered though considerations of the categorical models of coherence.. (shrink)

We are pluralists about logical consequence [1]. We hold that there is more than one sense in which arguments may be deductively valid, that these senses are equally good, and equally deserving of the name deductive validity. Our pluralism starts with our analysis of consequence. This analysis of consequence is not idiosyncratic. We agree with Richard Jeffrey, and with many other philosophers of logic about how logical consequence is to be defined. To quote Jeffrey.

Mark Balaguer's Platonism and Anti-Platonism in Mathematics presents an intriguing new brand of platonism, which he calls plenitudinous platonism, or more colourfully, full-blooded platonism. In this paper, I argue that Balaguer's attempts to characterise full-blooded platonism fail. They are either too strong, with untoward consequences we all reject, or too weak, not providing a distinctive brand of platonism strong enough to do the work Balaguer requires of it.

Different natural deduction proof systems for intuitionistic and classical logic —and related logical systems—differ in fundamental properties while sharing significant family resemblances. These differences become quite stark when it comes to the structural rules of contraction and weakening. In this paper, I show how Gentzen and Jaśkowski’s natural deduction systems differ in fine structure. I also motivate directed proof nets as another natural deduction system which shares some of the design features of Genzen and Jaśkowski’s systems, but which differs again (...) in its treatment of the structural rules, and has a range of virtues absent from traditional natural deduction systems. (shrink)

Implication barrier theses deny that one can derive sentences of one type from sentences of another. Hume’s Law is an implication barrier thesis; it denies that one can derive an ‘ought’ (a normative sentence) from an ‘is’ (a descriptive sentence). Though Hume’s Law is controversial, some barrier theses are philosophical platitudes; in his Lectures on Logical Atomism, Bertrand Russell claims: You can never arrive at a general proposition by inference particular propositions alone. You will always have to have at least (...) one general proposition in your premises. (Russell, 1918, p. 206) We will refer to this claim—that one cannot derive general sentences from particular sentences—as Russell’s Law.1 A third barrier thesis claims that one cannot derive sentences about the future from sentences about the past or present. Hume’s endorsement of this barrier thesis is well-known: all inferences from experience suppose, as their foundation, that the future will resemble the past . . . if there be any suspicion that the course of nature may change, and that the past may be no rule for the future, all experience becomes useless, and can give rise to no inference or conclusion. It is impossible, therefore, that any argument from experience can prove this resemblance of the past to the future; since all these arguments are founded on the supposition of that resemblance. (Hume, EHU 4.21/37) We will refer to this barrier thesis as Hume’s Second Law. A fourth barrier thesis says that one cannot derive a necessary sentence from one about the actual world and we will refer to this last thesis Kant’s Law. Such implication barrier theses present a problem. (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.

According to the “knowability thesis,” every truth is knowable. Fitch’s paradox refutes the knowability thesis by showing that if we are not omniscient, then not only are some truths not known, but there are some truths that are not knowable. In this paper, I propose a weakening of the knowability thesis (which I call the “conjunctive knowability thesis”) to the e:ect that for every truth p there is a collection of truths such that (i) each of them is knowable and (...) (ii) their conjunction is equivalent to p. I show that the conjunctive knowability thesis avoids triviality arguments against it, and that it fares very di:erently depending on another thesis connecting knowledge and possibility. If there are two propositions, inconsistent with one another, but both knowable, then the conjunctive knowability thesis is trivially true. On the other hand, if knowability entails truth, the conjunctive knowability thesis is coherent, but only if the logic of possibility is weak. (shrink)

It is known that a number of inference principles can be used to trivialise the axioms of naïve comprehension - the axioms underlying the naïve theory of sets. In this paper we systematise and extend these known results, to provide a number of general classes of axioms responsible for trivialising naïve comprehension.

In this paper we introduce a new natural deduction system for the logic of lattices, and a number of extensions of lattice logic with different negation connectives. We provide the class of natural deduction proofs with both a standard inductive definition and a global graph-theoretical criterion for correctness, and we show how normalisation in this system corresponds to cut elimination in the sequent calculus for lattice logic. This natural deduction system is inspired both by Shoesmith and Smiley's multiple conclusion systems (...) for classical logic and Girard's proofnets for linear logic. (shrink)

Once the Kripke semantics for normal modal logics were introduced, a whole family of modal logics other than the Lewis systems S1 to S5 were discovered. These logics were obtained by changing the semantics in natural ways. The same can be said of the Kripke-style semantics for relevant logics: a whole range of logics other than the standard systems R, E and T were unearthed once a semantics was given (cf. Priest and Sylvan [6], Restall [7], and Routley et al. (...) [8]). In a similar way, weakening the structural rules of the Gentzen formulation of classical logic gives rise to other ‘substructural’ logics such as linear logic (as in Girard [4]). This process of ‘strategic weakening’ is becoming popular today, with the discovery of applications of these logics to areas such as linguistics and the theory of computation (cf. van Benthem [1]). Until now no-one has (to my knowledge) examined what the process of weakening does to the Kripke-style semantics of intuitionistic logic. This paper remedies the deficiency, introducing the family of subintuitionistic logics. These systems have some appealing features. Unlike other substructural logics such as linear logic (which lack distribution of extensional disjunction over conjunction) they have a very natural Kripke-style worlds semantics. Also, the difficulties with regard to modelling quantification in these systems may be able to shed some light on the difficulties in naturally modelling quantification in relevant logics, as it must be admitted that the semantics currently available for quantified relevant logics are rather baroque (cf. Fine [3]). But most importantly, delving in the undergrowth of logics such as intuitionistic logic gives us a ‘feel’ for how such systems are put together, and what job is being done by each aspect of the modelling conditions in.. (shrink)

Graham Priest defends the use of a nonmonotonic logic, LPm, in his analysis of reasoning in the face of true contradictions, such as those arising from the paradoxes of self-reference. In the course of defending this choice of logic in the face of the criticism that this logic is not truth preserving, Priest argued that requirement is too much to ask: since LPm is a nonmonotonic logic, it necessarily fails to preserve truth. In this article, I show that this assumption (...) is incorrect, and I explain why nonmonotonic logics can nonetheless be truth preserving. Finally, I diagnose Priest's error, to explain when nonmonotonic logics do indeed fail to preserve truth. (shrink)

Stephen Neale presents, in Facing Facts (Oxford: Clarendon Press, 2001), one convenient package containing his reasoned complaints against theories of facts and non-extensional connectives. The slingshot is a powerful argument (or better, it is a powerful family of arguments) which constrains theories of facts, propositions and non-extensional connectives by showing that some of these theories are rendered trivial. This book is the best place to find the state of the art on the slingshot and its implications for logic, language and (...) metaphysics. It provides a useful starting point for anyone who has wondered what all of the fuss about the slingshot amounts to. Neale shows that the fuss does amount to something, and that theories of facts must “face facts” and present an adequate response to the slingshot. However, Neale’s evaluation of the state of play for theories of facts is too pessimistic. As the book draws near to a close, Neale writes: As I have stressed, Russell’s Theory of Facts, according to which facts have properties as components, is safe. It is certainly tempting to draw the moral that if one wants non-collapsing facts one needs properties as components of facts. I have not attempted to prove this here, but I suspect it will be proved in due course. (page 210) Neale concludes that while theories which take facts to be structured entities are safe from slingshot arguments, and he suspects that this is the only kind of fact theory safe from slingshot-style collapse. If this were the case, then theories such as situation theories or accounts of truthmakers may well be threatened. However, Neale’s suspicion is ill-founded, as I shall soon show. Not only do Russellian theories of facts survive the slingshot unscathed, but so can theories of facts which take them to be unstructured entities. Furthermore, the way that this may be not only argued for, but proved can provide a new weapon in the armoury of the theorist investigating fact theories. (shrink)

Greg Restall's Logic provides concise introductions to propositional and first-order predicate logic while showing how formal logic intersects with substantial philosophical issues such as vagueness, conditionals, relevance, propositional attitudes, and opaque contents. The author also examines the ideas behind modal logic, free logic, and other non-standard logics and discusses the nature of logic itself. The book covers both natural deduction and tree methods for proving validity. Each chapter includes excellent suggestions for further reading and both elementary and more advanced exercises, (...) with solutions provided on a website. It is flexibly designed to be useable for half or full-year courses, for courses focusing exclusively on formal logic, or for a variety of approaches that would integrate topics in philosophical logic. Restall examines many of the interesting issues raised by basic logical techniques and will undoubtedly stimulate further study in the discipline. This is a logic book designed principally for philosophers but which will also be of interest to students of computer science, cognitive science, and linguistics. (shrink)

Molinism is an attempt to do equal justice to divine foreknowledge and human freedom. For Molinists, human freedom fits in this universe for the future is open or unsettled. However, God’s middle knowledge — God’s contingent knowledge of what agents would freely do in this or that circumstance — underwrites God’s omniscience in the midst of this openness. In this paper I rehearse Nuel Belnap and Mitchell Green’s argument in “Indeterminism and the Thin Red Line ” against the reality of (...) a distinguished single future in the context of branching time [2], and show that it applies applies equally against Molinism + branching time. In the process, we show how contemporary work in the logic of temporal notions in the context of branching time can illuminate discussions in the metaphysics of freedom and divine knowledge. (shrink)

Proponents of “truth-value glut” responses to the paradoxes of self-reference, such as Priest [6, 7] argue that “truth-value gap” analyses of the paradoxes fall foul of the strengthened liar paradox: “this sentence is not true.” If we pay attention to the role of assertion and denial and the behaviour of negation in both “gap” and “glut” analyses, we see that the situation with these approaches has a pleasing symmetry: gap approaches take some denials to fail to be expressible by negation, (...) and glut approaches take some negations to not express denials. But in the light of this symmetry, considerations against a gap view point to parallel considerations against a glut view. Those who find some reason to prefer one view over another (and this is almost everyone) must find some reason to break this symmetry. (shrink)

According to one tradition in realist philosophy, 'truthmaking' amounts to necessitation. That is, an object x is a truthmaker for the claim A if x exists, and the existence of x necessitates the truth of A. I argued in my paper "Truthmakers, Entailment and Necessity" [14], that if we wish to use this account of truthmaking, we ought understand the entailment connective "=>" in such a claim as a relevant entailment, in the tradition of Anderson and Belnap and their co-workers (...) [1, 2, 8, 11]. Furthermore, I proposed a number of theses about truthmaking as necessitation. The most controversial of these is the disjunction thesis: x makes a disjunction A v B true if and only if it makes one of the disjuncts (A or B) true. That paper left one important task unfinished. I did not explain how the theses about truthmaking could be true together. In this paper I give a consistency proof, by providing a model for the theses of truthmaking in my earlier paper. This result does two things. First, it shows that the theses of truthmaking are jointly consistent. Second, it provides an independently philosophically motivated formal model for relevant logics in the 'possible worlds' tradition of Routley and Meyer [8, 16, 17]. (shrink)

In this note I respond to Hartley Slater's argument 12 to the e ect that there is no such thing as paraconsistent logic. Slater's argument trades on the notion of contradictoriness in the attempt to show that the negation of paraconsistent logics is merely a subcontrary forming operator and not one which forms contradictories. I will show that Slater's argument fails, for two distinct reasons. Firstly, the argument does not consider the position of non-dialethic paraconsistency which rejects the possible truth (...) of any contradictions. Against this position Slater's argument has no bite at all. Secondly, while the argument does show that for dialethic paraconsistency according to which contradictions can be true, certain other contradictions must be true, I show that this need not deter the dialethic paraconsistentist from their position. (shrink)

The paradoxes of self-reference are genuinely paradoxical. The liar paradox, Russell’s paradox and their cousins pose enormous difficulties to anyone who seeks to give a comprehensive theory of semantics, or of sets, or of any other domain which allows a modicum of self-reference and a modest number of logical principles. One approach to the paradoxes of self-reference takes these paradoxes as motivating a non-classical theory of logical consequence. Similar logical principles are used in each of the paradoxical inferences. If one (...) or other of these problematic inferences are rejected, we may arrive at a consistent (or at least, a coherent) theory. In this paper I will show that such approaches come at a serious cost. The general approach of using the paradoxes to restrict the class of allowable inferences places severe constraints on the domain of possible propositional logics, and on the kind of metatheory that is appropriate in the study of logic itself. Proof-theoretic and model-theoretic analyses of logical consequence make provide different ways for non-classical responses to the paradoxes to be defeated by revenge problems: the redefinition of logical connectives thought to be ruled out on logical grounds. Non-classical solutions are not the “easy way out” of the paradoxes. (shrink)

Here is a puzzle, which I learned from Terence Parsons in his “True Contradictions” [8]. First Degree Entailment is a logic which allows for truth value gaps as well as truth value gluts. If you are agnostic between assigning paradoxical sentences gaps and gluts, then this looks no different, in effect, from assigning them a gap value? After all, on both views you end up with a theory that doesn’t commit you to the paradoxical sentence or its negation. How is (...) the fde theory any different from the theory with gaps alone? In this paper, I will present a clear answer to this puzzle – an answer that explains how being agnostic between gaps and gluts is a genuinely different position than admitting gaps alone, by using the formal notion of a bi-theory, and showing that while such positions might agree on what is to be accepted, they differ on what is to be rejected. (shrink)

A B S T R AC T: In this paper I consider an interpretation of future contingents which motivates a unification of a Łukasiewicz-style logic with the more classical supervaluational semantics. This in turn motivates a new non-classical logic modelling what is “made true by history up until now. ” I give a simple Hilbert-style proof theory, and a soundness and completeness argument for the proof theory with respect to the intended models.

This is an exploratory and expository paper, comparing display logic formulations of normal modal logics with labelled sequent systems. We provide a translation from display sequents into labelled sequents. The comparison between different systems gives us a different way to understand the difference between display systems and other sequent calculi as a difference between local and global views of consequence. The mapping between display and labelled systems also gives us a way to understand labelled systems as properly structural and not (...) just as systems encoding modal logic into first-order logic. (shrink)