Walter Carnielli

In this paper, we propose Kripke-style models for the logics of evidence and truth LETJ and LETF. These logics extend, respectively, Nelson’s logic N4 and the logic of first-degree entailment with a classicality operator ∘ that recovers classical logic for formulas in its scope. According to the intended interpretation here proposed, these models represent a database that receives information as time passes, and such information can be positive, negative, non-reliable, or reliable, while a formula ∘A means that the information about A, either positive or negative, is reliable. This proposal is in line with the interpretation of N4 and FDE as information-based logics, but adds to the four scenarios expressed by them two new scenarios: reliable information for the truth and for the falsity of a given proposition.

We propose in this paper a family of algebraic models of ZFC based on the three-valued paraconsistent logic LPT0, a linguistic variant of da Costa and D’Ottaviano’s logic J3. The semantics is given by twist structures defined over complete Boolean agebras. The Boolean-valued models of ZFC are adapted to twist-valued models of an expansion of ZFC by adding a paraconsistent negation. This allows for inconsistent sets w satisfying ‘not (w = w)’, where ‘not’ stands for the paraconsistent negation. Finally, our framework is adapted to provide a class of twist-valued models generalizing Löwe and Tarafder’s model based on logic (PS 3,∗), showing that they are paraconsistent models of ZFC. The present approach offers more options for investigating independence results in paraconsistent set theory.

Proof-theoretic semantics provides meanings to the connectives of intuitionistic logic without the need for a semantics in the standard sense of an attribution of semantic values to formulas. Meanings are given by the inference rules that, in this case, do not express preservation of truth but rather preservation of availability of a constructive proof. Elsewhere we presented two paraconsistent systems of natural deduction: the Basic Logic of Evidence and the Logic of Evidence and Truth. The rules of BLE have been conceived to preserve a notion weaker than truth, namely, evidence, understood as reasons for believing in or accepting a given proposition. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$LET_{J}$$\end{document}, on the other hand, is a logic of formal inconsistency and undeterminedness that extends \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$BLE$$\end{document} by adding resources to recover classical logic for formulas taken as true, or false. We extend the idea of proof-theoretic semantics to these logics and argue that the meanings of the connectives in BLE are given by the fact that its rules are concerned with preservation of the availability of evidence. An analogous idea also applies to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$LET_{J}$$\end{document}.

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.

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.

This paper introduces the logic of evidence and truth \ as an extension of the Belnap–Dunn four-valued logic \. \ is a slightly modified version of the logic \, presented in Carnielli and Rodrigues. While \ is equipped only with a classicality operator \, \ is equipped with a non-classicality operator \ as well, dual to \. Both \ and \ are logics of formal inconsistency and undeterminedness in which the operator \ recovers classical logic for propositions in its scope. Evidence is a notion weaker than truth in the sense that there may be evidence for a proposition \ even if \ is not true. As well as \, \ is able to express preservation of evidence and preservation of truth. The primary aim of this paper is to propose a probabilistic semantics for \ where statements \\) and \\) express, respectively, the amount of evidence available for \ and the degree to which the evidence for \ is expected to behave classically—or non-classically for \ \). A probabilistic scenario is paracomplete when \ + P 1\), and in both cases, \ < 1\). If \ = 1\), or \ = 0\), classical probability is recovered for \. The proposition \, a theorem of \, partitions what we call the information space, and thus allows us to obtain some new versions of known results of standard probability theory.

From the technical point of view, philosophically neutral, the duality between a paraconsistent and a paracomplete logic (for example intuitionistic logic) lies in the fact that explosion does not hold in the former and excluded middle does not hold in the latter. From the point of view of the motivations for rejecting explosion and excluded middle, this duality can be interpreted either ontologically or epistemically. An ontological interpretation of intuitionistic logic is Brouwer’s idealism; of paraconsistency is dialetheism. The epistemic interpretation of intuitionistic logic is in terms of preservation of constructive proof; of paraconsistency is in terms of preservation of evidence. In this paper, we explain and defend the epistemic approach to paraconsistency. We argue that it is more plausible than dialetheism and allows a peaceful and fruitful coexistence with classical logic.

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

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 metalogical 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 and by the logics of formal undeterminedness. 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. 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 LFI and undeterminedness, 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 one at a time. 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 nondeterministic matrices.

We prove that the minimal Logic of Formal Inconsistency $\mathsf{QmbC}$ validates a weaker version of Fraïssé’s theorem. LFIs are paraconsistent logics that relativize the Principle of Explosion only to consistent formulas. Now, despite the recent interest in LFIs, their model-theoretic properties are still not fully understood. Our aim in this paper is to investigate the situation. Our interest in FT has to do with its fruitfulness; the preservation of FT indicates that a number of other classical semantic properties can be also salvaged in LFIs. Further, given that FT depends on truth-functionality, whether full FT holds for $\mathsf{QmbC}$ becomes a challenging question.

