Relation algebras and groups

Generalizing results of J\'onsson and Tarski, Maddux introduced the notion of a pair-dense relation algebra and proved that every pair-dense relation algebra is representable. The notion of a pair below the identity element is readily definable within the equational framework of relation algebras. The notion of a triple, a quadruple, or more generally, an element of size (or measure) n>2 is not definable within this framework, and therefore it seems at first glance that Maddux's theorem cannot be generalized. It turns out, however, that a very far-reaching generalization of Maddux's result is possible if one is willing to go outside of the equational framework of relation algebras, and work instead within the framework of the first-order theory. In the present paper, we define the notion of an atom below the identity element in a relation algebra having measure n for an arbitrary cardinal number n>0, and we define a relation algebra to be measurable if it's identity element is the sum of atoms each of which has some (finite or infinite) measure. The main purpose of the present paper is to construct a large class of new examples of group relation algebras using systems of groups and corresponding systems of quotient isomorphisms (instead of the classic example of using a single group and forming its complex algebra), and to prove that each of these algebras is an example of a measurable set relation algebra. In a subsequent paper, the class of examples will be greatly expanded by adding a third ingredient to the mix, namely systems of "shifting" cosets. The expanded class of examples---called coset relation algebras---will be large enough to prove a representation theorem saying that every atomic, measurable relation algebra is essentially isomorphic to a coset relation algebra.Comment: This is the first member of a series of papers on measurable relation algebra

On Tarski's axiomatic foundations of the calculus of relations

It is shown that Tarski's set of ten axioms for the calculus of relations is independent in the sense that no axiom can be derived from the remaining axioms. It is also shown that by modifying one of Tarski's axioms slightly, and in fact by replacing the right-hand distributive law for relative multiplication with its left-hand version, we arrive at an equivalent set of axioms which is redundant in the sense that one of the axioms, namely the second involution law, is derivable from the other axioms. The set of remaining axioms is independent. Finally, it is shown that if both the left-hand and right-hand distributive laws for relative multiplication are included in the set of axioms, then two of Tarski's other axioms become redundant, namely the second involution law and the distributive law for converse. The set of remaining axioms is independent and equivalent to Tarski's axiom system

Possible cardinalities of irredundant bases for finite closure structures

AbstractWe indicate certain connections between the rank and cardinality of a finite closure structure, and the relative sizes of its irredundant bases. A class of examples is described which shows that in general our theorem can not be strengthened

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

A representation theorem for measurable relation algebras

A relation algebra is called measurable when its identity is the sum of measurable atoms, where an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have rather strong structural properties: they are constructed from systems of groups, coordinated systems of isomorphisms between quotients of the groups, and systems of cosets that are used to “shift” the operation of relative multiplication. An atomic and complete measurable relation algebra is completely representable if and only if there is a stronger coordination between these isomorphisms induced by a scaffold (the shifting cosets are not needed in this case). We also prove that a measurable relation algebra in which the associated groups are all finite is atomic. © 2018 Elsevier B.V

V*-algebras, independence algebras and logic

Independence algebras were introduced in the early 1990s by specialists in semigroup theory, as a tool to explain similarities between the transformation monoid on a set and the endomorphism monoid of a vector space. It turned out that these algebras had already been defined and studied in the 1960s, under the name of v*-algebras, by specialists in universal algebra (and statistics). Our goal is to complete this picture by discussing how, during the middle period, independence algebras began to play a very important role in logic

Thr variety of coset relation algebras

A coset relation algebra is one embeddable into some full coset relation algebra, the latter is an algebra constructed from a system of groups, a coordinated system of isomorphisms between quotients of these groups, and a system of cosets that are used to "shift" the operation of relative multiplication. We prove that the class of coset relation algebras is equationally axiomatizable (that is to say, it is a variety), but no finite set of equations suffices to axiomatize the class (that is to say, the class is not finitely axiomatizable).Comment: This is the fifth member of a series of papers on measurable relation algebras. Forthcoming in The Journal of Symbolic Logic. arXiv admin note: text overlap with arXiv:1804.0027

Coset relation algebras

A measurable relation algebra is a relation algebra in which the identity element is a sum of atoms that can be measured in the sense that the "size" of each such atom can be defined in an intuitive and reasonable way (within the framework of the first-order theory of relation algebras). A large class of examples of such algebras, using systems of groups and coordinated systems of isomorphisms between quotients of the groups, has been constructed. This class of group relation algebras is not large enough to exhaust the class of all measurable relation algebras. In the present article, the class of examples of measurable relation algebras is considerably extended by adding one more ingredient to the mix: systems of cosets that are used to "shift" the operation of relative multiplication. It is shown that, under certain additional hypotheses on the system of cosets, each such coset relation algebra with a shifted operation of relative multiplication is an example of a measurable relation algebra. We also show that the class of coset relation algebras does contain examples that are not representable as set relation algebras. In a later article, it is shown that the class of coset relation algebras is adequate to the task of describing all measurable relation algebras in the sense that every atomic measurable relation algebra is essentially isomorphic to a coset relation algebra.Comment: This is the second member of a series of papers on measurable relation algebra

A representation theorem for measurable relation algebras with cyclic groups

A relation algebra is measurable if the identity element is a sum of atoms, and the square $x;1;x$ of each subidentity atom $x$ is a sum of non-zero functional elements. These functional elements form a group $G_x$. We prove that a measurable relation algebra in which the groups $G_x$ are all finite and cyclic is completely representable. A structural description of these algebras is also given

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