| Publication | Date of Publication | Type |
|---|
Conservative translations revisited
Journal of Philosophical Logic | 2023-06-13 | Paper |
Adding abductive reasoning to a propositional logic
Journal Of Logic And Computation | 2022-09-22 | Paper |
Revisiting separation: algorithms and complexity
Logic Journal of the IGPL | 2022-01-05 | Paper |
Time-stamped claim logic
Logic Journal of the IGPL | 2022-01-05 | Paper |
Time-stamped claim logic
Logic Journal of the IGPL | 2022-01-05 | Paper |
REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION
The Bulletin of Symbolic Logic | 2021-08-05 | Paper |
Event-based time-stamped claim logic
Journal of Logical and Algebraic Methods in Programming | 2021-08-03 | Paper |
Decidability of logical theories and their combination
Studies in Universal Logic | 2020-10-15 | Paper |
| A mathematical primer on linear optimization | 2020-08-30 | Paper |
Essential structure of proofs as a measure of complexity
Logica Universalis | 2020-05-27 | Paper |
| A mathematical primer on computability | 2019-08-02 | Paper |
Probabilistic logic of quantum observations
Logic Journal of the IGPL | 2019-06-18 | Paper |
Decision and optimization problems in the unreliable-circuit logic
Logic Journal of the IGPL | 2019-01-08 | Paper |
On probability and logic
Portugaliae Mathematica. Nova Série | 2018-04-09 | Paper |
Many-sorted equivalence of shiny and strongly polite theories
Journal of Automated Reasoning | 2018-02-02 | Paper |
Preservation of admissible rules when combining logics
The Review of Symbolic Logic | 2017-05-31 | Paper |
A roadmap to decidability
Studies in Universal Logic | 2015-06-24 | Paper |
Fibring as biporting subsumes asymmetric combinations
Studia Logica | 2015-02-27 | Paper |
Approximate reasoning about logic circuits with single-fan-out unreliable gates
Journal Of Logic And Computation | 2015-02-11 | Paper |
Craig interpolation in the presence of unreliable connectives
Logica Universalis | 2015-02-05 | Paper |
Preservation of Craig interpolation by the product of matrix logics
Journal of Applied Logic | 2014-04-17 | Paper |
Revisiting the equivalence of shininess and politeness
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
Completeness and interpolation of almost-everywhere quantification over finitely additive measures
Mathematical Logic Quarterly (MLQ) | 2013-10-30 | Paper |
Importing logics: soundness and completeness preservation
Studia Logica | 2013-08-19 | Paper |
| Non-deterministic combination of connectives | 2013-04-24 | Paper |
On combined connectives
Logica Universalis | 2013-03-21 | Paper |
On meet-combination of logics
Journal Of Logic And Computation | 2013-01-14 | Paper |
Importing logics
Studia Logica | 2012-12-12 | Paper |
Fusion of sequent modal logic systems labelled with truth values
Logic Journal of the IGPL | 2010-12-14 | Paper |
A graph-theoretic account of logics
Journal Of Logic And Computation | 2010-01-14 | Paper |
On Graph-theoretic Fibring of Logics
Journal Of Logic And Computation | 2010-01-14 | Paper |
Truth-values as labels: a general recipe for labelled deduction
Journal of Applied Non-Classical Logics | 2009-11-11 | Paper |
Interpolation via translations
MLQ | 2009-10-14 | Paper |
Complete Axiomatization of Discrete-Measure Almost-Everywhere Quantification
Journal Of Logic And Computation | 2008-12-22 | Paper |
ON THE POWER OF QUANTUM TAMPER-PROOF DEVICES
International Journal of Quantum Information | 2008-11-03 | Paper |
Preservation of Interpolation Features by Fibring
Journal Of Logic And Computation | 2008-03-12 | Paper |
Sufficient conditions for cut elimination with complexity analysis
Annals of Pure and Applied Logic | 2007-11-27 | Paper |
Modal Sequent Calculi Labelled with Truth Values: Cut Elimination
Logic Journal of the IGPL | 2005-09-28 | Paper |
| scientific article; zbMATH DE number 2086603 (Why is no real title available?) | 2004-08-11 | Paper |
Modulated fibring and the collapsing problem
Journal of Symbolic Logic | 2004-03-01 | Paper |
Fibring Labelled Deduction Systems
Journal Of Logic And Computation | 2003-05-29 | Paper |
