By and large, the conditional connective in three-valued logic has two different functions. First, by means of a deduction theorem, it can express a specific relation of logical consequence in the logical language itself. Second, it can represent natural language structures such as "if/then'' or "implies''. This chapter surveys both approaches, shows why none of them will typically end up with a three-valued material conditional, and elaborates on connections to probabilistic reasoning.

B. Kooi and A. Tamminga present a correspondence analysis for extensions of G. Priest’s logic of paradox. Each unary or binary extension is characterizable by a special operator and analyzable via a sound and complete natural deduction system. The present paper develops a sound and complete proof searching technique for the binary extensions of the logic of paradox.

The aim of this paper is to explore the peculiar case of infectious logics, a group of systems obtained generalizing the semantic behavior characteristic of the -fragment of the logics of nonsense, such as the ones due to Bochvar and Halldén, among others. Here, we extend these logics with classical negations, and we furthermore show that some of these extended systems can be properly regarded as logics of formal inconsistency and logics of formal undeterminedness.

This paper proposes a new dialetheic logic, a Dialetheic Logic with Exclusive Assumptions and Conclusions ), including classical logic as a particular case. In \, exclusivity is expressed via the speech acts of assuming and concluding. In the paper we adopt the semantics of the logic of paradox extended with a generalized notion of model and we modify its proof theory by refining the notions of assumption and conclusion. The paper starts with an explanation of the adopted philosophical perspective, then (...) we propose our \ logic. Finally, we show how \ supports the dialetheic solution of the liar paradox. (shrink)

In the paper, we tackle the matter of non-classical logics, in particular, paraconsistent ones, for which not every formula follows in general from inconsistent premisses. Our benchmark is Jaśkowski’s logic, modeled with the help of discussion. The second key origin of this paper is the matter of being tabular, i.e. being adequately expressible by finitely many finite matrices. We analyse Jaśkowski’s non-tabular discussive (discursive) logic $ \textbf {D}_{2}$, one of the first paraconsistent logics, from the perspective of a trivalent tabular (...) logic. We are motivated to step down from the ongoing modal $ \textbf {S5}$-perspective of developing $ \textbf {D}_{2}$ both by certain mysteries that have been surrounding it and by gaps in Jaśkowski’s arguments contra the multivalent tabular perspective. Although Jaśkowski’s idea to use $ \textbf {S5}$ in order to define $ \textbf {D}_{2}$ is very attractive since it allows one to benefit from the tools and results of modal logic, it also gives a ‘non-direct’ formulation and, as it appeared later, is superfluous with respect to what is meant to be achieved since one can define the very same logic but using modal logics weaker than S5. It is also known, due to Kotas, that discussive logic is not finite-valued. So, in light of Kotas’s result that $ \textbf {D}_{2}$ is non-tabular, we propose to associate it with a few dozen discussive formulae that Jaśkowski unequivocally and illustratively suggests to be its theorems or non-theorems rather than with axioms of its modern axiomatizations (one of which Kotas employs) in order to be capable of performing a computer-aided brute-force search for suitable trivalent matrices in the cases of one and two designated values. As a result, we find trivalent matrices with two designated values that might be dubbed ‘discussive’ because they meet Jaśkowski’s suggestion to validate and invalidate the litmus theorems and non-theorems, respectively, despite the fact that none of them validates all the negation axioms in the modern axiomatizations of $ \textbf {D}_{2}$. The matrices found are then analysed along with highlighting the ones that were previously mentioned in the literature. We conclude the paper with a comparative analysis of Omori’s results and a test of Karpenko’s hypothesis. (shrink)

A unified and modular falsification-aware single-succedent Gentzen-style framework is introduced for classical, paradefinite, paraconsistent, and paracomplete logics. This framework is composed of two special inference rules, referred to as the rules of explosion and excluded middle, which correspond to the principle of explosion and the law of excluded middle, respectively. Similar to the cut rule in Gentzen’s LK for classical logic, these rules are admissible in cut-free LK. A falsification-aware single-succedent Gentzen-style sequent calculus fsCL for classical logic is formalized based (...) on the proposed framework. The calculus fsCL is obtained from the existing falsification-aware single-succedent Gentzen-style sequent calculus GN4 for Nelson’s paradefinite (or paraconsistent) four-valued logic N4 by adding the rules of explosion and excluded middle. A falsification-aware single-succedent Gentzen-style sequent calculus GN3 for Nelson’s paracomplete three-valued logic N3 is also obtained from GN4 by adding the rule of explosion. The cut-elimination theorems for fsCL, GN3, and some of their neighbors as well as the Glivenko theorem for fsCL are proved. (shrink)

