On the equational complexity of RRA
Abstract
We prove that the equational complexity function for the variety of representable relation algebras is bounded below by a log-log function.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.