Joao Marcos

This paper introduces new logical systems which axiomatize a formal representation of inconsistency (here taken to be equivalent to contradictoriness) in classical logic. We start from an intuitive semantical account of inconsistent data, fixing some basic requirements, and provide two distinct sound and complete axiomatics for such semantics, LFI1 and LFI2, as well as their first-order extensions, LFI1* and LFI2*, depending on which additional requirements are considered. These formal systems are examples of what we dub Logics of Formal Inconsistency (LFI) and form part of a much larger family of similar logics. We also show that there are translations from classical and paraconsistent first-order logics into LFI1* and LFI2*, and back. Hence, despite their status as subsystems of classical logic, LFI1* and LFI2* can codify any classical or paraconsistent reasoning.

What is the fundamental insight behind truth-functionality ? When is a logic interpretable by way of a truth-functional semantics? To address such questions in a satisfactory way, a formal definition of truth-functionality from the point of view of abstract logics is clearly called for. As a matter of fact, such a definition has been available at least since the 70s, though to this day it still remains not very widely well-known. A clear distinction can be drawn between logics characterizable through: (1) genuinely finite-valued truth-tabular semantics; (2) no finite-valued but only an infinite-valued truthtabular semantics; (3) no truth-tabular semantics at all. Any of those logics, however, can in principle be characterized through non-truth-functional valuation semantics, at least as soon as their associated consequence relations respect the usual tarskian postulates. So, paradoxical as that might seem at first, it turns out that truth-functional logics may be adequately characterized by non-truth-functional semantics . Now, what feature of a given logic would guarantee it to dwell in class (1) or in class (2), irrespective of its circumstantial semantic characterization?

We say that things happen accidentally when they do indeed happen, but only by chance. In the opposite situation, an essential happening is inescapable, its inevitability being the sine qua non for its very occurrence. This paper will investigate modal logics on a language tailored to talk about essential and accidental statements. Completeness of some among the weakest and the strongest such systems is attained. The weak expressibility of the classical propositional language enriched with the non-normal modal operators of essence and accident is highlighted and illustrated, both with respect to the definability of the more usual modal operators as well as with respect to the characterizability of classes of frames. Several interesting problems and directions are left open for exploration.

In many real-life applications of logic it is useful to interpret a particular sentence as true together with its negation. If we are talking about classical logic, this situation would force all other sentences to be equally interpreted as true. Paraconsistent logics are exactly those logics that escape this explosive effect of the presence of inconsistencies and allow for sensible reasoning still to take effect. To provide reasonably intuitive semantics for paraconsistent logics has traditionally proven to be a challenge. Possible-translations semantics can meet that challenge by allowing for each interpretation to be composed of multiple scenarios. Using that idea, a logic with a complex semantic behavior can be understood as an appropriate combination of ingredient logics with simpler semantic behaviors into which the original logic is given a collection of translations preserving its soundness. Completeness is then achieved through the judicious choice of the admissible translating mappings. The present note provides interpretation by way of possible-translations semantics for a group of fundamental paraconsistent logics extending the positive fragment of classical propositional logic. The logics PI, Cmin, mbC, bC, mCi and Ci, among others, are all initially presented through their non-truth-functional bivaluation semantics and sequent versions and then split by way of possible-translations semantics based on 3-valued ingredients.

Besides the better-known Nelson logic and paraconsistent Nelson logic, in 1959 David Nelson introduced, with motivations of realizability and constructibility, a logic called $\mathcal{S}$. The logic $\mathcal{S}$ was originally presented by means of a calculus with infinitely many rule schemata and no semantics. We look here at the propositional fragment of $\mathcal{S}$, showing that it is algebraizable, in the sense of Blok and Pigozzi, with respect to a variety of three-potent involutive residuated lattices. We thus introduce the first known algebraic semantics for $\mathcal{S}$ as well as a finite Hilbert-style calculus equivalent to Nelson’s presentation; this also allows us to clarify the relation between $\mathcal{S}$ and the other two Nelson logics $\mathcal{N}3$ and $\mathcal{N}4$.

