On the equational complexity of RRA
classification
🧮 math.LO
math.COmath.RA
keywords
complexityequationalfunctionalgebrasbelowboundedlog-logprove
read the original abstract
We prove that the equational complexity function for the variety of representable relation algebras is bounded below by a log-log function.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.