João Rasga

Orcid: 0000-0002-1239-8496

According to our database1, João Rasga authored at least 35 papers between 2002 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Conservative Translations Revisited.
J. Philos. Log., June, 2023

2022
Adding abductive reasoning to a propositional logic.
J. Log. Comput., 2022

2021
Event-Based Time-Stamped Claim Logic.
J. Log. Algebraic Methods Program., 2021

Time-stamped claim logic.
Log. J. IGPL, 2021

Revisiting separation: Algorithms and complexity.
Log. J. IGPL, 2021

Reduction Techniques for Proving Decidability in Logics and their Meet-Combination.
Bull. Symb. Log., 2021

2020
Essential Structure of Proofs as a Measure of Complexity.
Logica Universalis, 2020

2019
Probabilistic logic of quantum observations.
Log. J. IGPL, 2019

2018
Many-Sorted Equivalence of Shiny and Strongly Polite Theories.
J. Autom. Reason., 2018

Kolmogorov One-Way Functions Revisited.
Cryptogr., 2018

2017
Decision and optimization problems in the unreliable-circuit logic.
Log. J. IGPL, 2017

2016
Preservation of Admissible Rules when Combining Logics.
Rev. Symb. Log., 2016

2014
Fibring as Biporting Subsumes Asymmetric Combinations.
Stud Logica, 2014

Craig Interpolation in the Presence of Unreliable Connectives.
Logica Universalis, 2014

Approximate reasoning about logic circuits with single-fan-out unreliable gates.
J. Log. Comput., 2014

2013
Importing Logics: Soundness and Completeness Preservation.
Stud Logica, 2013

Completeness and interpolation of almost-everywhere quantification over finitely additive measures.
Math. Log. Q., 2013

Preservation of Craig interpolation by the product of matrix logics.
J. Appl. Log., 2013

Revisiting the Equivalence of Shininess and Politeness.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

2012
Importing Logics.
Stud Logica, 2012

On meet-combination of logics.
J. Log. Comput., 2012

2011
On Combined Connectives.
Logica Universalis, 2011

2010
Fusion of sequent modal logic systems labelled with truth values.
Log. J. IGPL, 2010

2009
Interpolation via translations.
Math. Log. Q., 2009

On Graph-theoretic Fibring of Logics.
J. Log. Comput., 2009

A Graph-theoretic Account of Logics.
J. Log. Comput., 2009

2008
Complete Axiomatization of Discrete-Measure Almost-Everywhere Quantification.
J. Log. Comput., 2008

Preservation of Interpolation Features by Fibring.
J. Log. Comput., 2008

2007
Sufficient conditions for cut elimination with complexity analysis.
Ann. Pure Appl. Log., 2007

Transfering Proofs of Zero-Knowledge Systems with Quantum Correlations.
Proceedings of the First International Conference on Quantum, Nano, and Micro Technologies, 2007

2005
Modal Sequent Calculi Labelled with Truth Values: Cut Elimination.
Log. J. IGPL, 2005

2003
Truth-values as Labels: A General Recipe for Labelled Deduction.
J. Appl. Non Class. Logics, 2003

2002
Fibring Labelled Deduction Systems.
J. Log. Comput., 2002

Modulated Fibring and The Collapsing Problem.
J. Symb. Log., 2002

Labelled Deduction over Algebras of Truth-Values.
Proceedings of the Frontiers of Combining Systems, 4th International Workshop, 2002


  Loading...