Circular denitions have primarily been studied in revision theory in the classical scheme. I present systems of circular denitions in the Strong Kleene and supervaluation schemes and provide complete proof systems for them. One class of denitions, the intrinsic denitions, naturally arises in both schemes. I survey some of the features of this class of denitions.

This paper explores taste fragmentalism, a novel approach to matters of taste and faultless disagreement. The view is inspired by Kit Fine’s fragmentalism about time, according to which the temporal dimension can be constituted—in an absolute manner—by states that are pairwise incompatible, provided that they do not obtain together. In the present paper, we will apply this metaphysical framework to taste states. In our proposal, two incompatible taste states (such as the state of rhubarb’s being tasty and the state of (...) rhubarb’s being distasteful) can both constitute reality in an absolute manner, although no agent can have joint access to both states. We will then develop a formalised version of our view by means of an exact truthmaker semantics for taste assertions. Within this framework—we argue—our linguistic and inferential practices concerning cases of faultless disagreement are elegantly vindicated, thus suggesting that taste fragmentalism is worth of further consideration. (shrink)

In this paper, I introduce and defend a notion of analyticity for formal languages. I first uncover a crucial flaw in Timothy Williamson’s famous argument template against analyticity, when it is applied to sentences of formal mathematical languages. Williamson’s argument targets the popular idea that a necessary condition for analyticity is that whoever understands an analytic sentence assents to it. Williamson argues that for any given candidate analytic sentence, there can be people who understand that sentence and yet who fail (...) to assent to it. I argue that, on the most natural understanding of the notion of assent when it is applied to sentences of formal mathematical languages, Williamson’s argument fails. Formal analyticity is the notion of analyticity that is based on this natural understanding of assent. I go on to develop the notion of formal analyticity and defend the claim that there are formally analytic sentences and rules of inference. I conclude by showing the potential payoffs of recognizing formal analyticity. (shrink)

The claim that nature is self-consistent has recently been contested by a number of paraconsistent logicians. In this paper I will survey the arguments which paraconsistent logicians have presented for the thesis that nature is actually inconsistent. My conclusion is that these arguments all fail.The paraconsistency programme has to date been concerned primarily with outlining the philosophical inadequacy of classical logic, and detailed discussions of issues bearing upon the philosophical adequacy of the paraconsistency position itself are not to be found (...) as yet in the literature. This inadequacy will be illustrated here with respect to the question of the self-consistency of nature. (shrink)

This is a philosophical and historical investigation of the role of inconsistent representations of the same scientific phenomenon. The logical difficulties associated with the simultaneous application of inconsistent models are discussed. Internally inconsistent scientific proposals are characterized as structures whose application is necessarily tied to the confirming evidence that each of its components enjoys and to a vision of the general form of the theory that will resolve the inconsistency. Einstein's derivation of the black body radiation law is used as (...) an example application of such a strategy and is contrasted with planck's derivation. (shrink)

Despite the volume of discussion on the Liar Paradox recently, there is one stream of largely British thought on the matter which is hardly represented in the wider literature. This paper points out salient aspects of the history of this tradition, from its origin in forms of propositional quantification found in Ramsey, through to more precise symbolisations which have emerged more recently. But its purpose is to exposit, with respect to a number of contested cases, the ensuing results. Thus it (...) goes on to apply the analysis to several other well known paradoxes, including one rarely discussed, which reveals more fully the consequent consistency and completeness of natural language. (shrink)

Francesco Berto has recently written “The Gödel Paradox and Wittgenstein's Reasons,” about a paradox first formulated by Graham Priest in 1971. The major reason for disagreeing with Berto's conclusions concerns his elucidation of Wittgenstein's understanding of Gödel's theorems. Seemingly, Wittgenstein was some kind of proto-paraconsistentist. Priest himself has also, though in a different way, tried to tar Wittgenstein with the same brush. But the resolution of other paradoxes is intimately linked with the resolution of the Gödel Paradox, and with understanding (...) Wittgenstein's views of Gödel's theorems. So this paper discusses some other paradoxes before looking at Wittgenstein's relevant views. (shrink)

