On the equational complexity of RRA

DOI10.1007/S00012-012-0210-3zbMATH Open1263.03057arXiv1304.2092OpenAlexW2067989349MaRDI QIDQ1935010FDOQ1935010

Jeremy F. Alm

Publication date: 30 January 2013

Published in: Algebra Universalis (Search for Journal in Brave)

Abstract: We prove that the equational complexity function for the variety of representable relation algebras is bounded below by a log-log function.

Full work available at URL: https://arxiv.org/abs/1304.2092

zbMATH Keywords

equational complexityrepresentable relation algebras

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Cylindric and polyadic algebras; relation algebras (03G15)

Cites Work

• Title not available (Why is that?)
• Relation algebras and projective geometries
• Relation algebras by games
• EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM
• On representable relation algebras
• The Nonexistence of Certain Finite Projective Planes
• Axiomatizability of reducts of algebras of relations
• Weakly representable but not representable relation algebras
• Weakly representable relation algebras form a variety

Cited In (1)

• THERE IS NO FINITE-VARIABLE EQUATIONAL AXIOMATIZATION OF REPRESENTABLE RELATION ALGEBRAS OVER WEAKLY REPRESENTABLE RELATION ALGEBRAS

This page was built for publication: On the equational complexity of RRA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935010)