This volume investigates what is beyond the Principle of Non-Contradiction. It features 14 papers on the foundations of reasoning, including logical systems and philosophical considerations. Coverage brings together a cluster of issues centered upon the variety of meanings of consistency, contradiction, and related notions. Most of the papers, but not all, are developed around the subtle distinctions between consistency and non-contradiction, as well as among contradiction, inconsistency, and triviality, and concern one of the above mentioned threads of the broadly understood non-contradiction principle and the related principle of explosion. Some others take a perspective that is not too far away from such themes, but with the freedom to tread new paths. Readers should understand the title of this book in a broad way,because it is not so obvious to deal with notions like contradictions, consistency, inconsistency, and triviality. The papers collected here present groundbreaking ideas related to consistency and inconsistency.

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.

If something is contradictory, then it is not consistent; but if something is non-contradictory, is it necessarily consistent? If so, there may be nothing between consistency and inconsistency. Thus if we literally apprehend the title of this book, it will be on nothing. However, the title of this book should be understood more broadly. This is because it is not so obvious how we should deal with notions like contradictions, consistency, inconsistency, and triviality. It must not be the case that something is there and is not there at the same time - here is the principle of contradiction in the formulation of Aristotle which, on the one hand, forms the basis of all critical thinking, and on the other hand, it is the object of controversy among the philosophers from Heraclitus through Hegel, to the present day.

This paper intends to propose new forms of logic puzzles by adopting a pluralist perspective. Not only can this expanded view lead to more challenging puzzles, but it also helps the understanding of novel forms of reasoning. In 1996, George Boolos published a famous puzzle, known as the ‘hardest logic puzzle ever’. This puzzle has been modified several times, and is known not to be ‘the most difficult of all logical puzzles’. I argue that modified versions of this famous puzzle can be made even harder by using non-standard logics. As a study case, I introduce a version of the puzzle based on the three-valued paraconsistent logic LFI1 and show how it can be solved in three questions, leaving the conjecture that this three-valued puzzle cannot be solved in fewer than three questions.

This paper discusses logical accounts of the notions of consistency and negation, and in particular explores some potential means of defining consistency and negation when expressed in modal terms. Although this can be done with interesting consequences when starting from classical normal modal logics, some intriguing cases arise when starting from paraconsistent modalities and negations, as in the hierarchy of the so-called cathodic modal paraconsistent systems (cf. Bueno-Soler, Log Univers 4(1):137–160, 2010). The paper also takes some first steps in exploring the philosophical significance of such logical tools, comparing the notions of consistency and negation modally defined with the primitive notions of consistency and negation in the family of Logics of Formal Inconsistency (LFIs), suggesting some experiments on their expressive power.

The ``Many Sides of Logic'' is a volume containing a selection of the papers delivered at three simultaneous events held between 11-17 May 2008 in Paraty, RJ, Brazil, continuing a tradition of three decades of Brazilian and Latin-American meetings and celebrating the 30th anniversary of an institution congenital with the mature interest for logic, epistemology and history of sciences in Brazil: CLE 30 - 30th Anniversary of the Centre for Logic, Epistemology and the History of Science at the State University of Campinas (UNICAMP) XV EBL -15th Brazilian Logic Conference XIV SLALM - 14th Latin-American Symposium on Mathematical Logic Several renowned logicians, philosophers and mathematicians gathered in colonial Paraty, a historic village on the Brazilian coast founded in the 17th Century and surrounded by the luscious Atlantic rain forest to deliver lectures and talks celebrating the many sides of logic: the philosophical, the mathematical, the computational, the historical, and the multiple facets therein. The topics of the joint conferences, well represented here, included philosophical and mathematical Logic and applications with emphasis on model theory and proof theory, set theory, non-classical logics and applications, history and philosophy of logic, philosophy of the formal sciences and issues on the foundations of mathematics. The events have been preceded by a Logic School planned for students and young researchers held at the UNICAMP campus in Campinas, SP.

The prepositional calculiCn, 1 ⩽n ⩽ ω introduced by N.C.A. da Costa constitute special kinds of paraconsistent logics. A question which remained open for some time concerned whether it was possible to obtain a Lindenbaum's algebra forCn. C. Mortensen settled the problem, proving that no equivalence relation forCn. determines a non-trivial quotient algebra.The concept of da Costa algebra, which reflects most of the logical properties ofCn, as well as the concept of paraconsistent closure system, are introduced in this paper.We show that every da Costa algebra is isomorphic with a paraconsistent algebra of sets, and that the closure system of all filters of a da Costa algebra is paraconsistent.