Switch to: Citations

Add references

You must login to add references.
  1. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Limits for Paraconsistent Calculi.Walter A. Carnielli & João Marcos - 1999 - Notre Dame Journal of Formal Logic 40 (3):375-390.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Bi-Heyting algebras, toposes and modalities.Gonzalo E. Reyes & Houman Zolfaghari - 1996 - Journal of Philosophical Logic 25 (1):25 - 43.
    The aim of this paper is to introduce a new approach to the modal operators of necessity and possibility. This approach is based on the existence of two negations in certain lattices that we call bi-Heyting algebras. Modal operators are obtained by iterating certain combinations of these negations and going to the limit. Examples of these operators are given by means of graphs.
    Download  
     
    Export citation  
     
    Bookmark   19 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • The Logic of Contradiction.Nicolas D. Goodman - 1981 - Mathematical Logic Quarterly 27 (8-10):119-126.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Why Combine Logics?Patrick Blackburn & Maarten de Rijke - 1997 - Studia Logica 59 (1):5 - 27.
    Combining logics has become a rapidly expanding enterprise that is inspired mainly by concerns about modularity and the wish to join together tailor made logical tools into more powerful but still manageable ones. A natural question is whether it offers anything new over and above existing standard languages. By analysing a number of applications where combined logics arise, we argue that combined logics are a potentially valuable tool in applied logic, and that endorsements of standard languages often miss the point. (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • A Treatise on Many-Valued Logic.Siegfried Gottwald - 2001 - Research Studies Press.
    A growing interest in many-valued logic has developed which to a large extent is based on applications, intended as well as already realised ones. These applications range from the field of computer science, e.g. in the areas of automated theorem proving, approximate reasoning, multi-agent systems, switching theory, and program verification, through the field of pure mathematics, e.g. in independence of consistency proofs, in generalized set theories, or in the theory of particular algebraic structures, into the fields of humanities, linguistics and (...)
    Download  
     
    Export citation  
     
    Bookmark   52 citations  
  • Fibring Logics.Dov M. Gabbay - 2000 - Studia Logica 66 (3):440-443.
    Download  
     
    Export citation  
     
    Bookmark   21 citations