TL;DR
This paper establishes a lower bound on the complexity of equations needed to characterize representable relation algebras, showing it grows at least as fast as a log-log function.
Contribution
It proves that the equational complexity function for representable relation algebras has a lower bound that grows logarithmically twice as fast.
Findings
Equational complexity is bounded below by a log-log function.
Provides a quantitative measure of complexity for relation algebra varieties.
Advances understanding of the algebraic structure of relation algebras.
Abstract
We prove that the equational complexity function for the variety of representable relation algebras is bounded below by a log-log function.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Logic, Reasoning, and Knowledge · Logic, programming, and type systems