In this paper, we use a ‘normality operator’ in order to generate logics of formal inconsistency and logics of formal undeterminedness from any subclassical many-valued logic that enjoys a truth-functional semantics. Normality operators express, in any many-valued logic, that a given formula has a classical truth value. In the first part of the paper we provide some setup and focus on many-valued logics that satisfy some of the three properties, namely subclassicality and two properties that we call fixed-point negation property (...) and conservativeness. In the second part of the paper, we introduce normality operators and explore their formal behaviour. In the third and final part of the paper, we establish a number of classical recapture results for systems of formal inconsistency and formal undeterminedness that satisfy some or all the properties above. These are the main formal results of the paper. Also, we illustrate concrete cases of recapture by discussing the logics $\mathsf{K}^{\circledast }_{3}$, $\mathsf{LP}^{\circledast }$, $\mathsf{K}^{w\circledast }_{3}$, $\mathsf{PWK}^{\circledast }$ and $\mathsf{E_{fde}}^{\circledast }$, that are in turn extensions of $\mathsf{{K}_{3}}$, $\mathsf{LP}$, $\mathsf{K}^{w}_{3}$, $\mathsf{PWK}$ and $\mathsf{E_{fde}}$, respectively. (shrink)

In this paper, we consider some contributions to the model theory of the logic of formal inconsistency $\mathsf{QmbC}$ as a reply to Walter Carnielli, Marcelo Coniglio, Rodrigo Podiacki and Tarcísio Rodrigues’ call for a ‘wider model theory.’ This call demands that we align the practices and techniques of model theory for logics of formal inconsistency as closely as possible with those employed in classical model theory. The key result is a proof that the Keisler–Shelah isomorphism theorem holds for $\mathsf{QmbC}$, i.e. (...) that the strong elementary equivalence of two $\mathsf{QmbC}$ models $\mathfrak{A}$ and $\mathfrak{B}$ is equivalent to them having strongly isomorphic ultrapowers. As intermediate steps, we introduce some notions of model-theoretic equivalence between $\mathsf{QmbC}$ models, explicitly prove Łoś’ theorem and introduce a useful technique of model-theoretic ‘atomization’ in which the satisfaction sets of non-deterministically evaluated formulae are associated with new predicates. Finally, we consider some of the extensions of $\mathsf{QmbC}$, explicitly showing that Keisler–Shelah holds for $\mathsf{QCi}$ and suggesting that it holds of extensions like $\mathsf{QCila}$ and $\mathsf{QCia}$ as well. (shrink)

Although logical consistency is desirable in scientific research, standard statistical hypothesis tests are typically logically inconsistent. To address this issue, previous work introduced agnostic hypothesis tests and proved that they can be logically consistent while retaining statistical optimality properties. This article characterizes the credal modalities in agnostic hypothesis tests and uses the hexagon of oppositions to explain the logical relations between these modalities. Geometric solids that are composed of hexagons of oppositions illustrate the conditions for these modalities to be logically (...) consistent. Prisms composed of hexagons of oppositions show how the credal modalities obtained from two agnostic tests vary according to their threshold values. Nested hexagons of oppositions summarize logical relations between the credal modalities in these tests and prove new relations. (shrink)

Multialgebras have been much studied in mathematics and in computer science. In 2016 Carnielli and Coniglio introduced a class of multialgebras called swap structures, as a semantic framework for dealing with several Logics of Formal Inconsistency that cannot be semantically characterized by a single finite matrix. In particular, these LFIs are not algebraizable by the standard tools of abstract algebraic logic. In this paper, the first steps towards a theory of non-deterministic algebraization of logics by swap structures are given. Specifically, (...) a formal study of swap structures for LFIs is developed, by adapting concepts of universal algebra to multialgebras in a suitable way. A decomposition theorem similar to Birkhoff’s representation theorem is obtained for each class of swap structures. Moreover, when applied to the 3-valued algebraizable logics J3 and Ciore, their classes of algebraic models are retrieved, and the swap structures semantics become twist structures semantics. This fact, together with the existence of a functor from the category of Boolean algebras to the category of swap structures for each LFI, suggests that swap structures can be seen as non-deterministic twist structures. This opens new avenues for dealing with non-algebraizable logics by the more general methodology of multialgebraic semantics. (shrink)

