| Publication | Date of Publication | Type |
|---|
A credal extension of independent choice logic
Lecture Notes in Computer Science | 2023-07-28 | Paper |
| Connecting classical finite exchangeability to quantum theory | 2023-06-06 | Paper |
Quantum indistinguishability through exchangeability
International Journal of Approximate Reasoning | 2022-12-08 | Paper |
Model theory of monadic predicate logic with the infinity quantifier
Archive for Mathematical Logic | 2022-06-14 | Paper |
| Why we should interpret density matrices as moment matrices: the case of (in)distinguishable particles and the emergence of classical reality | 2022-03-08 | Paper |
The weirdness theorem and the origin of quantum paradoxes
Foundations of Physics | 2021-12-27 | Paper |
Quantum indistinguishability through exchangeable desirable gambles
(available as arXiv preprint) | 2021-05-10 | Paper |
| Robust Model Checking with Imprecise Markov Reward Models | 2021-03-08 | Paper |
Tractable inference in credal sentential decision diagrams
International Journal of Approximate Reasoning | 2020-10-22 | Paper |
The Power of the Weak
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
Sum-of-squares for bounded rationality
International Journal of Approximate Reasoning | 2019-02-20 | Paper |
Model Theory of Monadic Predicate Logic with the Infinity Quantifier
(available as arXiv preprint) | 2018-09-10 | Paper |
Weak MSO: automata and expressiveness modulo bisimilarity
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
A Gleason-type theorem for any dimension based on a gambling formulation of quantum mechanics
Foundations of Physics | 2018-01-08 | Paper |
Index problems for game automata
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
Rabin-Mostowski index problem: a step beyond deterministic automata
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
A characterization theorem for the alternation-free fragment of the modal \(\mu\)-calculus
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
| A polarity theory for sets of desirable gambles | 2017-05-26 | Paper |
| Quantum rational preferences and desirability | 2016-10-21 | Paper |
On the weak index problem for game automata
Logic, Language, Information, and Computation | 2015-09-24 | Paper |
Containment for conditional tree patterns
Logical Methods in Computer Science | 2015-08-25 | Paper |
Deciding the Borel complexity of regular tree languages
Language, Life, Limits | 2015-02-25 | Paper |
| The wadge hierarchy of max-regular languages | 2012-10-24 | Paper |
| Definable operations on weakly recognizable sets of trees | 2012-08-31 | Paper |
Characterizing EF over infinite trees and modal logic on transitive graphs
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
The modal \(\mu \)-calculus hierarchy over restricted classes of transition systems
Journal of Symbolic Logic | 2010-01-07 | Paper |
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
Computer Science Logic | 2009-11-12 | Paper |
A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata
Infinity in Logic and Computation | 2009-11-12 | Paper |
On modal \(\mu \)-calculus and Gödel-Löb logic
Studia Logica | 2009-05-08 | Paper |
Describing the Wadge Hierarchy for the Alternation Free Fragment of μ-Calculus (I)
Logic and Theory of Algorithms | 2008-06-19 | Paper |
| scientific article; zbMATH DE number 2129316 (Why is no real title available?) | 2005-01-19 | Paper |
