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.

The purpose of this paper is mainly to give a model of paraconsistentlogic satisfying the "Frege comprehension scheme" in which we can develop standard set theory (and even much more as we shall see). This is the continuation of the work of Hinnion and Libert.

In this paper we give axiom systems for classical and intuitionistic hybrid logic. Our axiom systems can be extended with additional rules corresponding to conditions on the accessibility relation expressed by so-called geometric theories. In the classical case other axiomatisations than ours can be found in the literature but in the intuitionistic case no axiomatisations have been published. We consider plain intuitionistic hybrid logic as well as a hybridized version of the constructive and paraconsistentlogic N4.

The variety of N4? -lattices provides an algebraic semantics for the logic N4?, a version of Nelson's logic combining paraconsistent strong negation and explosive intuitionistic negation. In this paper we construct the Priestley duality for the category of N4?-lattices and their homomorphisms. The obtained duality naturally extends the Priestley duality for Nelson algebras constructed by R. Cignoli and A. Sendlewski.

Paraconsistent logics are characterized by rejection of ex falso quodlibet, the principle of explosion, which states that from a contradiction, anything can be derived. Strikingly these logics have found a wide range of application, despite the misgivings of philosophers as prominent as Lewis and Putnam. Such applications, I will argue, are of significant philosophical interest. They suggest ways to employ these logics in philosophical and scientific theories. To this end I will sketch out a ‘naturalized semantic dialetheism’ following Priest’s (...) early suggestion that the principles governing human natural language may well be inconsistent. There will be a significant deviation from Priest’s work, namely, the assumption of a broadly Chomskyan picture of semantics. This allows us to explain natural language inconsistency tolerance without commitment to contentious views in formal logic. (shrink)

We present a paraconsistentlogic, 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.

A new technique for proving realisability results is presented, and is illustrated in detail for the simple case of arithmetic minus induction. CL is a Gentzen formulation of classical logic. CPQ is CL minus the Cut Rule. The basic proof theory and model theory of CPQ and CL is developed. For the semantics presented CPQ is a paraconsistentlogic, i.e. there are non-trivial CPQ models in which some sentences are both true and false. Two systems of arithmetic (...) minus induction are introduced, CL-A and CPQ-A based on CL and CPQ, respectively. The realisability theorem for CPQ-A is proved: It is shown constructively that to each theorem A of CPQ-A there is a formula A *, a so-called “realised disjunctive form of A ”, such that variables bound by essentially existential quantifiers in A * can be written as recursive functions of free variables and variables bound by essentially universal quantifiers. Realisability is then applied to prove the consistency of CL-A, making use of certain finite non-trivial inconsistent models of CPQ-A. (shrink)

