Switch to: References

Add citations

You must login to add citations.
  1. Logics of Formal Inconsistency Enriched with Replacement: An Algebraic and Modal Account.Walter Carnielli, Marcelo E. Coniglio & David Fuenmayor - forthcoming - Review of Symbolic Logic.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Combining Logics.Walter Carnielli & Marcelo E. Coniglio - 2008 - Stanford Encyclopedia of Philosophy.
    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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Interpolation Via Translations.João Rasga, Walter Carnielli & Cristina Sernadas - 2009 - Mathematical Logic Quarterly 55 (5):515-534.
    A new technique is presented for proving that a consequence system enjoys Craig interpolation or Maehara interpolation based on the fact that these properties hold in another consequence system. This technique is based on the existence of a back and forth translation satisfying some properties between the consequence systems. Some examples of translations satisfying those properties are described. Namely a translation between the global/local consequence systems induced by fragments of linear logic, a Kolmogorov-Gentzen-Gödel style translation, and a new translation between (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Reduction Techniques for Proving Decidability in Logics and Their Meet–Combination.João Rasga, Cristina Sernadas & Walter Carnielli - 2021 - Bulletin of Symbolic Logic 27 (1):39-66.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • On Combined Connectives.A. Sernadas, C. Sernadas & J. Rasga - 2011 - Logica Universalis 5 (2):205-224.
    Combined connectives arise in combined logics. In fibrings, such combined connectives are known as shared connectives and inherit the logical properties of each component. A new way of combining connectives (and other language constructors of propositional nature) is proposed by inheriting only the common logical properties of the components. A sound and complete calculus is provided for reasoning about the latter. The calculus is shown to be a conservative extension of the original calculus. Examples are provided contributing to a better (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Fibring as Biporting Subsumes Asymmetric Combinations.J. Rasga, A. Sernadas & C. Sernadas - 2014 - Studia Logica 102 (5):1041-1074.
    The transference of preservation results between importing and unconstrained fibring is investigated. For that purpose, a new formulation of fibring, called biporting, is introduced, and importing is shown to be subsumed by biporting. In consequence, particular cases of importing, like temporalization, modalization and globalization are subsumed by fibring. Capitalizing on these results, the preservation of the finite model property by fibring is transferred to importing and then carried over to globalization.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Fibring Non-Truth-Functional Logics: Completeness Preservation.C. Caleiro, W. A. Carnielli, M. E. Coniglio, A. Sernadas & C. Sernadas - 2003 - Journal of Logic, Language and Information 12 (2):183-211.
    Fibring has been shown to be useful for combining logics endowed withtruth-functional semantics. However, the techniques used so far are unableto cope with fibring of logics endowed with non-truth-functional semanticsas, for example, paraconsistent logics. The first main contribution of thepaper is the development of a suitable abstract notion of logic, that mayalso encompass systems with non-truth-functional connectives, and wherefibring can still be dealt with. Furthermore, it is shown that thisextended notion of fibring preserves completeness under certain reasonableconditions. This completeness transfer (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • Juxtaposition: A New Way to Combine Logics.Joshua Schechter - 2011 - Review of Symbolic Logic 4 (4):560-606.
    This paper develops a new framework for combining propositional logics, called "juxtaposition". Several general metalogical theorems are proved concerning the combination of logics by juxtaposition. In particular, it is shown that under reasonable conditions, juxtaposition preserves strong soundness. Under reasonable conditions, the juxtaposition of two consequence relations is a conservative extension of each of them. A general strong completeness result is proved. The paper then examines the philosophically important case of the combination of classical and intuitionist logics. Particular attention is (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • On Graph-Theoretic Fibring of Logics.A. Sernadas, C. Sernadas, J. Rasga & M. Coniglio - 2009 - Journal of Logic and Computation 19 (6):1321-1357.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Combining Valuations with Society Semantics.Víctor L. Fernández & Marcelo E. Coniglio - 2003 - Journal of Applied Non-Classical Logics 13 (1):21-46.
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Truth-Values as Labels: A General Recipe for Labelled Deduction.Cristina Sernadas, Luca Viganò, João Rasga & Amílcar Sernadas - 2003 - Journal of Applied Non-Classical Logics 13 (3-4):277-315.
    We introduce a general recipe for presenting non-classical logics in a modular and uniform way as labelled deduction systems. Our recipe is based on a labelling mechanism where labels are general entities that are present, in one way or another, in all logics, namely truth-values. More specifically, the main idea underlying our approach is the use of algebras of truth-values, whose operators reflect the semantics we have in mind, as the labelling algebras of our labelled deduction systems. The “truth-values as (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  • Preservation of Admissible Rules When Combining Logics.João Rasga, Cristina Sernadas & Amílcar Sernadas - 2016 - Review of Symbolic Logic 9 (4):641-663.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Algebraizable Logics and a Functorial Encoding of its Morphisms.Darllan Conceição Pinto & Hugo Luiz Mariano - 2017 - Logic Journal of the IGPL 25 (4):524-561.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Fusion of Sequent Modal Logic Systems Labelled with Truth Values.João Rasga, Karina Roggia & Cristina Sernadas - 2010 - Logic Journal of the IGPL 18 (6):893-920.
    Fusion is a well-known form of combining normal modal logics endowed with a Hilbert calculi and a Kripke semantics. Herein, fusion is studied over logic systems using sequent calculi labelled with truth values and with a semantics based on a two-sorted algebra allowing, in particular, the representation of general Kripke structures. A wide variety of logics, including non-classical logics like, for instance, modal logics and intuitionistic logic can be presented by logic systems of this kind. A categorical approach of fusion (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Decidability and Complexity of Fibred Logics Without Shared Connectives.Sérgio Marcelino & Carlos Caleiro - 2016 - Logic Journal of the IGPL 24 (5).
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation