This chapter contains sections titled: Introduction Paraconsistent Logic and Latin America Thinking about Logic The Nature of Paraconsistent Logic A History of Paraconsistent Logic Philosophical Aspects of Paraconsistent Logic References Further Reading.

This book is the first in the field of paraconsistency to offer a comprehensive overview of the subject, including connections to other logics and applications in information processing, linguistics, reasoning and argumentation, and philosophy of science. It is recommended reading for anyone interested in the question of reasoning and argumentation in the presence of contradictions, in semantics, in the paradoxes of set theory and in the puzzling properties of negation in logic programming. Paraconsistent logic comprises a major (...) logical theory and offers the broadest possible perspective on the debate of negation in logic and philosophy. It is a powerful tool for reasoning under contradictoriness as it investigates logic systems in which contradictory information does not lead to arbitrary conclusions. Reasoning under contradictions constitutes one of most important and creative achievements in contemporary logic, with deep roots in philosophical questions involving negation and consistency This book offers an invaluable introduction to a topic of central importance in logic and philosophy. It discusses the history of paraconsistent logic; language, negation, contradiction, consistency and inconsistency; logics of formal inconsistency and the main paraconsistent propositional systems; many-valued companions, possible-translations semantics and non-deterministic semantics; paraconsistent modal logics; first-order paraconsistent logics; applications to information processing, databases and quantum computation; and applications to deontic paradoxes, connections to Eastern thought and to dialogical reasoning. (shrink)

A logic is called 'paraconsistent' if it rejects the rule called 'ex contradictione quodlibet', according to which any conclusion follows from inconsistent premises. While logicians have proposed many technically developed paraconsistent logical systems and contemporary philosophers like Graham Priest have advanced the view that some contradictions can be true, and advocated a paraconsistent logic to deal with them, until recent times these systems have been little understood by philosophers. This book presents a comprehensive overview on (...) paraconsistent logical systems to change this situation. The book includes almost every major author currently working in the field. The papers are on the cutting edge of the literature some of which discuss current debates and others present important new ideas. The editors have avoided papers about technical details of paraconsistent logic, but instead concentrated upon works that discuss more 'big picture' ideas. Different treatments of paradoxes takes centre stage in many of the papers, but also there are several papers on how to interpret paraconistent logic and some on how it can be applied to philosophy of mathematics, the philosophy of language, and metaphysics. (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)

We define in precise terms the basic properties that an ‘ideal propositional paraconsistent logic’ is expected to have, and investigate the relations between them. This leads to a precise characterization of ideal propositional paraconsistent logics. We show that every three-valued paraconsistent logic which is contained in classical logic, and has a proper implication connective, is ideal. Then we show that for every n > 2 there exists an extensive family of ideal n -valued logics, (...) each one of which is not equivalent to any k -valued logic with k < n. (shrink)

In a forthcoming paper, Walter Carnielli and Abilio Rodrigues propose a Basic Logic of Evidence whose natural deduction rules are thought of as preserving evidence instead of truth. BLE turns out to be equivalent to Nelson’s paraconsistent logic N4, resulting from adding strong negation to Intuitionistic logic without Intuitionistic negation. The Carnielli/Rodrigues understanding of evidence is informal. Here we provide a formal alternative, using justification logic. First we introduce a modal logic, KX4, in which (...) \ can be read as asserting there is implicit evidence for X, where we understand evidence to permit contradictions. We show BLE embeds into KX4 in the same way that Intuitionistic logic embeds into S4. Then we formulate a new justification logic, JX4, in which the implicit evidence motivating KX4 is made explicit. KX4 embeds into JX4 via a realization theorem. Thus BLE has both implicit and explicit possibly contradictory evidence interpretations in a formal sense. (shrink)

This paper concerns the paraconsistent logic LPQ⊃,F and an application of it in the area of relational database theory. The notions of a relational database, a query applicable to a relational database, and a consistent answer to a query with respect to a possibly inconsistent relational database are considered from the perspective of this logic. This perspective enables among other things the definition of a consistent answer to a query with respect to a possibly inconsistent database without (...) resort to database repairs. In an earlier paper, LPQ⊃,F is presented with a sequent-style natural deduction proof system. In this paper, a sequent calculus proof system is presented instead because such proof systems are generally considered more suitable as the basis of proof search procedures than natural deduction proof systems and proof search procedures can serve as the core of algorithms for computing consistent answers to queries. (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)