The logic of paradox, LP, is a first-order, three-valued logic that has been advocated by Graham Priest as an appropriate way to represent the possibility of acceptable contradictory statements. Second-order LP is that logic augmented with quantification over predicates. As with classical second-order logic, there are different ways to give the semantic interpretation of sentences of the logic. The different ways give rise to different logical advantages and disadvantages, and we canvass several of these, concluding that it will be extremely (...) difficult to appeal to second-order LP for the purposes that its proponents advocate, until some deep, intricate, and hitherto unarticulated metaphysical advances are made. (shrink)

Infectious logics are systems that have a truth-value that is assigned to a compound formula whenever it is assigned to one of its components. This paper studies four-valued infectious logics as the basis of transparent theories of truth. This take is motivated as a way to treat different pathological sentences differently, namely, by allowing some of them to be truth-value gluts and some others to be truth-value gaps and as a way to treat the semantic pathology suffered by at least (...) some of these sentences as infectious. This leads us to consider four distinct four-valued logics: one where truth-value gaps are infectious, but gluts are not; one where truth-value gluts are infectious, but gaps are not; and two logics where both gluts and gaps are infectious, in some sense. Additionally, we focus on the proof theory of these systems, by offering a discussion of two related topics. On the one hand, we prove some limitations regarding the possibility of providing standard Gentzen sequent calculi for these systems, by dualizing and extending some recent results for infectious logics. On the other hand, we provide sound and complete four-sided sequent calculi, arguing that the most important technical and philosophical features taken into account to usually prefer standard calculi are, indeed, enjoyed by the four-sided systems. (shrink)

In this article we will focus our attention on the variety of distributive bisemilattices and some linguistic expansions thereof: bounded, De Morgan, and involutive bisemilattices. After extending Balbes’ representation theorem to bounded, De Morgan, and involutive bisemilattices, we make use of Hartonas–Dunn duality and introduce the categories of 2spaces and 2spaces\. The categories of 2spaces and 2spaces\ will play with respect to the categories of distributive bisemilattices and De Morgan bisemilattices, respectively, a role analogous to the category of Stone spaces (...) with respect to the category of Boolean algebras. Actually, the aim of this work is to show that these categories are, in fact, dually equivalent. (shrink)

In this paper we explain our pretense account of truth-talk and apply it in a diagnosis and treatment of the Liar Paradox. We begin by assuming that some form of deflationism is the correct approach to the topic of truth. We then briefly motivate the idea that all T-deflationists should endorse a fictionalist view of truth-talk, and, after distinguishing pretense-involving fictionalism (PIF) from error- theoretic fictionalism (ETF), explain the merits of the former over the latter. After presenting the basic framework (...) of our PIF account of truth-talk, we demonstrate a few advantages it offers over T-deflationist accounts that do not explicitly acknowledge pretense at work in the discourse. In turning to the Liar Paradox, we explain how the quasi-anaphoric functioning that our account attributes to truth-talk provides a diagnosis of the Liar Paradox (and other instances of semantic pathology) as having no content—in the sense of not specifying any of what we call M-conditions. At the same time, however, we vindicate the intuition that we can understand liar sentences, thereby avoiding one standard objection to “meaningless strategy” responses to the Liar Paradox. With this diagnosis in place, we then, by way of treatment, introduce a new predicate, ‘semantically defective’, and show how the explanation we give for its application allows for a consistent, yet revenge-immune, (dis)solution of the Liar Paradox, and semantic pathology generally. (shrink)

This paper is a sequel to Beall (2011), in which I both give and discuss the philosophical import of a result for the propositional (multiple-conclusion) logic LP+. Feedback on such ideas prompted a spelling out of the first-order case. My aim in this paper is to do just that: namely, explicitly record the first-order result(s), including the collapse results for K3+ and FDE+.

Logics that have many truth values—more than just True and False—have been argued to be useful in the analysis of very many philosophical and linguistic puzzles. In this paper, which is a followup to, we will start with a particularly well-motivated four-valued logic that has been studied mainly in its propositional and first-order versions. And we will then investigate its second-order version. This four-valued logic has two natural three-valued extensions: what is called a “gap logic”, and what is called a (...) “glut logic”. We mention various results about the second-order version of these logics as well. And we then follow our earlier papers, where we had added a specific conditional connective to the three valued logics, and now add that connective to the four-valued logic under consideration. We then show that, although this addition is “conservative” in the sense that no new theorems are generated in the four-valued logic unless they employ this new conditional in their statement, nevertheless the resulting second-order versions of these logics with and without the conditional are quite different in important ways. We close with a moral for logical investigations in this realm. (shrink)

