Weakly representable but not representable relation algebras
✍ Scribed by H. Andréka
- Publisher
- Springer
- Year
- 1994
- Tongue
- English
- Weight
- 596 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0002-5240
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## 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
## Abstract Let__n__ > 2. A weakly representable relation algebra that is not strongly representable is constructed. It is proved that the set of all __n__ by __n__ basic matrices forms a cylindric basis that is also a weakly but not a strongly representable atom structure. This gives an example of
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 rep