Why must incompatibility be symmetric? An odd question, but recent work in the semantics of non-classical logic, which appeals to the notion of incompatibility as a primitive and defines negation in terms of it, has brought this question to the fore. Francesco Berto proposes such a semantics for negation argues that, since incompatibility must be symmetric, double negation introduction must be a law of negation. However, he offers no argument for the claim that incompatibility really must be symmetric. Here, I (...) provide such an argument, showing that, insofar as we think of incompatibility in normative pragmatic terms, it can play its basic pragmatic function only if it is symmetric. The upshot is that we can vindicate Berto’s claim about the symmetry of incompatibility but only if we, pace Berto, think about incompatibility, in the first instance, as a pragmatic relation between acts rather than a semantic relation between contents. (shrink)

In this paper I reject the normative interpretation of logic and give reasons for a realistic account based on the ontological treatment of logical values.

In Philosophical Logic, the Liar Paradox has been used to motivate the introduction of both truth value gaps and truth value gluts. Moreover, in the light of “revenge Liar” arguments, also higher-order combinations of generalized truth values have been suggested to account for so-called hyper-contradictions. In the present paper, Graham Priest's treatment of generalized truth values is scrutinized and compared with another strategy of generalizing the set of classical truth values and defining an entailment relation on the resulting sets of (...) higher-order values. This method is based on the concept of a multilattice. If the method is applied to the set of truth values of Belnap's “useful four-valued logic”, one obtains a trilattice, and, more generally, structures here called Belnap-trilattices. As in Priest's case, it is shown that the generalized truth values motivated by hyper-contradictions have no effect on the logic. Whereas Priest's construction in terms of designated truth values always results in his Logic of Paradox, the present construction in terms of truth and falsity orderings always results in First Degree Entailment. However, it is observed that applying the multilattice-approach to Priest's initial set of truth values leads to an interesting algebraic structure of a “bi-and-a-half” lattice which determines seven-valued logics different from Priest's Logic of Paradox. (shrink)

Jacques Derrida’s and Gilles Deleuze’s philosophies of justice share many similar features. For both, justice involves an overturning of law by extralegal means, made possible by an “undecidability” in the judgment-making process. To distinguish their conceptions of justice, we examine their implicit modes of non-classical reasoning with regard to “otherness,” building from Routley and Routley and Daniel Smith, to conclude that Derrida’s thinking on justice is at least paracomplete (or analetheic) while Deleuze’s is just paraconsistent (or dialetheic).

Deleuze never explicitly formulates his philosophy of logical truth‐values. It thus remains an open question as to the number and types he held there to be. Despite his explicit comments on these matters, additional textual evidence suggests that in his thinking on the event, he favored a third truth‐value, holding either the analetheic view that some truth‐bearers can be truth‐valueless or the dialetheic view that some truth‐bearers can be both true and false. I first argue that taking a logical approach (...) to Deleuze's thinking is feasible, despite his and others' claims that might suggest otherwise. Next, I examine his explicit statements to show that they cannot be taken at face value and that, rather, we need to transpose his claims into contemporary terminology in order to accurately assess them. I lastly turn to his Leibniz‐inspired philosophy of time to argue that the affirmations involved in this conception strongly suggest a dialetheic tendency in his thinking. (shrink)

This paper aims to call into question the customary division of logically revisionary responses to the truth-theoretic paradoxes into those that are “substructural” and those that are “ structural.” I proceed by examining, as a case study, Beall’s recent proposal based on the paraconsistent logic LP. Beall formulates his response to paradox in terms of a consequence relation that obeys all standard structural rules, though at the price of the language’s lacking a detaching conditional. I argue that the same response (...) to paradox can be given using a consequence relation that preserves detachment rules for a conditional, though at the price of restricting structural rules. The question “Is paradox being blocked by invoking a substructural consequence relation?” is thus ill-posed. The lesson of this example, I conclude, is that there is no useful explication of the idea of a substructural approach to paradox. (shrink)

