There is no finite-variable equational axiomatization of representable relation algebras over weakly representable relation algebras
From MaRDI portal
(Redirected from Publication:5737952)
Abstract: We prove that any equational basis that defines RRA over wRRA must contain infinitely many variables. The proof uses a construction of arbitrarily large finite weakly representable but not representable relation algebras whose "small" subalgebras are representable.
Recommendations
- Weakly representable but not representable relation algebras
- Weakly representable relation algebras form a variety
- Non-representable relation algebras from vector spaces
- First-order axiomatisations of representable relation algebras need formulas of unbounded quantifier depth
- Complexity of equations valid in algebras of relations. II: Finite axiomatizations
Cites work
- EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM
- On the equational complexity of RRA
- Relation algebras by games
- Sum-free cyclic multi-bases and constructions of Ramsey algebras
- Weakly representable but not representable relation algebras
- Weakly representable relation algebras form a variety
Cited in
(8)- One variable is not enough for defining relation algebras, but two are
- Complexity of equations valid in algebras of relations. II: Finite axiomatizations
- On the equational complexity of RRA
- Representability of Lyndon-Maddux relation algebras
- scientific article; zbMATH DE number 475194 (Why is no real title available?)
- First-order axiomatisations of representable relation algebras need formulas of unbounded quantifier depth
- Non-representable relation algebras from vector spaces
- Monk algebras and representability
This page was built for publication: There is no finite-variable equational axiomatization of representable relation algebras over weakly representable relation algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5737952)
