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)

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)

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)

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)

In this paper we present an overview, with historical and critical remarks, of two articles by S. Jaśkowski ([20, 21] 1948 and [22, 23] 1949), which contain the oldest known formulation of a paraconsistent logic. Jaśkowski has built the logic – he termed discussive (D2) – by defining two new connectives and by introducing a modal translation map from D2 systems into Lewis’ modal logic S5. Discussive systems, for their formal details and their original philosophical justification, (...) have attracted discrete attention among experts. Indeed, in what follows, after having introduced Jaśkowski methodology of building D2 and his main philosophical motivations for providing such a system, we will explore some of the main contributions to the development of D2. (shrink)

Max Cresswell and Hilary Putnam seem to hold the view, often shared by classical logicians, that paraconsistent logic has not been made sense of, despite its well-developed mathematics. In this paper, I examine the nature of logic in order to understand what it means to make sense of logic. I then show that, just as one can make sense of non-normal modal logics (as Cresswell demonstrates), we can make `sense' of paraconsistent logic. Finally, I (...) turn the tables on classical logicians and ask what sense can be made of explosive reasoning. While I acknowledge a bias on this issue, it is not clear that even classical logicians can answer this question. (shrink)

In this paper we consider the theory of predicate logics in which the principle of Bivalence or the principle of Non-Contradiction or both fail. Such logics are partial or paraconsistent or both. We consider sequent calculi for these logics and prove Model Existence. For L4, the most general logic under consideration, we also prove a version of the Craig-Lyndon Interpolation Theorem. The paper shows that many techniques used for classical predicate logic generalise to partial and paraconsistent (...) logics once the right set-up is chosen. Our logic L4 has a semantics that also underlies Belnap’s [4] and is related to the logic of bilattices. L4 is in focus most of the time, but it is also shown how results obtained for L4 can be transferred to several variants. (shrink)

The main research goal of the work is to study the notion of co-topos, its correctness, properties and relations with toposes. In particular, the dualization process proposed by proponents of co-toposes has been analyzed, which transforms certain Heyting algebras of toposes into co-Heyting ones, by which a kind of paraconsistent logic may appear in place of intuitionistic logic. It has been shown that if certain two definitions of topos are to be equivalent, then in one of them, (...) in the context of a subobject classifier, there should be a neutral label for the generic subobject, or if the label "true" appears instead, it carries no additional properties or assumptions. It has been shown that a natural isomorphism occurring in one of the definitions of topos need not be an isomorphism of the corresponding algebraic structures on the sets, so that a co-Heyting algebraic structure can be defined on the set of characteristic morphisms, which moreover will also be natural. The analyzes suggest that the notion of co-topos may be considered correct. However, it should be strongly emphasized that although the possibility of defining the notion of co-topos has been shown, its further full consequences should be very carefully examined, which can severely limit its logical applications. (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)

In a recent work, Walter Carnielli and Abilio Rodrigues present an epistemically motivated interpretation of paraconsistent logic. In their view, when there is conflicting evidence with regard to a proposition A (i.e. when there is both evidence in favor of A and evidence in favor of ￢A) both A and ￢A should be accepted without thereby accepting any proposition B whatsoever. Hence, reasoning within their system intends to mirror, and thus, should be constrained by, the way in which (...) we reason about evidence. In this article we will thoroughly discuss their position and suggest some ways in which this project can be further developed. The aim of the paper is twofold. On the one hand, we will present some philosophical critiques to the specific epistemic interpretation of paraconsistent logic proposed by Carnielli & Rodrigues. First, we will contend that Carnielli & Rodrigues’s interpretation implies a thesis about what evidence rationally justifies to accept or believe, called Extreme Permissivism, which is controversial among epistemologists. Second, we will argue that what agents should do, from an epistemic point of view, when faced with conflicting evidence, is to suspend judgment. On the other hand, despite these criticisms we do not believe that the epistemological motivation put forward by Carnielli & Rodrigues is entirely wrong. In the last section, we offer an alternative way in which one might account for the epistemic rationality of accepting contradictions and, thus, for an epistemic understanding of paraconsistency, which leads us to discuss the notion of diachronic epistemic rationality. (shrink)

In this article, we will present a number of technical results concerning Classical Logic, ST and related systems. Our main contribution consists in offering a novel identity criterion for logics in general and, therefore, for Classical Logic. In particular, we will firstly generalize the ST phenomenon, thereby obtaining a recursively defined hierarchy of strict-tolerant systems. Secondly, we will prove that the logics in this hierarchy are progressively more classical, although not entirely classical. We will claim that a (...) class='Hi'>logic is to be identified with an infinite sequence of consequence relations holding between increasingly complex relata: formulae, inferences, metainferences, and so on. As a result, the present proposal allows not only to differentiate Classical Logic from ST, but also from other systems sharing with it their valid metainferences. Finally, we show how these results have interesting consequences for some topics in the philosophical logic literature, among them for the debate around Logical Pluralism. The reason being that the discussion concerning this topic is usually carried out employing a rivalry criterion for logics that will need to be modified in light of the present investigation, according to which two logics can be non-identical even if they share the same valid inferences. (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.

Review of the book "Paraconsistent Logic: Consistency, Contradiction, and Negation by Water Carnielli and Marcelo Coniglio.

In 2016 Beziau, introduce a more restricted concept of paraconsistency, namely the genuine paraconsistency. He calls genuine paraconsistent logic those logic rejecting φ, ¬φ |- ψ and |- ¬(φ ∧ ¬φ). In that paper the author analyzes, among the three-valued logics, which of these logics satisfy this property. If we consider multiple-conclusion consequence relations, the dual properties of those above mentioned are: |- φ, ¬φ, and ¬(ψ ∨ ¬ψ) |- . We call genuine paracomplete logics those rejecting (...) the mentioned properties. We present here an analysis of the three-valued genuine paracomplete logics. (shrink)

We introduce a modal expansion of paraconsistent Nelson logic that is also as a generalization of the Belnapian modal logic recently introduced by Odintsov and Wansing. We prove algebraic completeness theorems for both logics, defining and axiomatizing the corresponding algebraic semantics. We provide a representation for these algebras in terms of twiststructures, generalizing a known result on the representation of the algebraic counterpart of paraconsistent Nelson logic.

It has been an open question whether or not we can define a belief revision operation that is distinct from simple belief expansion using paraconsistent logic. In this paper, we investigate the possibility of meeting the challenge of defining a belief revision operation using the resources made available by the study of dynamic epistemic logic in the presence of paraconsistent logic. We will show that it is possible to define dynamic operations of belief revision in (...) a paraconsistent setting. (shrink)

In this paper paraconsistent first-order logic LP^{#} with infinite hierarchy levels of contradiction is proposed. Corresponding paraconsistent set theory KSth^{#} is discussed.Axiomatical system HST^{#}as paraconsistent generalization of Hrbacek set theory HST is considered.

In this paper we present a philosophical motivation for the logics of formal inconsistency, a family of paraconsistent logics whose distinctive feature is that of having resources for expressing the notion of consistency within the object language in such a way that consistency may be logically independent of non- contradiction. We defend the view according to which logics of formal inconsistency may be interpreted as theories of logical consequence of an epistemological character. We also argue that in order to (...) philosophically justify paraconsistency there is no need to endorse dialetheism, the thesis that there are true contradictions. Furthermore, we argue that an intuitive reading of the bivalued semantics for the logic mbC, a logic of formal inconsistency based on classical logic, fits in well with the basic ideas of an intuitive interpretation of contradictions. On this interpretation, the acceptance of a pair of propositions A and ¬A does not mean that A is simultaneously true and false, but rather that there is conflicting evidence about the truth value of A. (shrink)

Paraconsistency is the study of logical systems with a non-explosive negation such that a pair of contradictory formulas (with respect to such negation) does not necessarily imply triviality, discordant to what would be expected by contemporary logical orthodoxy. From a purely logical point of view, the significance of paraconsistency relies on the meticulous distinction between the general notions of contradictoriness and triviality of a theory—respectively, the fact that a given theory proves a proposition and its negation, and the fact that (...) a given theory proves any proposition (in the language of its underlying logic). Aside from this simple rationale, the formal techniques and approaches that meet the latter definitional requirement are manifold. Furthermore, it is not solely the logical-mathematical properties of such systems that are open to debate. Rather, there are several foundational and philosophical questions worth studying, including the very question about the nature of the contradictions allowed by paraconsistentists. This entry aims to advance a brief account of some distinct approaches to paraconsistency, providing a panorama on the development of paraconsistent logic. (shrink)

In this paper, the notion of degree of inconsistency is introduced as a tool to evaluate the sensitivity of the Full Bayesian Significance Test (FBST) value of evidence with respect to changes in the prior or reference density. For that, both the definition of the FBST, a possibilistic approach to hypothesis testing based on Bayesian probability procedures, and the use of bilattice structures, as introduced by Ginsberg and Fitting, in paraconsistent logics, are reviewed. The computational and theoretical advantages of (...) using the proposed degree of inconsistency based sensitivity evaluation as an alternative to traditional statistical power analysis is also discussed. (shrink)

This paper extends Fitting's epistemic interpretation of some Kleene logics, to also account for Paraconsistent Weak Kleene logic. To achieve this goal, a dualization of Fitting's "cut-down" operator is discussed, rendering a "track-down" operator later used to represent the idea that no consistent opinion can arise from a set including an inconsistent opinion. It is shown that, if some reasonable assumptions are made, the truth-functions of Paraconsistent Weak Kleene coincide with certain operations defined in this track-down fashion. (...) Finally, further reflections on conjunction and disjunction in the weak Kleene logics accompany this paper, particularly concerning their relation with containment logics. These considerations motivate a special approach to defining sound and complete Gentzen-style sequent calculi for some of their four-valued generalizations. (shrink)

In this paper two systems of AGM-like Paraconsistent Belief Revision are overviewed, both defined over Logics of Formal Inconsistency (LFIs) due to the possibility of defining a formal consistency operator within these logics. The AGM° system is strongly based on this operator and internalize the notion of formal consistency in the explicit constructions and postulates. Alternatively, the AGMp system uses the AGM-compliance of LFIs and thus assumes a wider notion of paraconsistency - not necessarily related to the notion of (...) formal consistency. (shrink)

There was a time when 'logic' just meant classical logic. The climate is slowly changing and non-classical logic cannot be dismissed off-hand. However, a metatheory used to study the properties of non-classical logic is often classical. In this paper, we will argue that this practice of relying on classical metatheories is problematic. In particular, we will show that it is a bad practice because the metatheory that is used to study a non-classical logic often rules (...) out the very logic it is designed to study. (shrink)

Two systems of belief change based on paraconsistent logics are introduced in this article by means of AGM-like postulates. The first one, AGMp, is defined over any paraconsistent logic which extends classical logic such that the law of excluded middle holds w.r.t. the paraconsistent negation. The second one, AGMo , is specifically designed for paraconsistent logics known as Logics of Formal Inconsistency (LFIs), which have a formal consistency operator that allows to recover all the (...) classical inferences. Besides the three usual operations over belief sets, namely expansion, contraction and revision (which is obtained from contraction by the Levi identity), the underlying paraconsistent logic allows us to define additional operations involving (non-explosive) contradictions. Thus, it is defined external revision (which is obtained from contraction by the reverse Levi identity), consolidation and semi-revision, all of them over belief sets. It is worth noting that the latter operations, introduced by S. Hansson, involve the temporary acceptance of contradictory beliefs, and so they were originally defined only for belief bases. Unlike to previous proposals in the literature, only defined for specific paraconsistent logics, the present approach can be applied to a general class of paraconsistent logics which are supraclassical, thus preserving the spirit of AGM. Moreover, representation theorems w.r.t. constructions based on selection functions are obtained for all the operations. (shrink)

One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results (...) hold for several systems of the hierarchy of paraconsistent logics known as Logics of Formal Inconsistency (LFIs). Because of this, these logics are uniquely characterized by semantics of non-deterministic kind. This paper offers a solution for two open problems in the domain of paraconsistency, in particular connected to algebraization of LFIs, by obtaining several LFIs weaker than C1, each of one is algebraizable in the standard Lindenbaum-Tarski's sense by a suitable variety of Boolean algebras extended with operators. This means that such LFIs satisfy the replacement property. The weakest LFI satisfying replacement presented here is called RmbC, which is obtained from the basic LFI called mbC. Some axiomatic extensions of RmbC are also studied, and in addition a neighborhood semantics is defined for such systems. It is shown that RmbC can be defined within the minimal bimodal non-normal logic E+E defined by the fusion of the non-normal modal logic E with itself. Finally, the framework is extended to first-order languages. RQmbC, the quantified extension of RmbC, is shown to be sound and complete w.r.t. BALFI semantics. (shrink)

“Trends in Logic XVI: Consistency, Contradiction, Paraconsistency, and Reasoning - 40 years of CLE” is being organized by the Centre for Logic, Epistemology and the History of Science at the State University of Campinas (CLEUnicamp) from September 12th to 15th, 2016, with the auspices of the Brazilian Logic Society, Studia Logica and the Polish Academy of Sciences. The conference is intended to celebrate the 40th anniversary of CLE, and is centered around the areas of logic, epistemology, (...) philosophy and history of science, while bringing together scholars in the fields of philosophy, logic, mathematics, computer science and other disciplines who have contributed significantly to what Studia Logica is today and to what CLE has achieved in its four decades of existence. It intends to celebrate CLE’s strong influence in Brazil and Latin America and the tradition of investigating formal methods inspired by, and devoted to, philosophical views, as well as philosophical problems approached by means of formal methods. The title of the event commemorates one of the three main areas of CLE, what has been called the “Brazilian school of paraconsistency”, combining such a pluralist view about logic and reasoning. (shrink)

"Paraconsistent Belief Revision Based on a Formal Consistency Operator" delves into Belief Revision—a significant area of research in Formal Philosophy that uses logic to model the ways in which human and artificial agents modify their beliefs in response to new information and examines how these changes can be considered rational. -/- Originally authored as a PhD thesis (previously published in Portuguese), this work provides a novel epistemic interpretation of Paraconsistency through Paraconsistent Belief Revision systems. It explores the (...) concept of paraconsistency from the standpoint of epistemic attitudes of acceptance and rejection. -/- This work challenges the traditional notion that accepting a new belief requires retracting its negation from the current epistemic state. The author contends that such reflexive retraction goes against the principle of informational economy, which is a crucial aspect of rationality in the context of belief change. Consequently, the phenomenon of paraconsistency is further examined from this fresh perspective of belief change, shedding light on the complexities of the Logics of Formal Inconsistency (LFIs). These LFIs provide the foundational logic, offering a comprehensive framework for understanding and implementing paraconsistent principles within belief revision systems. -/- This thesis was supervised by Marcelo Esteban Coniglio and co-supervised by Márcio Moretto Ribeiro, as part of Rafael Rodrigues Testa's doctoral studies at the University of Campinas (Unicamp), Brazil. (shrink)

Logic systems that can handle contradictions were being used for some time without having a general technical name. One of the main proposers of these systems, Newton da Costa, asked Francisco Miró Quesada to suggest him a name for those systems. In the historical letter that here we translate into English for the first time, Miró Quesada suggests three names to da Costa for this purpose: ‘ultraconsistent’, ‘metaconsistent’, and ‘paraconsistent’; explaining their pros and cons. -/- Paper based on (...) a letter by Francisco Miró Quesada Cantuarias to Newton da Costa, edited, translated, and annotated by Luis Felipe Bartolo Alegre. (shrink)

Boolean-valued models of set theory were independently introduced by Scott, Solovay and Vopěnka in 1965, offering a natural and rich alternative for describing forcing. The original method was adapted by Takeuti, Titani, Kozawa and Ozawa to lattice-valued models of set theory. After this, Löwe and Tarafder proposed a class of algebras based on a certain kind of implication which satisfy several axioms of ZF. From this class, they found a specific 3-valued model called PS3 which satisfies all the axioms of (...) ZF, and can be expanded with a paraconsistent negation *, thus obtaining a paraconsistent model of ZF. The logic (PS3 ,*) coincides (up to language) with da Costa and D'Ottaviano logic J3, a 3-valued paraconsistent logic that have been proposed independently in the literature by several authors and with different motivations such as CluNs, LFI1 and MPT. We propose in this paper a family of algebraic models of ZFC based on LPT0, another linguistic variant of J3 introduced by us in 2016. The semantics of LPT0, as well as of its first-order version QLPT0, is given by twist structures defined over Boolean agebras. From this, it is possible to adapt the standard Boolean-valued models of (classical) ZFC to twist-valued models of an expansion of ZFC by adding a paraconsistent negation. We argue that the implication operator of LPT0 is more suitable for a paraconsistent set theory than the implication of PS3, since it allows for genuinely inconsistent sets w such that [(w = w)] = 1/2 . This implication is not a 'reasonable implication' as defined by Löwe and Tarafder. This suggests that 'reasonable implication algebras' are just one way to define a paraconsistent set theory. Our twist-valued models are adapted to provide a class of twist-valued models for (PS3,*), thus generalizing Löwe and Tarafder result. It is shown that they are in fact models of ZFC (not only of ZF). (shrink)

There are two foundational, but not fully developed, ideas in paraconsistency, namely, the duality between paraconsistent and intuitionistic paradigms, and the introduction of logical operators that express meta-logical notions in the object language. The aim of this paper is to show how these two ideas can be adequately accomplished by the Logics of Formal Inconsistency (LFIs) and by the Logics of Formal Undeterminedness (LFUs). LFIs recover the validity of the principle of explosion in a paraconsistent scenario, while LFUs (...) recover the validity of the principle of excluded middle in a paracomplete scenario. We introduce definitions of duality between inference rules and connectives that allow comparing rules and connectives that belong to different logics. Two formal systems are studied, the logics mbC and mbD, that display the duality between paraconsistency and paracompleteness as a duality between inference rules added to a common core– in the case studied here, this common core is classical positive propositional logic (CPL + ). The logics mbC and mbD are equipped with recovery operators that restore classical logic for, respectively, consistent and determined propositions. These two logics are then combined obtaining a pair of logics of formal inconsistency and undeterminedness (LFIUs), namely, mbCD and mbCDE. The logic mbCDE exhibits some nice duality properties. Besides, it is simultaneously paraconsistent and paracomplete, and able to recover the principles of excluded middle and explosion at once. The last sections offer an algebraic account for such logics by adapting the swap-structures semantics framework of the LFIs the LFUs. This semantics highlights some subtle aspects of these logics, and allows us to prove decidability by means of finite non-deterministic matrices. (shrink)

The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (that is, logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special class of multialgebras. The proposed semantical framework generalizes previous aproaches to quantified LFIs presented in the literature. The case of (...) QmbC, the simpler quantified LFI expanding classical logic, will be analyzed in detail. An axiomatic extension of QmbC called QLFI1o is also studied, which is equivalent to the quantified version of da Costa and D'Ottaviano 3-valued logic J3. The semantical structures for this logic turn out to be Tarkian structures based on twist structures. The expansion of QmbC and QLFI1o with a standard equality predicate is also considered. (shrink)

The topic of exemplarity has attracted considerable interest in philosophy, legal theory, literary studies and art recently. There is broad consensus that exemplary cases mediate between singular instances and general concepts or norms. The aim of this article is to provide an additional perspective on the logic of exemplarity. First, inspired by Jacques Derrida’s discussion of exemplarity, I shall argue that there is a kind of différance between (singular) examples and (general) exemplars. What an example exemplifies, the exemplarity of (...) the example, eludes any fixed identity and follows a logic of supplement. Second, I shall present the so-called logic of exemplarity. The received paraconsistent view has it that the exemplar of X is an X and, at the same time, is not an X. Inspired by Ludwig Wittgenstein’s discussion of the standard metre, I would like to present an alternative paracomplete view whereby we can say of an exemplar of X neither that it is an X nor that it is not an X. (shrink)

In 2016, Béziau introduces a restricted notion of paraconsistency, the so-called genuine paraconsistency. A logic is genuine paraconsistent if it rejects the laws $\varphi,\neg \varphi \vdash \psi$ and $\vdash \neg (\varphi \wedge \neg \varphi)$. In that paper, the author analyzes, among the three-valued logics, which of them satisfy this property. If we consider multiple-conclusion consequence relations, the dual properties of those above-mentioned are $\vdash \varphi, \neg \varphi$ and $\neg (\varphi \vee \neg \varphi) \vdash$. We call genuine paracomplete logics (...) those rejecting the mentioned properties. We present here an analysis of the three-valued genuine paracomplete logics. A very natural twist structures semantics for these logics is also found in a systematic way. This semantics produces automatically a simple and elegant Hilbert-style characterization for all these logics. Finally, we introduce the logic LGP which is genuine paracomplete is not genuine paraconsistent, not even paraconsistent and cannot be characterized by a single finite logical matrix. (shrink)

In this paper, we present a non-trivial and expressively complete paraconsistent naïve theory of truth, as a step in the route towards semantic closure. We achieve this goal by expressing self-reference with a weak procedure, that uses equivalences between expressions of the language, as opposed to a strong procedure, that uses identities. Finally, we make some remarks regarding the sense in which the theory of truth discussed has a property closely related to functional completeness, and we present a sound (...) and complete three-sided sequent calculus for this expressively rich theory. (shrink)

In this paper we consider the logics L(i,n) obtained from the (n+1)-valued Lukasiewicz logics L(n+1) by taking the order filter generated by i/n as the set of designated elements. In particular, the conditions of maximality and strong maximality among them are analyzed. We present a very general theorem that provides sufficient conditions for maximality between logics. As a consequence of this theorem, it is shown that L(i,n) is maximal w.r.t. CPL whenever n is prime. Concerning strong maximality (i.e. maximality w.r.t. (...) rules instead of only axioms), we provide algebraic arguments in order to show that the logics L(i,n) are not strongly maximal w.r.t. CPL, even for n prime. Indeed, in such case, we show that there is just one extension between L(i,n) and CPL obtained by adding to L(i,n) a kind of graded explosion rule. Finally, using these results, we show that the logics L(i,n) with n prime and i/n < 1/2 are ideal paraconsistent logics. (shrink)

This paper presents a semantical analysis of the Weak Kleene Logics Kw3 and PWK from the tradition of Bochvar and Halldén. These are three-valued logics in which a formula takes the third value if at least one of its components does. The paper establishes two main results: a characterisation result for the relation of logical con- sequence in PWK – that is, we individuate necessary and sufficient conditions for a set.

In ‘Godel’s Way’ three eminent scientists discuss issues such as undecidability, incompleteness, randomness, computability and paraconsistency. I approach these issues from the Wittgensteinian viewpoint that there are two basic issues which have completely different solutions. There are the scientific or empirical issues, which are facts about the world that need to be investigated observationally and philosophical issues as to how language can be used intelligibly (which include certain questions in mathematics and logic), which need to be decided by looking (...) at how we actually use words in particular contexts. When we get clear about which language game we are playing, these topics are seen to be ordinary scientific and mathematical questions like any others. Wittgenstein’s insights have seldom been equaled and never surpassed and are as pertinent today as they were 80 years ago when he dictated the Blue and Brown Books. -/- Those wishing a comprehensive up to date framework for human behavior from the modern two systems view may consult my book ‘The Logical Structure of Philosophy, Psychology, Mind and Language in Ludwig Wittgenstein and John Searle’ 2nd ed (2019). Those interested in more of my writings may see ‘Talking Monkeys--Philosophy, Psychology, Science, Religion and Politics on a Doomed Planet--Articles and Reviews 2006-2019 3rd ed (2019), The Logical Structure of Human Behavior (2019), and Suicidal Utopian Delusions in the 21st Century 4th ed (2019). (shrink)

We present a philosophical motivation for the logics of formal inconsistency, a family of paraconsistent logics whose distinctive feature is that of having resources for expressing the notion of consistency within the object language. We shall defend the view according to which logics of formal inconsistency are theories of logical consequence of normative and epistemic character. This approach not only allows us to make inferences in the presence of contradictions, but offers a philosophically acceptable account of paraconsistency.

Priest holds anti-exceptionalism about logic. That is, he holds that logic, as a theory, does not have any exceptional status in relation to the theories of empirical sciences. Crucial to Priest’s anti-exceptionalism is the existence of ‘data’ that can force the revision of logical theory. He claims that classical logic is inadequate to the available data and, thus, needs to be revised. But what kind of data can overturn classical logic? Priest claims that the data is (...) our intuitions about the validity of inferences. In order to make sense of this claim, I will appeal to the Madhyamaka Buddhist philosopher Candrakīrti. I will then pose a problem for Priest’s anti-exceptionalism. Finally, I will suggest a way out of the problem for Priest. Whether or not he accepts my solution, I will let him decide. (shrink)

Ayda Ignez Arruda was a key figure in the development of the Brazilian school of Paraconsistent logic and the first person to write a historical survey of the field. Despite her importa...

A first-order logic of belief with identity is proposed, primarily to give an account of possible de re contradictory beliefs, which sometimes occur as consequences of de dicto non-contradictory beliefs. A model has two separate, though interconnected domains: the domain of objects and the domain of appearances. The satisfaction of atomic formulas is defined by a particular S-accessibility relation between worlds. Identity is non-classical, and is conceived as an equivalence relation having the classical identity relation as a subset. A (...) tableau system with labels, signs, and suffixes is defined, extending the basic language $\mathscr{L}_{\mathbf{QB}}$ by quasiformulas (to express the denotations of predicates). The proposed logical system is paraconsistent since $\phi \wedge \neg\phi$ does not ``explode'' with arbitrary syntactic consequences. (shrink)

The recent literature on Nāgārjuna’s catuṣkoṭi centres around Jay Garfield’s (2009) and Graham Priest’s (2010) interpretation. It is an open discussion to what extent their interpretation is an adequate model of the logic for the catuskoti, and the Mūla-madhyamaka-kārikā. Priest and Garfield try to make sense of the contradictions within the catuskoti by appeal to a series of lattices – orderings of truth-values, supposed to model the path to enlightenment. They use Anderson & Belnaps's (1975) framework of First Degree (...) Entailment. Cotnoir (2015) has argued that the lattices of Priest and Garfield cannot ground the logic of the catuskoti. The concern is simple: on the one hand, FDE brings with it the failure of classical principles such as modus ponens. On the other hand, we frequently encounter Nāgārjuna using classical principles in other arguments in the MMK. There is a problem of validity. If FDE is Nāgārjuna’s logic of choice, he is facing what is commonly called the classical recapture problem: how to make sense of cases where classical principles like modus pones are valid? One cannot just add principles like modus ponens as assumptions, because in the background paraconsistent logic this does not rule out their negations. In this essay, I shall explore and critically evaluate Cotnoir’s proposal. In detail, I shall reveal that his framework suffers collapse of the kotis. Furthermore, I shall argue that the Collapse Argument has been misguided from the outset. The last chapter suggests a formulation of the catuskoti in classical Boolean Algebra, extended by the notion of an external negation as an illocutionary act. I will focus on purely formal considerations, leaving doctrinal matters to the scholarly discourse – as far as this is possible. (shrink)

Since its first appearance in 1966, the notion of a supervaluation has been regarded by many as a powerful tool for dealing with semantic gaps. Only recently, however, applications to semantic gluts have also been considered. In previous work I proposed a general framework exploiting the intrinsic gap/glut duality. Here I also examine an alternative account where gaps and gluts are treated on a par: although they reflect opposite situations, the semantic upshot is the same in both cases--the value of (...) some expressions is not uniquely defined. Other strategies for generalizing supervaluations are considered and some comparative facts are discussed. (shrink)

This paper reviews the central points and presents some recent developments of the epistemic approach to paraconsistency in terms of the preservation of evidence. Two formal systems are surveyed, the basic logic of evidence (BLE) and the logic of evidence and truth (LET J ), designed to deal, respectively, with evidence and with evidence and truth. While BLE is equivalent to Nelson’s logic N4, it has been conceived for a different purpose. Adequate valuation semantics that provide decidability (...) are given for both BLE and LET J . The meanings of the connectives of BLE and LET J , from the point of view of preservation of evidence, is explained with the aid of an inferential semantics. A formalization of the notion of evidence for BLE as proposed by M. Fitting is also reviewed here. As a novel result, the paper shows that LET J is semantically characterized through the so-called Fidel structures. Some opportunities for further research are also discussed. (shrink)

In this paper we present a philosophical motivation for the logics of formal inconsistency, a family of paraconsistent logics whose distinctive feature is that of having resources for expressing the notion of consistency within the object language in such a way that consistency may be logically independent of non-contradiction. We defend the view according to which logics of formal inconsistency may be interpreted as theories of logical consequence of an epistemological character. We also argue that in order to philosophically (...) justify paraconsistency there is no need to endorse dialetheism, the thesis that there are true contradictions. Furthermore, we show that mbC, a logic of formal inconsistency based on classical logic, may be enhanced in order to express the basic ideas of an intuitive interpretation of contradictions as conflicting evidence. (shrink)

This chapter focuses on alternative logics. It discusses a hierarchy of logical reform. It presents case studies that illustrate particular aspects of the logical revisionism discussed in the chapter. The first case study is of intuitionistic logic. The second case study turns to quantum logic, a system proposed on empirical grounds as a resolution of the antinomies of quantum mechanics. The third case study is concerned with systems of relevance logic, which have been the subject of an (...) especially detailed reform program. Finally, the fourth case study is paraconsistent logic, perhaps the most controversial of serious proposals. (shrink)

The anti-exceptionalist debate brought into play the problem of what are the relevant data for logical theories and how such data affects the validities accepted by a logical theory. In the present paper, I depart from Laudan's reticulated model of science to analyze one aspect of this problem, namely of the role of logical data within the process of revision of logical theories. For this, I argue that the ubiquitous nature of logical data is responsible for the proliferation of several (...) distinct methodologies for logical theories. The resulting picture is coherent with the Laudanean view that agreement and disagreement between scientific theories take place at different levels. From this perspective, one is able to articulate other kinds of divergence that considers not only the inferential aspects of a given logical theory, but also the epistemic aims and the methodological choices that drive its development. (shrink)

Dans 'Godel’s Way', trois éminents scientifiques discutent de questions telles que l’indécidabilité, l’incomplétude, le hasard, la calculabilité et la paraconsistence. J’aborde ces questions du point de vue de Wittgensteinian selon lesquelles il y a deux questions fondamentales qui ont des solutions complètement différentes. Il y a les questions scientifiques ou empiriques, qui sont des faits sur le monde qui doivent être étudiés de manière observationnelle et philosophique quant à la façon dont le langage peut être utilisé intelligiblement (qui incluent certaines (...) questions en mathématiques et en logique), qui doivent être décidés en regardant un comment nous utilisons réellement des mots dans des contextes particuliers. Lorsque nous obtenons clair sur le jeu de langue que nous jouons, ces sujets sont considérés comme des questions scientifiques et mathématiques ordinaires comme les autres. Les idées de Wittgenstein ont rarement été égalées et jamais dépassées et sont aussi pertinentes aujourd’hui qu’elles l’étaient il y a 80 ans lorsqu’il a dicté les Livres Bleus et Brown. Malgré ses défauts, vraiment une série de notes plutôt qu’un livre fini, c’est une source unique du travail de ces trois savants célèbres qui travaillent aux confins de la physique, des mathématiques et de la philosophie depuis plus d’un demi-siècle. Da Costa et Doria sont cités par Wolpert (voir ci-dessous ou mes articles sur Wolpert et mon examen de Yanofsky 'The Outer Limits of Reason') depuis qu’ils ont écrit sur le calcul universel, et parmi ses nombreuses réalisations, Da Costa est un pionnier dans la paraconsistence. -/- Ceux qui souhaitent un cadre complet à jour pour le comportement humain de la vue moderne de deux système peuvent consulter mon livre 'The Logical Structure of Philosophy, Psychology, Mind and Language in Ludwig Wittgenstein and John Searle' 2nd ed (2019). Ceux qui s’intéressent à plus de mes écrits peuvent voir «Talking Monkeys --Philosophie, Psychologie, Science, Religion et Politique sur une planète condamnée --Articles et revues 2006-2019 » 3e ed (2019) et Suicidal Utopian Delusions in the 21st Century 4th ed (2019) et autres. (shrink)

In 1988, J. Ivlev proposed some (non-normal) modal systems which are semantically characterized by four-valued non-deterministic matrices in the sense of A. Avron and I. Lev. Swap structures are multialgebras (a.k.a. hyperalgebras) of a special kind, which were introduced in 2016 by W. Carnielli and M. Coniglio in order to give a non-deterministic semantical account for several paraconsistent logics known as logics of formal inconsistency, which are not algebraizable by means of the standard techniques. Each swap structure induces naturally (...) a non-deterministic matrix. The aim of this paper is to obtain a swap structures semantics for some Ivlev-like modal systems proposed in 2015 by M. Coniglio, L. Fariñas del Cerro and N. Peron. Completeness results will be stated by means of the notion of Lindenbaum–Tarski swap structures, which constitute a natural generalization to multialgebras of the concept of Lindenbaum–Tarski algebras. (shrink)