Paraconsistent logics are logical systems that reject the classical principle, usually dubbed Explosion, that a contradiction implies everything. However, the received view about paraconsistency focuses only the inferential version of Explosion, which is concerned with formulae, thereby overlooking other possible accounts. In this paper, we propose to focus, additionally, on a meta-inferential version of Explosion, i.e. which is concerned with inferences or sequents. In doing so, we will offer a new characterization of paraconsistency by means of which a (...) class='Hi'>logic is paraconsistent if it invalidates either the inferential or the meta-inferential notion of Explosion. We show the non-triviality of this criterion by discussing a number of logics. On the one hand, logics which validate and invalidate both versions of Explosion, such as classical logic and Asenjo–Priest’s 3-valued logic LP. On the other hand, logics which validate one version of Explosion but not the other, such as the substructural logics TS and ST, introduced by Malinowski and Cobreros, Egré, Ripley and van Rooij, which are obtained via Malinowski’s and Frankowski’s q- and p-matrices, respectively. (shrink)

The terms “model” and “model-building” have been used to characterize the field of formal philosophy, to evaluate philosophy’s and philosophical logic’s progress and to define philosophical logic itself. A model is an idealization, in the sense of being a deliberate simplification of something relatively complex in which several important aspects are left aside, but also in the sense of being a view too perfect or excellent, not found in reality, of this thing. Paraconsistent logic is a (...) branch of philosophical logic. It is however not clear how paraconsistent logic can be seen as model-building. What exactly is modeled? In this paper I adopt the perspective of looking at a particular instance of paraconsistent logic—paranormal modal logic—which might be seen as a model of a specific kind of agent: inductive agents. After ntroducing what I call the highlevel and low-level models of inductive agents, I analyze the extent to which the above-mentioned idealizing features of model-building appear in paranormal modal logic and how they affect its philosophical significance. (shrink)

As is known, a logic S is paraconsistent if the rule ECQ (E contradictione quodlibet) is not a rule of S. Not less well known is the fact that Lewis’ modal logics are not paraconsistent. Actually, Lewis vindicates the validity of ECQ in a famous proof currently known as the “Lewis’ proof” or “Lewis’ argument.” This proof essentially leans on the Disjunctive Syllogism as a rule of inference. The aim of this paper is to define a series (...) of paraconsistent logics included in S4 where the Disjunctive Syllogism is valid only as a rule of proof. (shrink)

This paper begins an analysis of the real line using an inconsistency-tolerant (paraconsistent) logic. We show that basic field and compactness properties hold, by way of novel proofs that make no use of consistency-reliant inferences; some techniques from constructive analysis are used instead. While no inconsistencies are found in the algebraic operations on the real number field, prospects for other non-trivializing contradictions are left open.

Physical superpositions exist both in classical and in quantum physics. However, what is exactly meant by ‘superposition’ in each case is extremely different. In this paper we discuss some of the multiple interpretations which exist in the literature regarding superpositions in quantum mechanics. We argue that all these interpretations have something in common: they all attempt to avoid ‘contradiction’. We argue in this paper, in favor of the importance of developing a new interpretation of superpositions which takes into account contradiction, (...) as a key element of the formal structure of the theory, “right from the start”. In order to show the feasibility of our interpretational project we present an outline of a paraconsistent approach to quantum superpositions which attempts to account for the contradictory properties present in general within quantum superpositions. This approach must not be understood as a closed formal and conceptual scheme but rather as a first step towards a different type of understanding regarding quantum superpositions. (shrink)

We present a paraconsistent logic, called Z, based on an intuitive possible worlds semantics, in which the replacement theorem holds. We show how to axiomatize this logic and prove the completeness theorem.

In 1999, da Silva, D'Ottaviano and Sette proposed a general definition for the term translation between logics and presented an initial segment of its theory. Logics are characterized, in the most general sense, as sets with consequence relations and translations between logics as consequence-relation preserving maps. In a previous paper the authors introduced the concept of conservative translation between logics and studied some general properties of the co-complete category constituted by logics and conservative translations between them. In this paper we (...) present some conservative translations involving classical logic, Lukasiewicz three-valued system L3, the intuitionistic system I1 and several paraconsistent logics, as for instance Sette's system P1, the D'Ottaviano and da Costa system J3 and da Costa's systems Cn, 1≤ n≤ω. (shrink)

The aim of this paper is to show that Graham Priest's dialetheic account of semantic paradoxes and the paraconsistent logics employed cannot achieve semantic universality. Dialetheism therefore fails as a solution to semantic paradoxes for the same reason that consistent approaches did. It will be demonstrated that if dialetheism can express its own semantic principles, a strengthened liar paradox will result, which renders dialetheism trivial. In particular, the argument is not invalidated by relational valuations, which were brought into (...) class='Hi'>paraconsistent logic in order to avoid strengthened liar paradoxes. (shrink)

