Abstract
We prove that the equational complexity function for the variety of representable relation algebras is bounded below by a log-log function.
Similar content being viewed by others
References
Andréka H.: Weakly representable but not representable relation algebras. Algebra Universalis 32, 31–43 (1994)
Bruck R.H., Ryser H.J.: The nonexistence of certain finite projective planes. Canadian J. Math. 1, 88–93 (1949)
Hirsch, R., Hodkinson, I.: Relation Algebras by Games. Studies in Logic and the Foundations of Mathematics, vol. 147. North-Holland, Amsterdam (2002)
Hodkinson I., Mikulás S.: Axiomatizability of reducts of algebras of relations. Algebra Universalis 43, 127–156 (2000)
Jónsson, B.: The theory of binary relations. In: Algebraic Logic (Budapest, 1988). Colloq. Math. Soc. János Bolyai, vol. 54, pp. 245–292. North-Holland, Amsterdam (1991)
Lyndon R.C.: Relation algebras and projective geometries. Michigan Math. J. 8, 21–28 (1961)
McNulty G.F., Székely Z., Willard R.: Equational complexity of the finite algebra membership problem. Internat. J. Algebra Comput. 18, 1283–1319 (2008)
Monk D.: On representable relation algebras. Michigan Math. J. 11, 207–210 (1964)
Pécsi B.: Weakly representable relation algebras form a variety. Algebra Universalis 60, 369–380 (2009)
Tarski, A.: Contributions to the theory of models. III. Nederl. Akad. Wetensch. Proc. Ser. A. 58, 56–64 (1955); Indagationes Math. 17, 56–64 (1955)
Author information
Authors and Affiliations
Corresponding author
Additional information
Presented by I. Hodkinson.
Rights and permissions
About this article
Cite this article
Alm, J.F. On the equational complexity of RRA. Algebra Univers. 68, 321–324 (2012). https://doi.org/10.1007/s00012-012-0210-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00012-012-0210-3