15 found
Order:
Disambiguations
Carlos Caleiro [15]C. Caleiro [3]
  1.  41
    Behavioral Algebraization of Logics.Carlos Caleiro, Ricardo Gonçalves & Manuel Martins - 2009 - Studia Logica 91 (1):63-111.
    We introduce and study a new approach to the theory of abstract algebraic logic (AAL) that explores the use of many-sorted behavioral logic in the role traditionally played by unsorted equational logic. Our aim is to extend the range of applicability of AAL toward providing a meaningful algebraic counterpart also to logics with a many-sorted language, and possibly including non-truth-functional connectives. The proposed behavioral approach covers logics which are not algebraizable according to the standard approach, while also bringing a new (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  2. Two's Company: The Humbug of Many Logical Values.Carlos Caleiro, Walter Carnielli, Marcelo Coniglio & João Marcos - 2005 - In J. Y. Beziau (ed.), Logica Universalis. Birkhäuser Verlag. pp. 169-189.
    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 (...)
     
    Export citation  
     
    My bibliography   7 citations  
  3.  25
    Fibring Non-Truth-Functional Logics: Completeness Preservation. [REVIEW]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 (7 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  4.  41
    From Fibring to Cryptofibring. A Solution to the Collapsing Problem.Carlos Caleiro & Jaime Ramos - 2007 - Logica Universalis 1 (1):71-92.
    . The semantic collapse problem is perhaps the main difficulty associated to the very powerful mechanism for combining logics known as fibring. In this paper we propose cryptofibred semantics as a generalization of fibred semantics, and show that it provides a solution to the collapsing problem. In particular, given that the collapsing problem is a special case of failure of conservativeness, we formulate and prove a sufficient condition for cryptofibring to yield a conservative extension of the logics being combined. For (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  5.  6
    And C. Sernadas/Fibring Non-Truth-Functional Logics: Completeness Preservation 183–211 Kentaro Kikuchi and Katsumi Sasaki/a Cut-Free Gentzen Formulation of Basic Propositional Calculus 213–225. [REVIEW]C. Caleiro, W. A. Carnielli & M. E. Coniglio - 2003 - Journal of Logic, Language and Information 12:533-535.
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  6.  42
    On the Mosaic Method for Many-Dimensional Modal Logics: A Case Study Combining Tense and Modal Operators. [REVIEW]Carlos Caleiro, Luca Viganò & Marco Volpe - 2013 - Logica Universalis 7 (1):33-69.
    We present an extension of the mosaic method aimed at capturing many-dimensional modal logics. As a proof-of-concept, we define the method for logics arising from the combination of linear tense operators with an “orthogonal” S5-like modality. We show that the existence of a model for a given set of formulas is equivalent to the existence of a suitable set of partial models, called mosaics, and apply the technique not only in obtaining a proof of decidability and a proof of completeness (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  7.  18
    Synchronization of Logics.Amílcar Sernadas, Cristina Sernadas & Carlos Caleiro - 1997 - Studia Logica 59 (2):217-247.
    Motivated by applications in software engineering, we propose two forms of combination of logics: synchronization on formulae and synchronization on models. We start by reviewing satisfaction systems, consequence systems, one-step derivation systems and theory spaces, as well as their functorial relationships. We define the synchronization on formulae of two consequence systems and provide a categorial characterization of the construction. For illustration we consider the synchronization of linear temporal logic and equational logic. We define the synchronization on models of two satisfaction (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  8.  4
    Compositional Meaning in Logic.Carlos Caleiro & Luca Viganò - 2017 - Logica Universalis 11 (3):283-295.
    The Fregean-inspired Principle of Compositionality of Meaning for formal languages asserts that the meaning of a compound expression is analysable in terms of the meaning of its constituents, taking into account the mode in which these constituents are combined so as to form the compound expression. From a logical point of view, this amounts to prescribing a constraint—that may or may not be respected—on the internal mechanisms that build and give meaning to a given formal system. Within the domain of (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  9.  17
    Index of Authors of Volume 12.D. Ahn, G. Ben-Avi, D. Ben Shalom, Ph Besnard, K. Borthen, C. Caleiro, W. A. Carnielli, M. E. Coniglio, R. Cooper & N. Dimitri - 2003 - Journal of Logic, Language and Information 12 (531):531.
  10.  13
    Abstract Valuation Semantics.Carlos Caleiro & Ricardo Gonçalves - 2013 - Studia Logica 101 (4):677-712.
    We define and study abstract valuation semantics for logics, an algebraically well-behaved version of valuation semantics. Then, in the context of the behavioral approach to the algebraization of logics, we show, by means of meaningful bridge theorems and application examples, that abstract valuations are suited to play a role similar to the one played by logical matrices in the traditional approach to algebraization.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  11.  6
    16th Workshop on Logic, Language, Information and Computation (WoLLIC 2009).Hans Tompits, Ken Satoh, Arnold Beckmann, Carlos Caleiro, Thomas Eiter, Sylvain Salvati, Taisuke Sato & Frank Wolter - 2010 - Bulletin of Symbolic Logic 16 (1):805-815.
  12.  6
    Behavioral Algebraization of da Costa's C-Systems.Carlos Caleiro & Ricardo Gonçalves - 2009 - Journal of Applied Non-Classical Logics 19 (2):127-148.
  13.  3
    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  
     
    My bibliography  
  14.  4
    Petrópolis, Rio de Janeiro, Brazil May 9–13, 2011.Carlos Areces, Carlos Caleiro & Gregory Chaitin - 2012 - Bulletin of Symbolic Logic 18 (1).
  15.  3
    XIV Latin American Symposium on Mathematical Logic (SLALM)(Vol 15, Pg 332, 2009).Carlos Caleiro & Ricardo Goncalves - 2010 - Bulletin of Symbolic Logic 16 (1):332-376.