Related papers: A van Benthem Theorem for Atomic and Molecular Log…
A physically motivated equation that determines the number of electrons of a molecule is proposed based on chemical common sense. It shows that all molecules are entangled in the number of electrons and results in the fundamental assumption…
We present a new uniform method for studying modal companions of superintuitionistic rule systems and related notions, based on the machinery of stable canonical rules. Using this method, we obtain alternative proofs of the Blok-Esakia…
Quantum relations in the sense of Weaver are $M'$-bimodules, for a von Neumann algebra $M$, these generalising actual relations on a set $X$ when $M=\ell^\infty(X)$. Similarly, relations between two sets can be generalised as bimodules over…
Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…
We construct an ontological model for the theory known as bilocal classical theory doi.org/10.1103/PhysRevA.102.052216. To our knowledge, this is only the second time that an ontological model has been constructed for an entire theory,…
Recent works have shown that defining a behavioural equivalence that matches the observational properties of a quantum-capable, concurrent, non-deterministic system is a surprisingly difficult task. We explore coalgebras over distributions…
In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the modal mu-calculus and show how to derive characteristic formulae for…
Following A. Kuznetsov's outline, we restore Kuznetsov's syntactic proof of the assertoric equipollence of the intuitionistic propositional calculus and the proof-intuitionistic calculus KM (Kuznetsov's Theorem). Then, we show that this…
Recent published work has addressed the Shalqvist correspondence problem for non-distributive logics. The natural question that arises is to identify the fragment of first-order logic that corresponds to logics without distribution, lifting…
In this paper we present {\em refinement modal logic}. A refinement is like a bisimulation, except that from the three relational requirements only `atoms' and `back' need to be satisfied. Our logic contains a new operator 'all' in addition…
We apply the algebraic theory of infinite classical lattices from Part I to write an axiomatic theory of measurements, based on Mackey's axioms for quantum mechanics. The axioms give a complete theory of measurements in the sense of Haag…
We present an extension and generalization of Sahlqvist--Van Benthem correspondence to the case of distribution-free modal logic, with, or without negation and/or implication connectives. We follow a reductionist strategy, reducing the…
We show that for various natural classes of groups and appropriately defined K- and L-theoretic functors, injectivity or bijectivity of the assembly map follows from the Isomorphism Conjecture being true for acyclic groups lying within that…
A modal logic based on quantum logic is formalized in its simplest possible form. Specifically, a relational semantics and a sequent calculus are provided, and the soundness and the completeness theorems connecting both notions are…
For the first time it is shown that the logic of quantum mechanics can be derived from Classical Physics. An orthomodular lattice of propositions, characteristic of quantum logic, is constructed for manifolds in Einstein's theory of general…
We introduce a general and compositional, yet simple, framework that allows us to derive soundness and expressiveness results for modal logics characterizing behavioural equivalences or metrics (also known as Hennessy-Milner theorems). It…
This paper involves generalizing the Goldblatt-Thomason and the Lindstr\"om characterization theorems to first-order modal logic.
Characteristic formulae give a complete logical description of the behaviour of processes modulo some chosen notion of behavioural semantics. They allow one to reduce equivalence or preorder checking to model checking, and are exactly the…
We combine the concepts of modal logics and many-valued logics in a general and comprehensive way. Namely, given any finite linearly ordered set of truth values and any set of propositional connectives defined by truth tables, we define the…
We present a derivation of Born's rule and unitary transforms in Quantum Mechanics, from a simple set of axioms built upon a physical phenomenology of quantization. Combined to Gleason's theorem, this approach naturally leads to the usual…