The extension problem for partial Boolean structures in Quantum Mechanics

Alternative partial Boolean structures, implicit in the discussion of classical representability of sets of quantum mechanical predictions, are characterized, with definite general conclusions on the equivalence of the approaches going back to Bell and Kochen-Specker. An algebraic approach is presented, allowing for a discussion of partial classical extension, amounting to reduction of the number of contexts, classical representability arising as a special case. As a result, known techniques are generalized and some of the associated computational difficulties overcome. The implications on the discussion of Boole-Bell inequalities are indicated.Comment: A number of misprints have been corrected and some terminology changed in order to avoid possible ambiguitie

Continuous first order logic and local stability

We develop continuous first order logic, a variant of the logic described in \cite{Chang-Keisler:ContinuousModelTheory}. We show that this logic has the same power of expression as the framework of open Hausdorff cats, and as such extends Henson's logic for Banach space structures. We conclude with the development of local stability, for which this logic is particularly well-suited

Bell inequalities from variable elimination methods

Tight Bell inequalities are facets of Pitowsky's correlation polytope and are usually obtained from its extreme points by solving the hull problem. Here we present an alternative method based on a combination of algebraic results on extensions of measures and variable elimination methods, e.g., the Fourier-Motzkin method. Our method is shown to overcome some of the computational difficulties associated with the hull problem in some non-trivial cases. Moreover, it provides an explanation for the arising of only a finite number of families of Bell inequalities in measurement scenarios where one experimenter can choose between an arbitrary number of different measurements

Varieties of Cost Functions.

Regular cost functions were introduced as a quantitative generalisation of regular languages, retaining many of their equivalent characterisations and decidability properties. For instance, stabilisation monoids play the same role for cost functions as monoids do for regular languages. The purpose of this article is to further extend this algebraic approach by generalising two results on regular languages to cost functions: Eilenberg's varieties theorem and profinite equational characterisations of lattices of regular languages. This opens interesting new perspectives, but the specificities of cost functions introduce difficulties that prevent these generalisations to be straightforward. In contrast, although syntactic algebras can be defined for formal power series over a commutative ring, no such notion is known for series over semirings and in particular over the tropical semiring