A thriving literature has developed over logical and mathematical pluralism – i.e. the views that several rival logical and mathematical theories can be equally correct. These have unfortunately grown separate; instead, they both could gain a great deal by a closer interaction. Our aim is thus to present some novel forms of abstractionist mathematical pluralism which can be modeled on parallel ways of substantiating logical pluralism (also in connection with logical anti-exceptionalism). To do this, we start by discussing the Good (...) Company Problem for neo-logicists recently raised by Paolo Mancosu (2016), concerning the existence of rival abstractive definitions of cardinal number which are nonetheless equally able to reconstruct Peano Arithmetic. We survey Mancosu’s envisaged possible replies to this predicament, and suggest as a further path the adoption of some form of mathematical pluralism concerning abstraction principles. We then explore three possible ways of substantiating such pluralism—Conceptual Pluralism, Domain Pluralism, Pluralism about Criteria—showing how each of them can be related to analogous proposals in the philosophy of logic. We conclude by considering advantages, concerns, and theoretical ramifications for these varieties of mathematical pluralism. (shrink)

In Sect. 1 it is argued that systems of logic are exceptional, but not a priori necessary. Logics are exceptional because they can neither be demonstrated as valid nor be confirmed by observation without entering a circle, and their motivation based on intuition is unreliable. On the other hand, logics do not express a priori necessities of thinking because alternative non-classical logics have been developed. Section 2 reflects the controversies about four major kinds of non-classical logics—multi-valued, intuitionistic, paraconsistent and quantum (...) logics. Its purpose is to show that there is no particular domain or reason that demands the use of a non-classical logic; the particular reasons given for the non-classical logic can also be handled within classical logic. The result of Sect. 2 is substantiated in Sect. 3, where it is shown (referring to other work) that all four kinds of non-classical logics can be translated into classical logic in a meaning-preserving way. Based on this fact a justification of classical logic is developed in Sect. 4 that is based on its representational optimality. It is pointed out that not many but a few non-classical logics can be likewise representationally optimal. However, the situation is not symmetric: classical logic has ceteris paribus advantages as a unifying metalogic, while non-classical logics can have local simplicity advantages. (shrink)

Although there has been a recent swell of interest in theories of truth that attempt solutions to the liar paradox and the other paradoxes affecting our concept of truth, many of these theories have been criticized for generating new paradoxes, called revenge paradoxes. The criticism is that the theories of truth in question are inadequate because they only work for languages lacking in the resources to generate revenge paradoxes. Theorists facing these objections offer a range of replies, and the matter (...) seems now to be at a standoff. I aim, first, to bolster the revenge objections by considering a relation, internalizability, between languages and theories of truth. A theory of truth is internalizable for a language iff there is an extension of that language in which the theory is expressible and for which the theory provides an accurate and complete assignment of semantic values. There are good reasons to think that acceptable theories of truth are internalizable for any language. With this internalizability requirement in hand, I argue that properly formulated revenge objections are decisive and that the replies to them are inadequate. Second, I show that the internalizability requirement can be met by a certain theory of truth. The central claim of this theory is that truth is an inconsistent concept and should be replaced with a pair of consistent concepts that can then be used to provide a semantics for our truth predicates. This theory is compatible with classical logic, does not give rise to revenge paradoxes of any kind, and satisfies the internalizability requirement. (shrink)

This article examines Kevin Scharp’s formal solution to the alethic paradoxes, ADT, which stands for ascending and descending truth. One of the main supposed benefits of ADT over its competitors is that it alone can validate the uses of truth concepts in theoretical contexts, such as truth-theoretic semantics. The appendixes contain a new consistency proof for ADT, and additionally show that it is conservative. As a result of its conservativity, the article argues that ADT faces a problem in accounting for (...) certain mathematical uses of truth. Thus, Scharp’s theory needs to be amended in order to fulfill its aim of replicating all substantive uses of truth. (shrink)

In this paper a new conception of foundation-oriented epistemology is developed. The major challenge for foundation-oriented justifications consists in the problem of stopping the justificational regress without taking recourse to dogmatic assumptions or circular reasoning. Two alternative accounts that attempt to circumvent this problem, coherentism and externalism, are critically discussed and rejected as unsatisfactory. It is argued that optimality arguments are a new type of foundation-oriented justification that can stop the justificational regress. This is demonstrated on the basis of a (...) novel result in the area of induction: the optimality of meta-induction. In the final section the method of optimality justification is generalized to deductive and abductive inferences. (shrink)

In order to prove the validity of logical rules, one has to assume these rules in the metalogic. However, rule-circular ‘justifications’ are demonstrably without epistemic value. Is a non-circular justification of a logical system possible? This question attains particular importance in view of lasting controversies about classical versus non-classical logics. In this paper the question is answered positively, based on meaning-preserving translations between logical systems. It is demonstrated that major systems of non-classical logic, including multi-valued, paraconsistent, intuitionistic and quantum logics, (...) can be translated into classical logic by introducing additional intensional operators into the language. Based on this result it is argued that classical logic is representationally optimal. In sec. 6 it is investigated whether non-classical logics can be likewise representationally optimal. The answer is predominantly negative but partially positive. Nevertheless the situation is not symmetric, because classical logic has important ceteris paribus advantages as a unifying metalogic. (shrink)

Il s’agit de comprendre dans cet article l’opposition formulée par Gilles-Gaston Granger entre deux types de négation : la négation « radicale », d’un côté, et les négations « appliquées » de l’autre. Nous examinerons les propriétés de cette opposition, ainsi que les enseignements à en tirer sur la philosophie de la logique de Granger. Puis nous proposerons une théorie constructive des valeurs logiques considérées comme des objets structurés, consolidant à la fois l’unité de la théorie logique de Granger et (...) son pluralisme philosophique. (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)

An argument for the rationality of religious belief in the existence of God is defended. After reviewing three preconditions for rational belief, I show reasons to privilege the criterion of consistency. Taking the inconsistency of the religious belief in God and the belief in the scientific world picture as the impediment to a rational belief in God, I propose that we can overcome this objection by assuming, firstly, that God is a universal class. This allows us to put the problem (...) of God in set-theoretic terms, such that the antinomy that follows from such an assumption can be overcome by assuming that God is not a subject but a strict class that cannot be individuated. I conclude that that the self-contradictory nature of God does not prevent the believer from making a rational, ethical assessment that the contradiction resides in the possibility of using language to explain his existence, but that this does not make belief in the existence of God unjustifiable – on the contrary. In this way, we can say statements that claim God exists are justifiable. (shrink)

A general theory of logical oppositions is proposed by abstracting these from the Aristotelian background of quantified sentences. Opposition is a relation that goes beyond incompatibility (not being true together), and a question-answer semantics is devised to investigate the features of oppositions and opposites within a functional calculus. Finally, several theoretical problems about its applicability are considered.

In 1909, Peirce recorded in a few pages of his logic notebook some experiments with matrices for three-valued propositional logic. These notes are today recognized as one of the first attempts to create non-classical formal systems. However, besides the articles published by Turquette in the 1970s and 1980s, very little progress has been made toward a comprehensive understanding of the formal aspects of Peirce's triadic logic (as he called it). This paper aims to propose a new approach to Peirce's matrices (...) for three-valued propositional logic. We suggested that his logical matrices give rise to three different systems, one of them - which we called P3 - is an original and non-explosive logic. Besides that, we will show that the P3 system can easily be transformed into paraconsistent and paracomplete calculi, adding to it, respectively, unary operators of consistency and intuitionistic negation. We conclude with a discussion about philosophical motivations. (shrink)

Ultralogic as Universal? is a seminal text in non-classcial logic. Richard Routley presents a hugely ambitious program: to use an 'ultramodal' logic as a universal key, which opens, if rightly operated, all locks. It provides a canon for reasoning in every situation, including illogical, inconsistent and paradoxical ones, realized or not, possible or not. A universal logic, Routley argues, enables us to go where no other logic—especially not classical logic—can. Routley provides an expansive and singular vision of how a universal (...) logic might one day solve major problems in set theory, arithmetic, linguistics, physics, and more. It circulated in typescript in the late 1970s before appearing as the Appendix to Exploring Meinong's Jungle and Beyond. With engaging, forceful prose, unsparing criticism of entrenched institutions, and many tantalizing proof sketches, Ultralogic? has had a major influence on the development of paraconsistent and relevant logic. This new edition makes this work available for a modern audience, newly typeset and corrected, along with extensive notes, and new commentary essays. (shrink)

In this first volume of The Sylvan Jungle, the editors present a scholarly edition of the first chapter, "Exploring Meinong's Jungle," of Richard Routley's 1000-plus page book, Exploring Meinong's Jungle and Beyond. Going against the Quinean orthodoxy, Routley’s aim was to support Meinong’s idea that we can truthfully refer to non-existent and even impossible objects, like Superman, unicorns and the round-square cupola on Berkeley College. The tools of non-classical logic at Routley’s disposal enabled him to update Meinong’s project for a (...) new generation. This volume begins with an Introduction from Dominic Hyde, “The ‘Jungle Book’ in Context,” an essay that situates Exploring Meinong’s Jungle and Beyond historically. We provide the original Preface by Routley, followed by Chapter 1: “Exploring Meinong’s Jungle and Beyond.” In Chapter 2, Nicholas Griffin argues that Sylvan’s project was insufficiently radical with his essay, “Why the Original Theory of Items Didn’t Go Far Enough.” Sylvan revisits his position from this time in Chapter 3, with his article, “Re-Exploring Item-Theory.” Filippo Casati, who has worked in the Routley Archives then takes up the question of the future of Sylvan’s research program in his essay, “The Future Perfect of Exploring Meinong’s Jungle.” Iconic and iconoclastic Australian philosopher Richard Routley published Exploring Meinong’s Jungle and Beyond in 1980. This work has fallen out of print, yet without great fanfare it has influenced two generations of philosophers and logicians. (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)

Non‐classical logicians do not typically reject classically valid logical principles across the board. In fact, they sometimes suggest that their preferred logic recovers classical reasoning in most circumstances. This idea has come to be known in the literature as ‘classical recapture’. Recently, classical logicians have raised various doubts about it. The main problem is said to be that no rigorous explanation has been given of how is it exactly that classical logic can be recovered. The goal of the paper is (...) to address this problem. First, I discuss a number of different ways to characterize the idea of classical recapture and I examine how far it can be pushed. Secondly, I argue that a palatable form of classical recapture is given by the thought that classical logic can be retained for statements that are grounded (in Kripke’s sense). To substantiate this view I provide a formal fixed‐point semantics for a language containing a predicate standing for the concept of groundedness and I address a couple of objections that have been deployed against the claim that classical recapture can aid the non‐classical logician’s cause. (shrink)

An old and well-known objection to non-classical logics is that they are too weak; in particular, they cannot prove a number of important mathematical results. A promising strategy to deal with this objection consists in proving so-called recapture results. Roughly, these results show that classical logic can be used in mathematics and other unproblematic contexts. However, the strategy faces some potential problems. First, typical recapture results are formulated in a purely logical language, and do not generalize nicely to languages containing (...) the kind of vocabulary that usually motivates non-classical theories—for example, a language containing a naïve truth predicate. Second, proofs of recapture results typically employ classical principles that are not valid in the targeted non-classical system; hence, non-classical theorists do not seem entitled to those results. In this paper, we analyze these problems and provide solutions on behalf of non-classical theorists. To address the first problem, we provide a novel kind of recapture result, which generalizes nicely to a truth-theoretic language. As for the second problem, we argue that it relies on an ambiguity and that, once the ambiguity is removed, there are no reasons to think that non-classical logicians are not entitled to their recapture results. (shrink)

Revenge arguments purport to show that any proposed solution to the semantic paradoxes generates new paradoxes that prove that solution to be inadequate. In this paper, I focus on revenge arguments that employ the model-theoretic semantics of a target theory and I argue, contra the current revenge-theoretic wisdom, that they can constitute genuine expressive limitations. I consider the anti-revenge strategy elaborated by Field and argue that it does not offer a way out of the revenge problem. More generally, I argue (...) that the difference between ‘standard’ and ‘revenge’ paradoxes is ill-conceived and should be abandoned. This will contribute to show that the theories that provide a uniform account of truth and other semantic notions are the ones best equipped to avoid the paradoxes altogether—‘standard’ and ‘revenge’ alike. (shrink)

Thought: A Journal of Philosophy, EarlyView.

The sentences employed in semantic paradoxes display a wide range of semantic behaviours. However, the main theories of truth currently available either fail to provide a theory of paradox altogether, or can only account for some paradoxical phenomena by resorting to multiple interpretations of the language. In this paper, I explore the wide range of semantic behaviours displayed by paradoxical sentences, and I develop a unified theory of truth and paradox, that is a theory of truth that also provides a (...) unified account of paradoxical sentences. The theory I propose here yields a threefold classification of paradoxical sentences – liar-like sentences, truth-teller-like sentences, and revenge sentences. Unlike existing treatments of semantic paradox, the theory put forward in this paper yields a way of interpreting all three kinds of paradoxical sentences, as well as unparadoxical sentences, within a single model. (shrink)