In some recent articles, Cobreros, Egré, Ripley, & van Rooij have defended the idea that abandoning transitivity may lead to a solution to the trouble caused by semantic paradoxes. For that purpose, they develop the Strict-Tolerant approach, which leads them to entertain a nontransitive theory of truth, where the structural rule of Cut is not generally valid. However, that Cut fails in general in the target theory of truth does not mean that there are not certain safe instances of Cut (...) involving semantic notions. In this article we intend to meet the challenge of answering how to regain all the safe instances of Cut, in the language of the theory, making essential use of a unary recovery operator. To fulfill this goal, we will work within the so-called Goodship Project, which suggests that in order to have nontrivial naïve theories it is sufficient to formulate the corresponding self-referential sentences with suitable biconditionals. Nevertheless, a secondary aim of this article is to propose a novel way to carry this project out, showing that the biconditionals in question can be totally classical. In the context of this article, these biconditionals will be essentially used in expressing the self-referential sentences and, thus, as a collateral result of our work we will prove that none of the recoveries expected of the target theory can be nontrivially achieved if self-reference is expressed through identities. (shrink)

The purpose of this paper is to present a paraconsistent formal system and a corresponding intended interpretation according to which true contradictions are not tolerated. Contradictions are, instead, epistemically understood as conflicting evidence, where evidence for a proposition A is understood as reasons for believing that A is true. The paper defines a paraconsistent and paracomplete natural deduction system, called the Basic Logic of Evidence, and extends it to the Logic of Evidence and Truth. The latter is a logic of (...) formal inconsistency and undeterminedness that is able to express not only preservation of evidence but also preservation of truth. LETj is anti-dialetheist in the sense that, according to the intuitive interpretation proposed here, its consequence relation is trivial in the presence of any true contradiction. Adequate semantics and a decision method are presented for both BLE and LETj, as well as some technical results that fit the intended interpretation. (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)

The logics of formal inconsistency are logics tolerant to some amount of contradiction, but in which some versions of explosion still hold. The main result of this paper is a reconstruction of two such logics in the dialogical framework. By doing so, we achieve two things. On the one hand, we provide a formal approach to argumentative situations where some contradictions may occur while keeping the idea that there may still be situations in which some propositions are ‘safe’ in the (...) sense of immunity to the contradictions. On the other hand, we open a new line of study on these logics, in the context of the game-theoretical approach to semantics born in the 1960s, with various interesting perspectives, some of which are discussed at the end of this article. (shrink)

This paper introduces a game theoretical semantics for a particular logic of formal inconsistency called mbC.

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

Infectious logics are systems that have a truth-value that is assigned to a compound formula whenever it is assigned to one of its components. This paper studies four-valued infectious logics as the basis of transparent theories of truth. This take is motivated as a way to treat different pathological sentences differently, namely, by allowing some of them to be truth-value gluts and some others to be truth-value gaps and as a way to treat the semantic pathology suffered by at least (...) some of these sentences as infectious. This leads us to consider four distinct four-valued logics: one where truth-value gaps are infectious, but gluts are not; one where truth-value gluts are infectious, but gaps are not; and two logics where both gluts and gaps are infectious, in some sense. Additionally, we focus on the proof theory of these systems, by offering a discussion of two related topics. On the one hand, we prove some limitations regarding the possibility of providing standard Gentzen sequent calculi for these systems, by dualizing and extending some recent results for infectious logics. On the other hand, we provide sound and complete four-sided sequent calculi, arguing that the most important technical and philosophical features taken into account to usually prefer standard calculi are, indeed, enjoyed by the four-sided systems. (shrink)