Logical orthodoxy has it that classical first-order logic, or some extension thereof, provides the right extension of the logical consequence relation. However, together with naïve but intuitive principles about semantic notions such as truth, denotation, satisfaction, and possibly validity and other naïve logical properties, classical logic quickly leads to inconsistency, and indeed triviality. At least since the publication of Kripke’s Outline of a theory of truth , an increasingly popular diagnosis has been to restore consistency, or at least non-triviality, by (...) restricting some classical rules. Our modest aim in this note is to briefly introduce the main strands of the current debate on paradox and logical revision, and point to some of the potential challenges revisionary approaches might face, with reference to the nine contributions to the present volume.For a recent introduction to non-classical theories of truth and other semantic notions, see the excellent Beall a .. (shrink)

Paraconsistent and dialetheist approaches to a theory of truth are faced with a problem: the expressive resources of the logic do not suffice to express that a sentence is just true—i.e., true and not also false—or to express that a sentence is consistent. In his recent book, Spandrels of Truth, Jc Beall proposes a ‘just true’-operator to identify sentences that are true and not also false. Beall suggests seven principles that a ‘just true’-operator must fulfill, and proves that his operator (...) indeed fulfills all of them. He concludes that just true has been expressed in the language. I argue that, while the seven conditions may be necessary for an operator to express just true, they are not jointly sufficient. Specifically, first, I prove that a further plausible desideratum for necessary conditions on ‘just true’ is not fulfilled by Beall's proposal, namely that ‘just true’ ascriptions should themselves be just true, and not also false (or equivalently, that the ‘just true’-operator iterates). Second, I show that Beall's operator does not adequately express just true, but that it merely captures an arbitrary proper subset of the just true sentences. Further, there is no prospect of extending the proposal in order to encompass a more reasonable subset of the just true sentences without presupposing that we have antecedent means to characterize the class of just true sentences. (shrink)

Antinomicity is not necessarily dependent on negation; there is a more general conception of antinomicity based on the fundamental idea of opposition. To study this fact is indispensable to show first that truth and falsity are independent of assertion and negation. Then it can be seen that antinomies can be found everywhere, and that some single categories are in intrinsic opposition with themselves while others are opposed to one another in pairs. An antinomic ‘manifesto’ concludes the work.

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)

Dialetheists believe some sentences are both true and false. Objectors have argued that this makes it unclear how people can disagree with each other because, given the dialetheist’s commitments, if I make a claim and you tell me my claim is false, we might both be correct. Graham Priest (2006a) thinks that people disagree by rejecting or denying what is said rather than ascribing falsehood to it. We build on the work of Julien Murzi and Massimiliano Carrara (2015) and show (...) that Priest’s approach cannot succeed: given the same dialetheist’s commitments you may be correct to reject a claim that I correctly believe. We argue further that any attempt to solve the problem by identifying a new attitude of disagreement will also fail. The culprit, we claim, is the attempt to find a pair of attitudes that satisfy ‘exclusivity’—that is, attitudes such that both cannot be simultaneously correct. Instead of identifying disagreement by the kinds of attitudes involved, we propose dialetheists focus on the normative landscape and identify it in part by whether parties have reasons to change their attitudes. We offer our own normative theory of disagreement to help dialetheists with this challenge. (shrink)

The fundamental problem of Christology is the apparent contradiction of Christ as recorded at Chalcedon. Christ is human and Christ is divine. Being divine entails being immutable. Being human entails being mutable. Were Christ two different persons there’d be no apparent contradiction. But Chalcedon rules as much out. Were Christ only partly human or only partly divine there’d be no apparent contradiction. But Chalcedon rules as much out. Were the very meaning of ‘mutable’ and/or ‘immutable’ other than what they are, (...) there’d be no apparent contradiction. But the meaning is what it is, and changing the meaning of our terms to avoid the apparent contradiction of Christ is an apparent flight from reality. What, in the end, is the explanation of the apparent contradiction of Christ? Theologians and philosophers have long advanced many consistency-seeking answers, all of which increase the metaphysical or semantical complexity of the otherwise strikingly simple but radical core of Christianity’s GodMan. In this paper, I put the simplest explanation on the theological table: namely, Christ appears to be contradictory because Christ is contradictory. This explanation may sound complicated to the many who are steeped in the mainstream account of logic according to which logic precludes the possibility of true contradictions. But the mainstream account of logic can and should be rejected. Ridding theology of the dogma of mainstream logic illuminates the simple though striking explanation of the apparent contradiction of Christ — namely, that Christ is a contradictory being. Just as the simplest explanation to the apparent roundness of the earth has earned due acceptance, so too should the simplest explanation of the apparent contradiction of Christ. (shrink)

