Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T07:46:29.498Z Has data issue: false hasContentIssue false

Universal classes of simple relation algebras

Published online by Cambridge University Press:  12 March 2014

Steven Givant*
Affiliation:
Department of Mathematics and Computer Science, Mills College, Oakland, CA 94613, USA E-mail: givant@mills.edu

Extract

Tarski [19] proved the important theorem that the class of representable relation algebras is equationally axiomatizable. One of the key steps in his proof is showing that the class of (isomorphs of) simple set relation algebras—that is, algebras of binary relations with a unit of the form U × U for some non-empty set U —is universal, i.e., is axiomatizable by a set of universal sentences. In the same paper Tarski observed that the class of (isomorphs of) relation algebras constructed from groups (so-called group relation algebras) is also universal.

We shall abstract the essential ingredients of Tarski's method (in Corollary 2.4), and then combine them with some observations about atom structures, to establish (in Theorem 2.6) a rather general method for showing that certain classes of simple relation algebras—and, more generally, certain classes of simple algebras in a discriminator variety V—are universal, and consequently that the collections of (isomorphs of) subdirect products of algebras in such classes form subvarieties of V. As applications of the method we show that two well-known classes of simple relation algebras, those constructed from projective geometries (sometimes called Lyndon algebras) and those constructed from modular lattices with a zero (sometimes called Maddux algebras), are universal. In the process we prove that these two classes consist precisely of all (isomorphs of) complex algebras over the respective geometries and modular lattices, provided that we choose the primitive notions of the latter structures in an appropriate fashion. We also derive Tarski's theorems and a related theorem of the author as easy corollaries of Theorem 2.6.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable