activity
20162025
most citedPreservation of admissible rules when combining logics

3 citations · 5 across the 6 of their papers we have counts for

collaborators

6 papers

math.LO2025

From translations to non-collapsing logic combinations

João Rasga, Cristina Sernadas

Prawitz suggested expanding a natural deduction system for intuitionistic logic to include rules for classical logic constructors, allowing both intuitionistic and classical elemen…

cs.LO2019

Time-Stamped Claim Logic

João Rasga, Cristina Sernadas, Erisa Karafili +1

The main objective of this paper is to define a logic for reasoning about distributed time-stamped claims. Such a logic is interesting for theoretical reasons, i.e., as a logic per…

cs.LO2016

Decision and optimization problems in the Unreliable-Circuit Logic

J. Rasga, C. Sernadas, P. Mateus +1

The ambition constrained validity and the model witness problems in the logic UCL, for reasoning about circuits with unreliable gates, are analyzed. Moreover, two additional proble…

math.LO2016★ 1 cited

Probabilistic logic of quantum observations

A. Sernadas, J. Rasga, C. Sernadas +2

A probabilistic propositional logic, endowed with an epistemic component for asserting (non-)compatibility of diagonizable and bounded observables, is presented and illustrated for…

math.LO2016★ 1 cited

On probability and logic

Joao Rasga, Cristina Sernadas, Amilcar Sernadas

Within classical propositional logic, assigning probabilities to formulas is shown to be equivalent to assigning probabilities to valuations. A novel notion of probabilistic entail…

math.LO2016★ 3 cited

Preservation of admissible rules when combining logics

Joao Rasga, Cristina Sernadas, Amilcar Sernadas

Admissible rules are shown to be conservatively preserved by the meet-combination of a wide class of logics. A basis is obtained for the resulting logic from bases given for the co…