3 citations · 6 across the 5 of their papers we have counts for
7 papers
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…
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…
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…
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…
Epistemic nature of quantum reasoning
Alfredo B. Henriques, Amílcar Sernadas
Doubts are raised concerning the usual interpretation of the alleged failure, by quantum mechanics, of the distributive law of classical logic. The difficulty raised by incompatibl…
Exponentially more concise quantum recognition of non-RMM regular languages
Daowen Qiu, Lvzhou Li, Paulo Mateus +1
We show that there are quantum devices that accept all regular languages and that are exponentially more concise than deterministic finite automata (DFA). For this purpose, we intr…