Related papers: A van Benthem Theorem for Atomic and Molecular Log…
We explain why, in a configuration space that is multiply connected, i.e., whose fundamental group is nontrivial, there are several quantum theories, corresponding to different choices of topological factors. We do this in the context of…
The classical Hennessy-Milner theorem says that two states of an image-finite transition system are bisimilar if and only if they satisfy the same formulas in a certain modal logic. In this paper we study this type of result in a general…
I investigate the superintuitionistic analogue of the modal logic of chequered subsets of $\mathbb{R}^\infty$ introduced by van Benthem et al. It is observed that this logic possesses the disjunction property, contains the Scott axiom,…
We investigate multi-agent epistemic modal logic with common knowledge modalities for groups of agents and obtain van Benthem style model-theoretic characterisations, in terms of bisimulation invariance of classical first-order logic over…
Quantum mechanics provides a statistical description about nature, and thus would be incomplete if its statistical predictions could not be accounted for some realistic models with hidden variables. There are, however, two powerful theorems…
Bayesian networks provide an elegant formalism for representing and reasoning about uncertainty using probability theory. Theyare a probabilistic extension of propositional logic and, hence, inherit some of the limitations of propositional…
In computer science, various logical languages are defined to analyze properties of systems. One way to pinpoint the essential differences between those logics is to compare their expressivity in terms of distinguishing power and expressive…
Based on ideas of quantum theory of open systems we propose the consistent approach to the formulation of logic of plausible propositions. To this end we associate with every plausible proposition diagonal matrix of its likelihood and…
We define and study the theory of derivation-based connections on a recently introduced class of bimodules over an algebra which reduces to the category of modules whenever the algebra is commutative. This theory contains, in particular, a…
Lindstr\"om theorems characterize logics in terms of model-theoretic conditions such as Compactness and the L\"owenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic. But on the other…
Studying the extent to which realism is compatible with quantum mechanics teaches us something about the quantum mechanical universe, regardless of the validity of such realistic assumptions. It has also recently been appreciated that these…
We introduce Bifurcation Logic, BL, which combines a basic classical modality with separating conjunction * together with its naturally associated multiplicative implication, that is defined using the modal ordering. Specifically, a formula…
In this paper we investigate certain systems of propositional intuitionistic modal logic defined semantically in terms of neighborhood structures. We discuss various restrictions imposed on those frames but our constant approach is to…
For the model of probabilistic labelled transition systems that allow for the co-existence of nondeterminism and probabilities, we present two notions of bisimulation metrics: one is state-based and the other is distribution-based. We…
We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…
Conceiving of premises as collected into sets or multisets, instead of sequences, may lead to triviality for classical and intuitionistic logic in general proof theory, where we investigate identity of deductions. Any two deductions with…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…
We generalize the notion of symmetries of propositional formulas in conjunctive normal form to modal formulas. Our framework uses the coinductive models and, hence, the results apply to a wide class of modal logics including, for example,…
A version of quantum theory is derived from a set of plausible assumptions related to the following general setting: For a given system there is a set of experiments that can be performed, and for each such experiment an ordinary…
A remarkable feature of quantum theory is that particles with identical intrinsic properties must be treated as indistinguishable if the theory is to give valid predictions. In the quantum formalism, indistinguishability is expressed via…