The aim of this text is to reply to criticisms of the logics of evidence and truth and the epistemic approach to paraconsistency advanced by Barrio [2018], and Lo Guercio and Szmuc [2018]. We also clarify the notion of evidence that underlies the intended interpretation of these logics and is a central point of Barrio’s and Lo Guercio & Szmuc’s criticisms.

ABSTRACTA conditional is natural if it fulfils the three following conditions. It coincides with the classical conditional when restricted to the classical values T and F; it satisfies the Modus Ponens; and it is assigned a designated value whenever the value assigned to its antecedent is less than or equal to the value assigned to its consequent. The aim of this paper is to provide a ‘bivalent’ Belnap-Dunn semantics for all natural implicative expansions of Kleene's strong 3-valued matrix with two (...) designated elements. (shrink)

A classical result by Słupecki states that a logic L is functionally complete for the 3-element set of truth-values THREE if, in addition to functionally including Łukasiewicz’s 3-valued logic Ł3, what he names the ‘$T$-function’ is definable in L. By leaning upon this classical result, we prove a general theorem for defining binary expansions of Kleene’s strong logic that are functionally complete for THREE.

The present paper is a sequel to Robles et al. :349–374, 2020. https://doi.org/10.1007/s10849-019-09306-2). A class of implicative expansions of Kleene’s 3-valued logic functionally including Łukasiewicz’s logic Ł3 is defined. Several properties of this class and/or some of its subclasses are investigated. Properties contemplated include functional completeness for the 3-element set of truth-values, presence of natural conditionals, variable-sharing property and vsp-related properties.

We look at extensions (i.e., stronger logics in the same language) of the Belnap–Dunn four-valued logic. We prove the existence of a countable chain of logics that extend the Belnap–Dunn and do not coincide with any of the known extensions (Kleene’s logics, Priest’s logic of paradox). We characterise the reduced algebraic models of these new logics and prove a completeness result for the first and last element of the chain stating that both logics are determined by a single finite logical (...) matrix. We show that the last logic of the chain is not finitely axiomatisable. (shrink)

In some logics, anything whatsoever follows from a contradiction; call these logics explosive. Paraconsistent logics are logics that are not explosive. Paraconsistent logics have a long and fruitful history, and no doubt a long and fruitful future. To give some sense of the situation, I’ll spend Section 1 exploring exactly what it takes for a logic to be paraconsistent. It will emerge that there is considerable open texture to the idea. In Section 2, I’ll give some examples of techniques for (...) developing paraconsistent logics. In Section 3, I’ll discuss what seem to me to be some promising applications of certain paraconsistent logics. In fact, however, I don’t think there’s all that much to the concept ‘paraconsistent’ itself; the collection of paraconsistent logics is far too heterogenous to be very productively dealt with under a single label. Perhaps that will emerge as we go. (shrink)

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)

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.

“Paraconsistent” means “beyond the consistent” [3, 15]. Paraconsistent logics tolerate inconsistencies in a way that traditional logics do not. In a paraconsistent logic, the inference of explosion A, ∼AB is rejected. This may be for any of a number of reasons [16]. For proponents of relevance [1, 2] the argument has gone awry when we infer an irrelevant B from the inconsistent premises. Those who argue that inconsistent theories may have some logical content but do not commit us to everything, (...) have reason to think that these theories are closed under a relation of paraconsistent logical consequence [12, 18]. Another reason to adopt a paraconsistent logic is more extreme. You may take the world to be inconsistent [14], and a true theory incorporating this inconsistency must be governed by a paraconsistent logic. (shrink)

Stephen Read (2002, 2006) has recently discussed Bradwardine's theory of truth and defended it as an appropriate way to treat paradoxes such as the liar. In this paper, I discuss Read's formalisation of Bradwardine's theory of truth and provide a class of models for this theory. The models facilitate comparison of Bradwardine's theory with contemporary theories of truth.