As it was proved in [4, Sect. 3], the poset of extensions of the propositional logic defined by a class of logical matrices with equationally-definable set of distinguished values is a retract, under a Galois connection, of the poset of subprevarieties of the prevariety generated by the class of the underlying algebras of the defining matrices. In the present paper we apply this general result to the three-valued paraconsistentlogic proposed by Hałkowska–Zajac [2]. Studying corresponding prevarieties, we (...) prove that extensions of the logic involved form a four-element chain, the only proper consistent extensions being the least non-paraconsistent extension of it and the classical logic. RID=""ID="" Mathematics Subject Classification (2000): 03B50, 03B53, 03G10 RID=""ID="" Key words or phrases: Many-valued logic – Paraconsistentlogic – Extension – Prevariety – Distributive lattice. (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'>paraconsistentlogic in order to avoid strengthened liar paradoxes. (shrink)

In this paper we make some general remarks on the use of non-classical logics, in particular paraconsistentlogic, in the foundational analysis of physical theories. As a case-study, we present a reconstruction of P.\ -D.\ F\'evrier's 'logic of complementarity' as a strict three-valued logic and also a paraconsistent version of it. At the end, we sketch our own approach to complementarity, which is based on a paraconsistentlogic termed 'paraclassical logic'.

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

Paraconsistentlogic is the study of logics in which there are some theories embodying contradictions but which are not trivial, in particular in a paraconsistentlogic, 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 paraconsistentlogic 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 paraconsistentlogic is each time greater and has recently increased due in particular to its applications to computer sciences (see e.g. Blair and Subrahmanian. (shrink)

A proof method for automation of reasoning in a paraconsistentlogic, the calculus C1* of da Costa, is presented. The method is analytical, using a specially designed tableau system. Actually two tableau systems were created. A first one, with a small number of rules in order to be mathematically convenient, is used to prove the soundness and the completeness of the method. The other one, which is equivalent to the former, is a system of derived rules designed to (...) enhance computational efficiency. A prototype based on this second system was effectively implemented. (shrink)

The origin of ParaconsistentLogic is closely related with the argument that from the assertion of two mutually contradictory statements any other statement can be deduced, which can be referred to as ex contradict!one sequitur quodlibet (ECSQ). Despite its medieval origin, only in the 1930s did it become the main reason for the unfeasibility of having contradictions in a deductive system. The purpose of this paper is to study what happened before: from Principia Mathematica to that time, when (...) it became well established. The main historical claims that I am going to advance are the following: the first explicit use of ECSQ as the main argument for supporting the necessity of excluding any contradiction from deductive systems is to be found in the first edition (1928) of the book Grundzüge der theoretischen Logik by Hilbert and Ackermann. At the end, I will suggest that the aim of the 20th century usage of ECSQ was to change from the centuries long philosophical discussion about contradictions to a more "technical" one. But with ParaconsistentLogic viewed as a technical solution to this restriction, the philosophical problem revives, but now with an improved understanding of it at one's disposal. (shrink)

Bohr’s atomic model is one of the better known examples of empirically successful, albeit inconsistent, theoretical schemes in the history of physics. For this reason, many philosophers use this model to illustrate their position for the occurrence and the function of inconsistency in science. In this paper, I proceed to a critical comparison of the structure and the aims of Bohr’s research program – the starting point of which was the formulation of his model – with some of its contemporary (...) philosophical readings. My study comes to conclude that the attempt of certain philosophers to accommodate Bohr’s model to a form of paraconsistentlogic obliterates essential aspects of scientists' actual practice and reasoning. (shrink)

One of the most important paraconsistent logics is the logic mCi, which is one of the two basic logics of formal inconsistency. In this paper we present a 5-valued characteristic nondeterministic matrix for mCi. This provides a quite non-trivial example for the utility and eﬀectiveness of the use of non-deterministic many-valued semantics.

The aim of this paper is to study the paraconsistent deductive systemP 1 within the context of Algebraic Logic. It is well known due to Lewin, Mikenberg and Schwarse thatP 1 is algebraizable in the sense of Blok and Pigozzi, the quasivariety generated by Sette's three-element algebraS being the unique quasivariety semantics forP 1. In the present paper we prove that the mentioned quasivariety is not a variety by showing that the variety generated byS is not equivalent to (...) any algebraizable deductive system. We also show thatP 1 has no algebraic semantics in the sense of Czelakowski. Among other results, we study the variety generated by the algebraS. This enables us to prove in a purely algebraic way that the only proper non-trivial axiomatic extension ofP 1 is the classical deductive systemPC. Throughout the paper we also study those abstract logics which are in a way similar toP 1, and are called hereabstract Sette logics. We obtain for them results similar to those obtained for distributive abstract logics by Font, Verdú and the author. (shrink)

The article is devoted to the systematic study of the lattice εN4⊥ consisting of logics extending N4⊥. The logic N4⊥ is obtained from paraconsistentNelsonlogic N4 by adding the new constant ⊥ and axioms ⊥ → p, p → ∼ ⊥. We study interrelations between εN4⊥ and the lattice of superintuitionistic logics. Distinguish in εN4⊥ basic subclasses of explosive logics, normal logics, logics of general form and study how they are relate.

Routley–Meyer semantics (RM-semantics) is defined for Gödel 3-valued logic G3 and some logics related to it among which a paraconsistent one differing only from G3 in the interpretation of negation is to be remarked. The logics are defined in the Hilbert-style way and also by means of proof-theoretical and semantical consequence relations. The RM-semantics is defined upon the models for Routley and Meyer’s basic positive logic B+, the weakest positive RM-semantics. In this way, it is to be (...) expected that the models defined can be adapted to other related many-valued logics. (shrink)

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)

B. H. Slater has argued that there cannot be any truly paraconsistent logics, because it's always more plausible to suppose whatever "negation" symbol is used in the language is not a real negation, than to accept the paraconsistent reading. In this paper I neither endorse nor dispute Slater's argument concerning negation; instead, my aim is to show that as an argument against paraconsistency, it misses (some of) the target. A important class of paraconsistent logics - the preservationist (...) logics - are not subject to this objection. In addition I show that if we identify logics by means of consequence relations, at least one dialetheic logic can be reinterpreted in preservationist (non-dialetheic) terms. Thus the interest of paraconsistent consequence relations - even those that emerge from dialetheic approaches - does not depend on the tenability of dialetheism. Of course, if dialetheism is defensible, then paraconsistentlogic will be required to cope with it. But the existence (and interest) of paraconsistent logics does not depend on a defense of dialetheism. (shrink)

Two new first-order paraconsistent logics with De Morgan-type negations and co-implication, called symmetric paraconsistentlogic (SPL) and dual paraconsistentlogic (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)

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

Consequence rleations over sets of "judgments" are defined by using "overdetermined" as well as "underdetermined" valuations. Some of these relations are shown to be categorical. And generalized soundness and completeness results are given for both multiple and single conclusion consequence relations.

particular alternative logic could be relevant to another one? The most important part of a response to this question is to remind the reader of the fact that independence friendly (IF) logic is not an alternative or “nonclassical” logic. (See here especially Hintikka, “There is only one logic”, forthcoming.) It is not calculated to capture some particular kind of reasoning that cannot be handled in the “classical” logic that should rather be called the received or (...) conventional logic. No particular epithet should be applied to it. IF logic is not an alternative to our generally used basic logic, the received first-order logic, aka quantification theory or predicate calculus. It replaces this basic logic in that it is identical with this “classical” first-order logic except that certain important flaws of the received first-order logic have been corrected. But what are those flaws and how can they be corrected? To answer these questions is to explain the basic ideas of IF logic. Since this logic is not as well known as it should be, such explanation is needed in any case. I will provide three different but not unrelated motivations for IF logic. (shrink)

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

I am honoured with and touched by the invitation of delivering the opening address of this Congress. Firstly, to see paraconsistentlogic flourishing and growing, as we can readily see by simply glacing over the programme of this conference, is among one of my greatest joys. Secondly, and equally important, because this congress takes place in the University of Toruń.I am honoured for having lectured here, a most congenial and stimulating place, and could not think of a better (...) place for a conference dedicated to the memory of Stanisław Jaśkowski. In particular, I am delighted for having had a correspondence with him, and although I was deprived of the pleasure of meeting him personally, I was fortunate enough for having collaborated with some of his disciples, such as L. Dubikajtis and T. Kotas. All and all, Toruń in particular and Poland in general are for me a second home, for all the kindness and care everyone has shown to me over several years, since my very first visit to this country. (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)

This paper is an attempt to show that the subvaluation theory isnot a good theory of vagueness. It begins with a short review of supervaluation and subvaluation theories and procedes to evaluate the subvaluation theory. Subvaluationism shares all the main short-comings of supervaluationism.Moreover, the solution to the sorites paradox proposed by subvaluationists isnot satisfactory. There is another solution which subvaluationists could availthemselves of, but it destroys the whole motivation for using a paraconsistentlogic and is not diﬀerent from the one oﬀered (...) by supervaluationism. (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.

ABSTRACT In this work we argue for relevant logics as a basis for paraconsistent epistemic logics. In order to do so, a paraconsistent nonmonotonic multi-agent epistemic logic, MDR (for Modal Defeasible Relevant), is briefly introduced. In MDR each agent has two kinds of belief: an absolute belief that P, represented by AiP, and a defeasible belief that P, represented by DiP. Therefore, an agent can reason with his own absolute and defeasible beliefs about the world and also (...) reason about his beliefs about other agents' beliefs both absolute and defeasible. A theorem is presented showing some patterns of reasoning in MDR. Avron's relevant logic RMI? s compared proof theoretically with Anderson and Belnap's relevant logics R and RM and also with Da Costa's paraconsistentlogic CI, with respect to some desired properties of absolute and defeasible beliefs. Then we can understand why RMI was chosen to be the underlying logic for the monotonie part (the absolute beliefs) of MDR, and had to be modified and integrated with a nonmonotonic logic in order to be the underlying logic for the nonmonotonic part (defeasible beliefs). (shrink)

The paper discusses which modal principles should hold for a truth operator answering to the truth theory of internal realism. It turns out that the logic of truth in internal realism is isomorphic to the modal system S4.