This paper challenges defenders/advocates of the semantic-completeness route towards gluts to explain, in simple and plausible terms, why the ‘trivializer paradox’, framed in terms of closure relatives on theories, fails to undermine their argument.

We cast doubts on the suggestion, recently made by Graham Priest, that glut theorists may express disagreement with the assertion of A by denying A. We show that, if denial is to serve as a means to express disagreement, it must be exclusive, in the sense of being correct only if what is denied is false only. Hence, it can’t be expressed in the glut theorist’s language, essentially for the same reasons why Boolean negation can’t be expressed in such a (...) language either. We then turn to an alternative proposal, recently defended by Beall (in Analysis 73(3):438–445, 2013; Rev Symb Log, 2014), for expressing truth and falsity only, and hence disagreement. According to this, the exclusive semantic status of A, that A is either true or false only, can be conveyed by adding to one’s theory a shrieking rule of the form A & ~A |- \bot, where \bot entails triviality. We argue, however, that the proposal doesn’t work either. The upshot is that glut theorists face a dilemma: they can either express denial, or disagreement, but not both. Along the way, we offer a bilateral logic of exclusive denial for glut theorists—an extension of the logic commonly called LP. (shrink)

In this paper we deal with infinitary universal Horn logic both with and without equality. First, we obtain a relative Lyndon-style interpolation theorem. Using this result, we prove a non-standard preservation theorem which contains, as a particular case, a Lyndon-style theorem on surjective homomorphisms in its Makkai-style formulation. Another consequence of the preservation theorem is a theorem on bimorphisms, which, in particular, provides a tool for immediate obtaining characterizations of infinitary universal Horn classes without equality from those with equality. From (...) the theorem on surjective homomorphisms we also derive a non-standard Beth-style preservation theorem that yields a non-standard Beth-style definability theorem, according to which implicit definability of a relation symbol in an infinitary universal Horn theory implies its explicit definability by a conjunction of atomic formulas. We also apply our theorem on surjective homomorphisms, theorem on bimorphisms and definability theorem to algebraic logic for general propositional logic. (shrink)

I believe that, for reasons elaborated elsewhere (Beall, 2009; Priest, 2006a, 2006b), the logic LP (Asenjo, 1966; Asenjo & Tamburino, 1975; Priest, 1979) is roughly right as far as logic goes.1 But logic cannot go everywhere; we need to provide nonlogical axioms to specify our (axiomatic) theories. This is uncontroversial, but it has also been the source of discomfort for LP-based theorists, particularly with respect to true mathematical theories which we take to be consistent. My example, throughout, is arithmetic; but (...) the more general case is also considered. (shrink)

In this paper, we present a calculus of paraconsistent logic. We propose an axiomatisation and a semantics for the calculus, and prove several important meta-theorems. The calculus, denoted as CB1, is an extension of systems PI, C min and B1, and a proper subsystem of Sette’s calculus P1. We also investigate the generalization of CB1 to the hierarchy of related calculi.

Correspondence analysis is Kooi and Tamminga’s universal approach which generates in one go sound and complete natural deduction systems with independent inference rules for tabular extensions of many-valued functionally incomplete logics. Originally, this method was applied to Asenjo–Priest’s paraconsistent logic of paradox LP. As a result, one has natural deduction systems for all the logics obtainable from the basic three-valued connectives of LP -language) by the addition of unary and binary connectives. Tamminga has also applied this technique to the paracomplete (...) analogue of LP, strong Kleene logic \. In this paper, we generalize these results for the negative fragments of LP and \, respectively. Thus, the method of correspondence analysis works for the logics which have the same negations as LP or \, but either have different conjunctions or disjunctions or even don’t have them as well at all. Besides, we show that correspondence analyses for the negative fragments of \ and LP, respectively, are also suitable without any changes for the negative fragments of Heyting’s logic \ and its dual \ and LP). (shrink)

It is often argued that fully structural theories of truth and related notions are incapable of expressing a nonstratified notion of defectiveness. We argue that recently much-discussed non-contractive theories suffer from the same expressive limitation, provided they identify the defective sentences with the sentences that yield triviality if they are assumed to satisfy structural contraction.

A survey is given of three-valued paraconsistent propositionallogics connected with Jaśkowski’s criterion for constructing paraconsistentlogics. Several problems are raised and four new matrix three-valued paraconsistent logics are suggested.