Relation algebras: Concept of points and representability
✍ Scribed by G. Schmidt; T. Ströhlein
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 621 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
In the axiomatization of relation algebras by Chin and Tarski certain elements are called fight ideals. Aiming at applications in the relational theory of graphs and programs, we call such ideals 'points' and investigate an additional point axiom. First we prove a point insertion theorem. Then a representation theorem for such relation algebras is deduced by inherently relational methods, simplifying the proof of a similar result from J6nsson, Maddux and Tarski. Some historical remarks are inserted and an extended bibliography is added.
📜 SIMILAR VOLUMES
We show that the representability of cylindric algebras by relativized set algebras depends on the scope of the operation transposition which can be defined on the algebra. The existence of "partial transposition" assures this kind of representability of the cylindric algebra (while the existence of
## Abstract We give a simple new construction of representable relation algebras with non‐representable completions. Using variations on our construction, we show that the elementary closure of the class of completely representable relation algebras is not finitely axiomatizable (© 2009 WILEY‐VCH V