In classical logic, a contradiction allows one to derive every other sentence of the underlying language; paraconsistent logics came relatively recently to subvert this explosive principle, by allowing for the subsistence of contradictory yet non-trivial theories. Therefore our surprise to find Wittgenstein, already at the 1930s, in comments and lectures delivered on the foundations of mathematics, as well as in other writings, counseling a certain tolerance on what concerns the presence of contradictions in a mathematical system. ‘Contradiction. Why just this spectre? This is really very suspicious.’ ( Philosophical Remarks III–56) In the last decades, several authors (e.g. Arrington, Hintikka, Van Heijenoort, Wright, Wrigley) have been digging into Wittgenstein’s rather non-standard standpoint on what concerns the interpretation and import of contradiction in logic and mathematics, and many other authors (e.g. da Costa, Goldstein, Granger, Marconi) have been investigating the possibility of taking Wittgenstein seriously as one of the early forerunners of paraconsistency. While many advances have been made on the first front, the second set of investigations has led almost exclusively to negative results: no, no operational proposal about the construction of a logic in which (some) contradictions are made inoffensive can be read from Wittgenstein’s philosophical work; in fact, it appears that the most one can find there is the exhortation for mathematicians to alter their attitude with respect to contradictions and to consistency proofs. The play is done, and one looks for a resume of the opera. This paper fills that blank, as a thorough investigation of the possible relations between Wittgenstein and paraconsistency. DOI:10.5007/1808-1711.2010v14n1p135

This paper discusses how to define logics as deductive limits of sequences of other logics. The case of da Costa's hierarchy of increasingly weaker paraconsistent calculi, known as $ \mathcal {C}$n, 1 $ \leq$ n $ \leq$ $ \omega$, is carefully studied. The calculus $ \mathcal {C}$$\scriptstyle \omega$, in particular, constitutes no more than a lower deductive bound to this hierarchy and differs considerably from its companions. A long standing problem in the literature (open for more than 35 years) is to define the deductive limit to this hierarchy, that is, its greatest lower deductive bound. The calculus $ \mathcal {C}$min, stronger than $ \mathcal {C}$$\scriptstyle \omega$, is first presented as a step toward this limit. As an alternative to the bivaluation semantics of $ \mathcal {C}$min presented thereupon, possible-translations semantics are then introduced and suggested as the standard technique both to give this calculus a more reasonable semantics and to derive some interesting properties about it. Possible-translations semantics are then used to provide both a semantics and a decision procedure for $ \mathcal {C}$Lim, the real deductive limit of da Costa's hierarchy. Possible-translations semantics also make it possible to characterize a precise sense of duality: as an example, $ \mathcal {D}$min is proposed as the dual to $ \mathcal {C}$min.

The standard notion of formal theory, in logic, is in general biased exclusively towards assertion: it commonly refers only to collections of assertions that any agent who accepts the generating axioms of the theory should also be committed to accept. In reviewing the main abstract approaches to the study of logical consequence, we point out why this notion of theory is unsatisfactory at multiple levels, and introduce a novel notion of theory that attacks the shortcomings of the received notion by allowing one to take both assertions and denials on a par. This novel notion of theory is based on a bilateralist approach to consequence operators, which we hereby introduce, and whose main properties we investigate in the present paper.

An overcomplete logic is a logic that ‘ceases to make the difference’: According to such a logic, all inferences hold independently of the nature of the statements involved. A negation-inconsistent logic is a logic having at least one model that satisfies both some statement and its negation. A negation-incomplete logic has at least one model according to which neither some statement nor its negation are satisfied. Paraconsistent logics are negation-inconsistent yet non-overcomplete; paracomplete logics are negation-incomplete yet non-overcomplete. A paranormal logic is simply a logic that is both paraconsistent and paracomplete. Despite being perfectly consistent and complete with respect to classical negation, nearly every normal modal logic, in its ordinary language and interpretation, admits to some latent paranormality: It is paracomplete with respect to a negation defined as an impossibility operator, and paraconsistent with respect to a negation defined as non-necessity. In fact, as it will be shown here, even in languages without a primitive classical negation, normal modal logics can often be alternatively characterized directly by way of their paranormal negations and related operators. So, instead of talking about ‘necessity’, ‘possibility’, and so on, modal logics could be seen just as devices tailored for the study of (modal) negation. This paper shows how and to what extent this alternative characterization of modal logics can be realized.