The book Paraconsistent Logic: Consistency, Contradiction and Negation by Walter Carnielli and Marcelo Coniglio is the most thorough study of Logics of Formal Inconsistency...

. A paraconsistent logic is a logical system that attempts to deal with contradictions in a discriminating way. In an earlier paper [Notre Dame J. Form. Log. 49, 401–424], we developed the systems of weakening of intuitionistic negation logic, called and, in the spirit of da Costa's approach by preserving, differently from da Costa, the fundamental properties of negation: antitonicity, inversion and additivity for distributive lattices. Taking into account these results, we make some observations on the modified (...) systems of and, and their paraconsistent properties. (shrink)

Paraconsistent logic is the study of logics in which there are some theories embodying contradictions but which are not trivial, in particular in a paraconsistent logic, the ex contradictione sequitur quod libet, which can be formalized as Cn(T, a,¬a)=F is not valid. Since nearly half a century various systems of paraconsistent logic have been proposed and studied. This field of research is classified under a special section (B53) in the Mathematical Reviews and watching this (...) section, it is possible to see that the number of papers devoted to paraconsistent logic is each time greater and has recently increased due in particular to its applications to computer sciences (see e.g. Blair and Subrahmanian. (shrink)

Paraconsistent logics may be viewed as one of the last elementsin a series of rapid developments in science in the 19th and early 20th c.,triggered by the appearance of non-Euclidean geometries. The philosophyof conventionalism, which gave a metatheoretical framework to the basicchanges involved, may also help in evaluating the truth import of logic and in determining its relation to ontology.

This paper briefly outlines some advancements in paraconsistent logics for modelling knowledge representation and reasoning. Emphasis is given on the so-called Logics of Formal Inconsistency (LFIs), a class of paraconsistent logics that formally internalize the very concept(s) of consistency and inconsistency. A couple of specialized systems based on the LFIs will be reviewed, including belief revision and probabilistic reasoning. Potential applications of those systems in the AI area of KRR are tackled by illustrating some examples that emphasizes the (...) importance of a fine-tuned treatment of consistency in modelling reputation systems, preferences, argumentation, and evidence. (shrink)

ABSTRACT The concept of paraconsistent logical consequence is usually negatively defined as a validity semantics in which not every sentences is deducible or in which inferential explosion does not occur. Paraconsistency has been negatively characterized in this way because paraconsistent logics have been designed specifically to avoid the trivialization of deductive inference entailed by the classical paradoxes of material implication for applications in a system that tolerates syntactical contradictions. The effect of the negative characterization of paraconsistency has been (...) to encourage an unsystematic development of distinct versions of paraconsistent logic. It has also contributed to a restricted overview of the full range of paraconsistent formalisms. After reviewing a standard negative characterization of paraconsistency and commenting on its limitations, I propose a positive characterization that makes possible a constructivistic description of the complete spectrum of distinct families of paraconsistent logics, and the description of a new type of maximally relevant paraconsistency, which I argue compares favorably with previously identified categories of paraconsistent logics. (shrink)

For several years I have been developing a general theory of logics that I have called Universal Logic. In this article I will try to describe how I was led to this theory and how I have progressively conceived it, starting my researches about ten years ago in Paris in paraconsistent logic and the broadening my horizons, pursuing my researches in Brazil, Poland and the USA.

"The best known approaches to "reasoning with inconsistent data" require a logical framework which is decidedly non-classical. An alternative is presented here, beginning with some motivation which has been surprised in the work of C.I. Lewis, which does not require ripping great swatches from the fabric of classical logic. In effect, the position taken in this essay is representative of an approach in which one assumes the correctness of classical methods excepting only the cases in which the premise set (...) is inconsistent. (shrink)

In this paper the propositional logic LTop is introduced, as an extension of classical propositional logic by adding a paraconsistent negation. This logic has a very natural interpretation in terms of topological models. The logic LTop is nothing more than an alternative presentation of modal logic S4, but in the language of a paraconsistent logic. Moreover, LTop is a logic of formal inconsistency in which the consistency and inconsistency operators have a (...) nice topological interpretation. This constitutes a new proof of S4 as being "the logic of topological spaces", but now under the perspective of paraconsistency. (shrink)

The present book discusses all aspects of paraconsistent logic, including the latest findings, and its various systems. It includes papers by leading international researchers, which address the subject in many different ways: development of abstract paraconsistent systems and new theorems about them; studies of the connections between these systems and other non-classical logics, such as non-monotonic, many-valued, relevant, paracomplete and fuzzy logics; philosophical interpretations of these constructions; and applications to other sciences, in particular quantum physics and mathematics. (...) Reasoning with contradictions is the challenge of paraconsistent logic. The book will be of interest to graduate students and researchers working in mathematical logic, computer science, philosophical logic, linguistics and physics. (shrink)

We answer Slater's argument according to which paraconsistent logic is a result of a verbal confusion between «contradictories» and «subcontraries». We show that if such notions are understood within classical logic, the argument is invalid, due to the fact that most paraconsistent logics cannot be translated into classical logic. However we prove that if such notions are understood from the point of view of a particular logic, a contradictory forming function in this logic (...) is necessarily a classical negation. In view of this result, Slater's argument sounds rather tautological. (shrink)

Normally, we would accuse anyone who holds inconsistent beliefs of irrationality. However, Keenan apologists may claim that in some circumstances it does seem perfectly rational to hold inconsistent beliefs. And we are not alone in this assertion. A small band of philosophers, led most notably by Graham Priest, have also championed this cause, the cause of paraconsistency.

Normally, we would accuse anyone who holds inconsistent beliefs of irrationality. However, Keenan apologists may claim that in some circumstances it does seem perfectly rational to hold inconsistent beliefs. And we are not alone in this assertion. A small band of philosophers, led most notably by Graham Priest, have also championed this cause, the cause of paraconsistency.

In 1999, da Silva, D'Ottaviano and Sette proposed a general definition for the term translation between logics and presented an initial segment of its theory. Logics are characterized, in the most general sense, as sets with consequence relations and translations between logics as consequence-relation preserving maps. In a previous paper the authors introduced the concept of conservative translation between logics and studied some general properties of the co-complete category constituted by logics and conservative translations between them. In this paper we (...) present some conservative translations involving classical logic, Lukasiewicz three-valued system L₃, the intuitionistic system Iⁱ and several para-consistent logics, as for instance Sette's system Pⁱ, the D'Ottaviano and da Costa system J₃ and da Costa's systems $\text{C}_{n}$ , 1 ≤ n ≤ ω. (shrink)

Does there exist any equivalence between the notions of inconsistency and consequence in paraconsistent logics as is present in the classical two valued logic? This is the key issue of this paper. Starting with a language where negation ( ${\neg}$ ) is the only connective, two sets of axioms for consequence and inconsistency of paraconsistent logics are presented. During this study two points have come out. The first one is that the notion of inconsistency of paraconsistent (...) logics turns out to be a formula-dependent notion and the second one is that the characterization (i.e. equivalence) appears to be pertinent to a class of paraconsistent logics which have double negation property. (shrink)

The object of this paper is to show how one is able to construct a paraconsistent theory of models that reflects much of the classical one. In other words the aim is to demonstrate that there is a very smooth and natural transition from the model theory of classical logic to that of certain categories of paraconsistent logic. To this end we take an extension of da Costa''sC 1 = (obtained by adding the axiom A A) (...) and prove for it results which correspond to many major classical model theories, taken from Shoenfield [5]. In particular we prove counterparts of the theorems of o-Tarski and Chang-o-Suszko, Craig-Robinson and the Beth definability theorem. (shrink)

I prove that the three basic propositions of Vasiliev's paraconsistent logic have a semantic interpretation by means of the intuitionist logic. The interpèretation is confirmed by amens of the da Costa's model of Vasiliev's paraconsistent logic.

Paraconsistent logic, logic in which inconsistent information does not deliver arbitrary conclusions, is one of the fastest growing areas of logic, with roots in profound philosophical issues, and applications in information processing and philosophy of science. This book contains selected papers presented at the First World Congress on Paraconsistency, held in Ghent in 1997. It contains papers on various aspects of the subject. As such, it should be of interest to all who want to learn what (...) the subject is, and where it is going. (shrink)

Two new first-order paraconsistent logics with De Morgan-type negations and co-implication, called symmetric paraconsistent logic (SPL) and dual paraconsistent logic (DPL), are introduced as Gentzen-type sequent calculi. The logic SPL is symmetric in the sense that the rule of contraposition is admissible in cut-free SPL. By using this symmetry property, a simpler cut-free sequent calculus for SPL is obtained. The logic DPL is not symmetric, but it has the duality principle. Simple semantics for (...) SPL and DPL are introduced, and the completeness theorems with respect to these semantics are proved. The cut-elimination theorems for SPL and DPL are proved in two ways: One is a syntactical way which is based on the embedding theorems of SPL and DPL into Gentzen’s LK, and the other is a semantical way which is based on the completeness theorems. (shrink)