There are a considerable number of logics that do not seem to share the same inferential principles. Intuitionistic logics do not include the law of the exclude.

In this paper, we analyze the epistemic approach to paraconsistency. This approach is advanced as an alternative to dialetheism on what concerns interpreting paraconsistency and contradictions; instead of having to accept that there are true contradictions, it is suggested that we may understand such situations as involving only conflicting evidence, which restricts contradictions to a notion of evidence weaker than truth. In this paper, we first distinguish two conflicting programs entangled in the proposal: interpreting paraconsistency in general through the notion (...) of evidence, and modeling reasoning with evidence by using paraconsistent logic. The first part of the program, we argue, does not succeed, on the grounds that it does not lead to a uniform proposal to the understanding of paraconsistency, and fails to engage with dialetheism in a legitimate dispute about interpretation of paraconsistency. Also, when seen through the lights of the second kind of approach, a ‘logic as modeling’ approach, weaknesses of dealing with evidence through paraconsistency come to light, basically because evidence does not seem to suggest the need of a paraconsistent treatment. As a result, one can neither approach paraconsistency in general through evidence, nor approach evidence with the use of paraconsistent logics. (shrink)

Consistency is one of the key concepts of logic; logicians have put a great deal of effort into proving the consistency of many logics. Understanding what causes inconsistency is also important; some logicians have developed paraconsistent logics that, unlike classical logics, allow some contradictions without making all formulas provable. Another direction of research studies inconsistency by measuring the amount of inconsistency of sets of formulas. While the initial attempt in 1978 was too ambitious in trying to do this for first-order (...) logic, this research got a substantial boost when an inconsistency measure was proposed for propositional logic in 2002. Since then, researchers in logic and artificial intelligence have made many interesting proposals and found related issues. Almost all of this work has been done for propositional logic. The purpose of this paper is to extend inconsistency measures to logics that also contain operators, such as modal operators. We use the terminology “generalized propositional logic” for such logics. We show how to extend propositional inconsistency measures to sets of formulas in any such generalized propositional logic. Examples are used to illustrate how various modal operators, including spatial and tense operators, fit into this framework. We also show that the addition of operators leads to a weak type of inconsistency. In all cases, the calculations for several inconsistency measures are given. (shrink)

In this paper, I will argue that Logics of Formal Inconsistency $$ can be used as very sophisticated and powerful methods of classical recapture. I will compare $LFIs$ with the well-known non-monotonic logics by Batens and Priest and the ‘shrieking’ rules of Beall. I will show that these proposals can be represented in $LFIs$ and that $LFIs$ give room to more complex and varied recapturing strategies.

Satisfaction systems and reductions between them are presented as an appropriate context for analyzing the satisfiability and the validity problems. The notion of reduction is generalized in order to cope with the meet-combination of logics. Reductions between satisfaction systems induce reductions between the respective satisfiability problems and (under mild conditions) also between their validity problems. Sufficient conditions are provided for relating satisfiability problems to validity problems. Reflection results for decidability in the presence of reductions are established. The validity problem in (...) the meet-combination is proved to be decidable whenever the validity problem for the components are decidable. Several examples are discussed, namely, involving modal and intuitionistic logics, as well as the meet-combination of modal logic and intuitionistic logic. (shrink)

Weakening classical logic is one of the most popular ways of dealing with semantic paradoxes. Their advocates often claim that such weakening does not affect non-semantic reasoning. Recently, however, Halbach and Horsten have shown that this is actually not the case for Kripke’s fixed-point theory based on the Strong Kleene evaluation scheme. Feferman’s axiomatization $\textsf{KF}$ in classical logic is much stronger than its paracomplete counterpart $\textsf{PKF}$, not only in terms of semantic but also in arithmetical content. This paper compares the (...) proof-theoretic strength of an axiomatization of Kripke’s construction based on the paraconsistent evaluation scheme of $\textsf{LP}$, formulated in classical logic with that of an axiomatization directly formulated in $\textsf{LP}$, extended with a consistency operator. The ultimate goal is to find out whether paraconsistent solutions to the paradoxes that employ consistency operators fare better in this respect than paracomplete ones. (shrink)