We study a modal language for negative operators—an intuitionistic-like negation and its paraconsistent dual—added to (bounded) distributive lattices. For each non-classical negation an extra operator is hereby adjoined in order to allow for standard logical inferences to be opportunely restored. We present abstract characterizations and exhibit the main properties of each kind of negative modality, as well as of the associated connectives that express consistency and determinedness at the object-language level. Appropriate sequent-style proof systems and adequate kripke semantics are also introduced, characterizing the minimal normal logic and a few other basic logics containing such negative modalities and their companions.

Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate semantics and proof systems, whose philosophical interpretations and computational properties are found wanting. In this paper we investigate congruential non-classical negations that live inside very natural systems of normal modal logics over complete distributive lattices; these logics are further enriched by adjustment connectives that may be used for handling reasoning under uncertainty caused by inconsistency or undeterminedness. Using such straightforward semantics, we study the classes of frames characterized by seriality, reflexivity, functionality, symmetry, transitivity, and some combinations thereof, and discuss what they reveal about sub-classical properties of negation. To the logics thereby characterized we apply a general mechanism that allows one to endow them with analytic ordinary sequent systems, most of which are even cut-free. We also investigate the exact circumstances that allow for classical negation to be explicitly defined inside our logics.

In classical logic, a contradiction allows one to derive every other sentence of the underlying language; paraconsistent logics came relatively recently to subvert this explosive principle, by allowing for the subsistence of contradictory yet non-trivial theories. Therefore our surprise to find Wittgenstein, already at the 1930s, in comments and lectures delivered on the foundations of mathematics, as well as in other writings, counseling a certain tolerance on what concerns the presence of contradictions in a mathematical system. ‘Contradiction. Why just this spectre? This is really very suspicious.’ (Philosophical Remarks III–56) In the last decades, several authors (e.g. Arrington, Hintikka, Van Heijenoort, Wright, Wrigley) have been digging into Wittgenstein’s rather non-standard standpoint on what concerns the interpretation and import of contradiction in logic and mathematics, and many other authors (e.g. da Costa, Goldstein, Granger, Marconi) have been investigating the possibility of taking Wittgenstein seriously as one of the early forerunners of paraconsistency. While many advances have been made on the first front, the second set of investigations has led almost exclusively to negative results: no, no operational proposal about the construction of a logic in which (some) contradictions are made inoffensive can be read from Wittgenstein’s philosophical work; in fact, it appears that the most one can find there is the exhortation for mathematicians to alter their attitude with respect to contradictions and to consistency proofs. The play is done, and one looks for a resume of the opera. This paper fills that blank, as a thorough investigation of the possible relations between Wittgenstein and paraconsistency.

In classical logic, a contradiction allows one to derive every other sentence of the underlying language; paraconsistent logics came relatively recently to subvert this explosive principle, by allowing for the subsistence of contradictory yet non-trivial theories. Therefore our surprise to find Wittgenstein, already at the 1930s, in comments and lectures delivered on the foundations of mathematics, as well as in other writings, counseling a certain tolerance on what concerns the presence of contradictions in a mathematical system. ‘Contradiction. Why just this spectre? This is really very suspicious.’ In the last decades, several authors have been digging into Wittgenstein’s rather non-standard standpoint on what concerns the interpretation and import of contradiction in logic and mathematics, and many other authors have been investigating the possibility of taking Wittgenstein seriously as one of the early forerunners of paraconsistency. While many advances have been made on the first front, the second set of investigations has led almost exclusively to negative results: no, no operational proposal about the construction of a logic in which contradictions are made inoffensive can be read from Wittgenstein’s philosophical work; in fact, it appears that the most one can find there is the exhortation for mathematicians to alter their attitude with respect to contradictions and to consistency proofs. The play is done, and one looks for a resume of the opera. This paper fills that blank, as a thorough investigation of the possible relations between Wittgenstein and paraconsistency. • DOI:10.5007/1808-1711.2010v14n1p135.

The Polish logician Roman Suszko has extensively pleaded in the 1970s for a restatement of the notion of many-valuedness. According to him, as he would often repeat, “there are but two logical values, true and false.” As a matter of fact, a result by W´ojcicki-Lindenbaum shows that any tarskian logic has a many-valued semantics, and results by Suszko-da Costa-Scott show that any many-valued semantics can be reduced to a two-valued one. So, why should one even consider using logics with more than two values? Because, we argue, one has to decide how to deal with bivalence and settle down the tradeoff between logical 2-valuedness and truth-functionality, from a pragmatical standpoint. This paper will illustrate the ups and downs of a two-valued reduction of logic. Suszko’s reductive result is quite non-constructive.We will exhibit here a way of effectively constructing the two-valued semantics of any logic that has a truth-functional finite-valued semantics and a sufficiently expressive language. From there, as we will indicate, one can easily go on to provide those logics with adequate canonical systems of sequents or tableaux. The algorithmic methods developed here can be generalized so as to apply to many non-finitely valued logics as well —or at least to those that admit of computable quasi tabular two-valued semantics, the so-called dyadic semantics.