Marcelo E. Coniglio

The Logics of Deontic (In)Consistency (LDI's) can be considered as the deontic counterpart of the paraconsistent logics known as Logics of Formal (In)Consistency. This paper introduces and studies new LDI's and other paraconsistent deontic logics with different properties: systems tolerant to contradictory obligations; systems in which contradictory obligations trivialize; and a bimodal paraconsistent deontic logic combining the features of previous systems. These logics are used to analyze the well-known Chisholm's paradox, taking profit of the fact that, besides contradictory obligations do not trivialize in LDI's, several logical dependencies of classical logic are blocked in the context of LDI's, allowing to dissolve the paradox.

In this paper we propose a very general denition of combination of logics by means of the concept of sheaves of logics. We first discuss some properties of this general definition and list some problems, as well as connections to related work. As applications of our abstract setting, we show that the notion of possible-translations semantics, introduced in previous papers by the first author, can be described in categorial terms. Possible-translations semantics constitute illustrative cases, since they provide a new semantical account for abstract logical systems, particularly for many-valued and paraconsistent logics.

This article proposes the meeting of fuzzy logic with paraconsistency in a very precise and foundational way. Specifically, in this article we introduce expansions of the fuzzy logic MTL by means of primitive operators for consistency and inconsistency in the style of the so-called Logics of Formal Inconsistency (LFIs). The main novelty of the present approach is the definition of postulates for this type of operators over MTL-algebras, leading to the definition and axiomatization of a family of logics, expansions of MTL, whose degree-preserving counterpart are paraconsistent and moreover LFIs.

A graph-theoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as a multi-graph (m-graph) where the nodes and the m-edges include the sorts and the constructors of the signatures at hand. Fibring of two models is a multi-graph (m-graph) where the nodes and the m-edges are the values and the operations in the models, respectively. Fibring of two deductive systems is an m-graph whose nodes are language expressions and the m-edges represent the inference rules of the two original systems. The sobriety of the approach is confirmed by proving that all the fibring notions are universal constructions. This graph-theoretic view is general enough to accommodate very different fibrings of propositional based logics encompassing logics with non-deterministic semantics, logics with an algebraic semantics, logics with partial semantics and substructural logics, among others. Soundness and weak completeness are proved to be preserved under very general conditions. Strong completeness is also shown to be preserved under tighter conditions. In this setting, the collapsing problem appearing in several combinations of logic systems can be avoided.

The relationship between q-spaces (c.f. [9]) and quantum spaces (c.f. [5]) is studied, proving that both models coincide in the case of Spec A, the spectrum of a non-commutative C*-algebra A. It is shown that a sober T 1 quantum space is a classical topological space. This difficulty is circumvented through a new definition of point in a quantale. With this new definition, it is proved that Lid A has enough points. A notion of orthogonality in quantum spaces is introduced, which permits us to express the usual topological properties of separation. The notion of stalks of sheaves over quantales is introduced, and some results in categorial model theory are obtained.

This paper investigates the question of characterizing first-order LFIs (logics of formal inconsistency) by means of two-valued semantics. LFIs are powerful paraconsistent logics that encode classical logic and permit a finer distinction between contradictions and inconsistencies, with a deep involvement in philosophical and foundational questions. Although focused on just one particular case, namely, the quantified logic QmbC, the method proposed here is completely general for this kind of logics, and can be easily extended to a large family of quantified paraconsistent logics, supplying a sound and complete semantical interpretation for such logics. However, certain subtleties involving term substitution and replacement, that are hidden in classical structures, have to be taken into account when one ventures into the realm of nonclassical reasoning. This paper shows how such difficulties can be overcome, and offers detailed proofs showing that a smooth treatment of semantical characterization can be given to all such logics. Although the paper is well-endowed in technical details and results, it has a significant philosophical aside: it shows how slight extensions of classical methods can be used to construct the basic model theory of logics that are weaker than traditional logic due to the absence of certain rules present in classical logic. Several such logics, however, as in the case of the LFIs treated here, are notorious for their wealth of models precisely because they do not make indiscriminate use of certain rules; these models thus require new methods. In the case of this paper, by just appealing to a refined version of the Principle of Explosion, or Pseudo-Scotus, some new constructions and crafty solutions to certain non-obvious subtleties are proposed. The result is that a richer extension of model theory can be inaugurated, with interest not only for paraconsistency, but hopefully to other enlargements of traditional logic.

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.

In 1986, Mikenberg et al. introduced the semantic notion of quasi-truth defined by means of partial structures. In such structures, the predicates are seen as triples of pairwise disjoint sets: the set of tuples which satisfies, does not satisfy and can satisfy or not the predicate, respectively. The syntactical counterpart of the logic of partial truth is a rather complicated first-order modal logic. In the present article, the notion of predicates as triples is recursively extended, in a natural way, to any complex formula of the first-order object language. From this, a new definition of quasi-truth is obtained. The proof-theoretic counterpart of the new semantics is a first-order paraconsistent logic whose propositional base is a 3-valued logic belonging to hierarchy of paraconsistent logics known as Logics of Formal Inconsistency, which was proposed by Carnielli and Marcos in 2002.

Society Semantics, introduced by W. Carnielli and M. Lima-Marques, is a method for obtaining new logics from the combination of agents of a given logic. The goal of this paper is to present several generalizations of this method, as well as to show some applications to many-valued logics. After a reformulation of Society Semantics in a wider setting, we develop in detail two examples of application of the new formalism, characterizing a hierarchy of paraconsistent logics called Pn and a hierarchy of paracomplete logics In. We also propose three further generalizations, obtaining Society Semantics for several many-valued logics, including a hierarchy of logics called In Pk which are both paraconsistent and paracomplete.

Trying to overcome Dugundji’s result on uncharacterisability of modal logics by finite logical matrices, Kearns and Ivlev proposed, independently, a characterisation of some modal systems by means of four-valued multivalued truth-functions , as an alternative to Kripke semantics. This constitutes an antecedent of the non-deterministic matrices introduced by Avron and Lev . In this paper we propose a reconstruction of Kearns’s and Ivlev’s results in a uniform way, obtaining an extension to another modal systems. The first part of the paper is devoted to four-valued Nmatrices, including Kearns’s and Ivlev’s. Besides proving with full details Kearns’s results for T, S4 and S5, we also obtain a characterisation of the system B by four-valued Nmatrices with level valuations. Concerning Ivlev’s results, two new modal systems are introduced and char..

Although a very recent topic in contemporary logic, the subject of combinations of logics has already shown its deep possibilities. Besides the pure philosophical interest offered by the possibility of defining mixed logic systems in which distinct operators obey logics of different nature, there are also several pragmatical and methodological reasons for considering combined logics. We survey methods for combining logics (integration of several logic systems into a homogeneous environment) as well as methods for decomposing logics, showing their interesting properties and applications.