PSPACE Bounds for Rank-1 Modal Logics

For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal logics. Our main result is that all rank-1 logics enjoy a shallow model property and thus are, under mild assumptions on the format of their axiomatisation, in PSPACE. This leads to a unified derivation of tight PSPACE-bounds for a number of logics including K, KD, coalition logic, graded modal logic, majority logic, and probabilistic modal logic. Our generic algorithm moreover finds tableau proofs that witness pleasant proof-theoretic properties including a weak subformula property. This generality is made possible by a coalgebraic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way

Higher-order interference in extensions of quantum theory

Quantum interference lies at the heart of several quantum computational speed-ups and provides a striking example of a phenomenon with no classical counterpart. An intriguing feature of quantum interference arises in a three slit experiment. In this set-up, the interference pattern can be written in terms of the two and one slit patterns obtained by blocking some of the slits. This is in stark contrast with the standard two slit experiment, where the interference pattern is irreducible. This was first noted by Rafael Sorkin, who asked why quantum theory only exhibits irreducible interference in the two slit experiment. One approach to this problem is to compare the predictions of quantum theory to those of operationally-defined `foil' theories, in the hope of determining whether theories exhibiting higher-order interference suffer from pathological--or at least undesirable--features. In this paper two proposed extensions of quantum theory are considered: the theory of Density Cubes proposed by Dakic et al., which has been shown to exhibit irreducible interference in the three slit set-up, and the Quartic Quantum Theory of Zyczkowski. The theory of Density Cubes will be shown to provide an advantage over quantum theory in a certain computational task and to posses a well-defined mechanism which leads to the emergence of quantum theory. Despite this, the axioms used to define Density Cubes will be shown to be insufficient to uniquely characterise the theory. In comparison, Quartic Quantum Theory is well-defined and we show that it exhibits irreducible interference to all orders. This feature of the theory is argued not to be a genuine phenomenon, but to arise from an ambiguity in the current definition of higher-order interference. To understand why quantum theory has limited interference therefore, a new operational definition of higher-order interference is needed.Comment: Updated in response to referee comments. 17 pages. Comments welcom

A Cognitive Model for Conversation

International audienceThis paper describes a symbolic model of rational action and decision making to support analysing dialogue. The model approximates principles of behaviour from game theory, and its proof theory makes Gricean principles of cooperativity derivable when the agents’ preferences align

A dynamic logic for every season

This paper introduces a method to build dynamic logics with a graded semantics. The construction is parametrized by a structure to support both the spaces of truth and of the domain of computations. Possible instantiations of the method range from classical assertional) dynamic logic to less common graded logics suitable to deal with programs whose transitional semantics exhibits fuzzy or weighted behaviour.This leads to the systematic derivation of program logics tailored to specific program classes

Sequential two-player games with ambiguity

If players' beliefs are strictly non-additive, the Dempster-Shafer updating rule can be used to define beliefs off the equilibrium path. We define an equilibrium concept in sequential two-person games where players update their beliefs with the Dempster-Shafer updating rule. We show that in the limit as uncertainty tends to zero, our equilibrium approximates Bayesian Nash equilibrium by imposing context-dependent constraints on beliefs under uncertainty

A Logic-based Tractable Approximation of Probability

We provide a logical framework in which a resource-bounded agent can be seen to perform approximations of probabilistic reasoning. Our main results read as follows. First we identify the conditions under which propositional probability functions can be approximated by a hierarchy of depth-bounded Belief functions. Second we show that under rather palatable restrictions, our approximations of probability lead to uncertain reasoning which, under the usual assumptions in the field, qualifies as tractable

Sequential Product Spaces are Jordan Algebras

We show that finite-dimensional order unit spaces equipped with a continuous sequential product as defined by Gudder and Greechie are homogeneous and self-dual. As a consequence of the Koecher-Vinberg theorem these spaces therefore correspond to Euclidean Jordan algebras. We remark on the significance of this result in the context of reconstructions of quantum theory. In particular, we show that sequential product spaces that have locally tomographic tensor products, i.e. their vector space tensor products are also sequential product spaces, must be C* algebras. Finally we remark on a couple of ways these results can be extended to the infinite-dimensional setting of JB- and JBW-algebras and how changing the axioms of the sequential product might lead to a new characterisation of homogeneous cones.Comment: Original paper title was "Sequential Measurement Characterises Quantum Theory". It has been changed to reflect a change in focus of the pape