On the equational complexity of RRA
Logic
2013-04-09 v1 Combinatorics
Rings and Algebras
Abstract
We prove that the equational complexity function for the variety of representable relation algebras is bounded below by a log-log function.
Cite
@article{arxiv.1304.2092,
title = {On the equational complexity of RRA},
author = {Jeremy F. Alm},
journal= {arXiv preprint arXiv:1304.2092},
year = {2013}
}
Comments
4 pages