Weakly representable relation algebras form a variety
✍ Scribed by Bertalan Pécsi
- Publisher
- Springer
- Year
- 2009
- Tongue
- English
- Weight
- 187 KB
- Volume
- 60
- 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
We present an algorithm that computes an unmixed-dimensional decomposition of an arbitrary algebraic variety \(V\). Each \(V_{i}\) in the decomposition \(V=V_{1} \cup \ldots \cup V_{m}\) is given by a finite set of polynomials which represents the generic points of the irreducible components of \(V_