Paraconsistent logics are logics that, in contrast to classical and intuitionistic logic, do not trivialize inconsistent theories. In this paper we take a paraconsistent view on two famous modal logics: B and S5. We use for this a well-known general method for turning modal logics to paraconsistent logics by defining a new negation as $\neg \varphi =_{Def} \sim \Box \varphi$. We show that while that makes both B and S5 members of the well-studied family of paraconsistent C-systems, they differ from (...) most other C-systems in having the important replacement property. We further show that B is a very robust C-system in the sense that almost any axiom which has been considered in the context of C-systems is either already a theorem of B or its addition to B leads to a logic that is no longer paraconsistent. There is exactly one notable exception, and the result of adding this exception to B leads to the other logic studied here, S5. (shrink)

A general meta-logical theory is developed by considering ontological disputes in the systems of metaphysics. The usefulness of this general meta-logical theory is demonstrated by considering the case of the ontological dispute between the metaphysical systems of Lewis’ Modal Realism and Terence Parsons’ Meinongianism. Using Quine’s criterion of ontological commitments and his views on ontological disagreement, three principles of metalogic is formulated. Based on the three principles of metalogic, the notions of independent variable and dependent variable are introduced. Then, the (...) ontological dispute between Lewis’ Modal Realism and Terence Parsons’ Meinongianism are restated in the light of the principles of metalogic. After the restatement, Independent variable and dependent variables are fixed in both Lewis’ Modal Realism and Terence Parsons’ Meinongianism to resolve the dispute. Subsequently, a new variety of quantifiers are introduced which is known as functionally isomorphic quantifiers to provide a formal representation of the resolution of the dispute. The specific functionally isomorphic quantifier which is developed in this work is known as st-quantifier. It is indicated that how st-quantifier which is one of the functionally isomorphic quantifiers can function like existential quantifier. It is also shown that there is some kind of inconsistency which is unavoidable in stating the ontological disagreement and therefore, paraconsistent logic is a requirement in stating the ontological disputes. (shrink)

In this paper, we deal with the problem of putting together modal worlds that operate in different logic systems. When evaluating a modal sentence $\Box \varphi $, we argue that it is not sufficient to inspect the truth of $\varphi $ in accessed worlds (possibly in different logics). Instead, ways of transferring more subtle semantic information between logical systems must be established. Thus, we will introduce modal structures that accommodate communication between logic systems by fixing a common lattice $L$ that (...) contains as sublattices the semantics operating in each world. The value of a formula $\Box \varphi $ in a world with lattice $L^{\prime}$ will be defined in terms of the values of $\varphi $ in accessible worlds relativized to $L^{\prime}$ using the common order of $L$. We will investigate natural instances where formulas $\varphi $ can be said to be necessary/possible even though all the accessible world falsify $\varphi $. Further, we will discuss frames that characterize dynamic relations between logic systems: classically increasing, classically decreasing and dialectic frames. Finally, we formalize the semantics of considering worlds operating in classical logic or logic of paradox, exemplifying the kind of issue one should face in this kind of formalization. (shrink)

Priest, argues that classical reasoning can be made compatible with his preferred logical theory by proposing a methodological maxim authorizing the use of classical logic in consistent situations. Although Priest has abandoned this proposal in favour of the one in G. Priest, I shall argue that due to the fact that the derivability adjustment theorem holds for several logics of formal consistency, these paraconsistent logics are particularly well suited to accommodate classical reasoning by means of a version of that maxim, (...) yielding thus an enthymematic account of classical recapture. (shrink)