João Rasga

Dr. João Rasga

Department of Mathematics, Instituto Superior Técnico, Universidade de Lisboa, 1049-001 Lisboa, Portugal

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2002 in The Journal of Symbolic Logic
Verified
Journal Article
Closed access
PDF file
Cristina SernadasCristina Sernadas
Cristina Sernadas
João RasgaJoão Rasga
João Rasga
Walter A. CarnielliWalter A. Carnielli
Walter A. Carnielli
Fibring is recognized as one of the main mechanisms in combining logics, with great significance in the theory and applications of mathematical logic. However, an open challenge to fibring is posed by the collapsing problem: even when no symbols are shared, certain combinations of logics simply collapse to one of them, indicating that fibring imposes unwanted interconnections between the given logics. Modulated fibring allows a finer control of the combination, solving the collapsing problem both at the semantic and deductive levels. Main properties like soundness and completeness are shown to be preserved, comparison with fibring is discussed, and some important classes of examples are analyzed with respect to the collapsing problem.

11 March 2017 in Journal of Automated Reasoning
Verified
Journal Article
Closed access
PDF file
FCFilipe Casal
Filipe Casal
João RasgaJoão Rasga
João Rasga

13 December 2005
Verified
Book Chapter
Closed access
PDF file
CCC. Caleiro
C. Caleiro
João RasgaJoão Rasga
João Rasga
CSC. Sernadas
C. Sernadas
WCW. Carnielli
W. Carnielli

1 June 2002 in Journal of Logic and Computation
Verified
Journal Article
Closed access
PDF file
João RasgaJoão Rasga
João Rasga
ASAmílcar Sernadas
Amílcar Sernadas
Cristina SernadasCristina Sernadas
Cristina Sernadas
LVLuca Viganò
Luca Viganò
We give a categorial characterization of how labelled deduction systems for logics with a propositional basis behave under unconstrained fibring and under fibring that is constrained by symbol sharing. At the semantic level, we introduce a general semantics for our systems and then give a categorial characterization of fibring of models. Based on this, we establish the conditions under which our systems are sound and complete with respect to the general semantics for the corresponding logics, and establish requirements on logics and systems so that completeness is preserved by both forms of fibring.

7 October 2011 in Journal of Logic and Computation
Verified
Journal Article
Closed access
PDF file
ASA. Sernadas
A. Sernadas
Cristina SernadasCristina Sernadas
Cristina Sernadas
João RasgaJoão Rasga
João Rasga
When combining logics while imposing the sharing of connectives, the result is frequently inconsistent. In fact, in fibring, fusion and other forms of combination reported in the literature, each shared connective inherits the logical properties of each of its components. A new form of combining logics (meet-combination) is proposed where such a connective inherits only the common logical properties of its components. The conservative nature of the proposed combination is shown to hold without provisos. Preservation of soundness and completeness is also proved. Illustrations are provided involving classical, intuitionistic and modal logics.

22 April 2009 in Journal of Logic and Computation
Verified
Journal Article
Closed access
PDF file
ASAmilcar Sernadas
Amilcar Sernadas
Cristina SernadasCristina Sernadas
Cristina Sernadas
João RasgaJoão Rasga
João Rasga
Marcelo Esteban ConiglioMarcelo Esteban Coniglio
Marcelo Esteban Coniglio
A graph-theoretic account of logics is explored based on the general notion of m-graph (i.e; a graph where each edge can have a finite sequence of nodes as source). Signatures, interpretation structures and deduction systems are seen as multi-graphs (m-graphs). After defining a category freely generated by a m-graph, formulas and expressions in general can be seen as morphisms. Moreover, derivations involving rule instantiation are also morphisms. Soundness and completeness theorems are proved. As a consequence of the generality of the approach our results apply to very different logics encompassing, among others, substructural logics as well as logics with non-deterministic semantics, and subsume all logics endowed with an algebraic semantics.