10 found
Order:
1. Alberto Zanardo, Amilcar Sernadas & Cristina Sernadas (2001). Fibring: Completeness Preservation. Journal of Symbolic Logic 66 (1):414-439.
A completeness theorem is established for logics with congruence endowed with general semantics (in the style of general frames). As a corollary, completeness is shown to be preserved by fibring logics with congruence provided that congruence is retained in the resulting logic. The class of logics with equivalence is shown to be closed under fibring and to be included in the class of logics with congruence. Thus, completeness is shown to be preserved by fibring logics with equivalence and general semantics. (...)

Export citation

My bibliography   6 citations
2. João Rasga, Amílcar Sernadas & Cristina Sernadas (2012). Importing Logics. Studia Logica 100 (3):545-581.
The novel notion of importing logics is introduced, subsuming as special cases several kinds of asymmetric combination mechanisms, like temporalization [8, 9], modalization [7] and exogenous enrichment [13, 5, 12, 4, 1]. The graph-theoretic approach proposed in [15] is used, but formulas are identified with irreducible paths in the signature multi-graph instead of equivalence classes of such paths, facilitating proofs involving inductions on formulas. Importing is proved to be strongly conservative. Conservative results follow as corollaries for temporalization, modalization and exogenous (...)

Export citation

My bibliography   2 citations
3. Cristina Sernadas, João Rasga & Walter A. Carnielli (2002). Modulated Fibring and the Collapsing Problem. Journal of Symbolic Logic 67 (4):1541-1569.
Fibring is recognized as one of the main mechanisms in combining logics, with great signicance in the theory and applications of mathematical logic. However, an open challenge to bring is posed by the collapsing problem: even when no symbols are shared, certain combinations of logics simply collapse to one of them, indicating that bring imposes unwanted interconnections between the given logics. Modulated bring allows a ner control of the combination, solving the collapsing problem both at the semantic and deductive levels. (...)

Export citation

My bibliography   3 citations
4. Amílcar Sernadas, Cristina Sernadas & Carlos Caleiro (1997). Synchronization of Logics. 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 (...)

Export citation

My bibliography   1 citation
5. João Rasga, Walter Carnielli & Cristina Sernadas (2009). Interpolation Via Translations. 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 (...)

Export citation

My bibliography
6. João Rasga, Wafik Boulos Lotfallah & Cristina Sernadas (2013). Completeness and Interpolation of Almost‐Everywhere Quantification Over Finitely Additive Measures. Mathematical Logic Quarterly 59 (4-5):286-302.

Export citation

My bibliography
7. Cristina Sernadas, Luca Viganò, João Rasga & Amílcar Sernadas (2003). Truth-Values as Labels: A General Recipe for Labelled Deduction. Journal of Applied Non-Classical Logics 13 (3-4):277-315.

Export citation

My bibliography
8. João Rasga, Cristina Sernadas & Amlcar Sernadas (2014). Craig Interpolation in the Presence of Unreliable Connectives. Logica Universalis 8 (3-4):423-446.
Arrow and turnstile interpolations are investigated in UCL [introduced by Sernadas et al. ], a logic that is a complete extension of classical propositional logic for reasoning about connectives that only behave as expected with a given probability. Arrow interpolation is shown to hold in general and turnstile interpolation is established under some provisos.

Export citation

My bibliography
9. Amilcar Sernadas, Cristina Sernadas & Alberto Zanardo (2002). Fibring Modal First-Order Logics: Completeness Preservation. Logic Journal of the IGPL 10 (4):413-451.
Fibring is defined as a mechanism for combining logics with a first-order base, at both the semantic and deductive levels. A completeness theorem is established for a wide class of such logics, using a variation of the Henkin method that takes advantage of the presence of equality and inequality in the logic. As a corollary, completeness is shown to be preserved when fibring logics in that class. A modal first-order logic is obtained as a fibring where neither the Barcan formula (...)