Year: 2025
Type: article
Abstract: We give a definition of representability for distributive quasi relation algebras (DqRAs). These algebras are a generalisation of relation algebras and were first described by Galatos and Jipsen (Algebra Univers 69:1–21, 2013). Our definition uses a construction that starts with a poset. The algebra is concretely constructed as the lattice of upsets of a partially ordered equivalence relation. The key to defining the three negation-like unary operations is to impose certain symmetry requirements on the partial order. Our definition of representable distributive quasi relation algebras is easily seen to be a generalisation of the definition of representable relations algebras by Jónsson and Tarski (AMS 54:89, 1948). We give examples of representable DqRAs and give a necessary condition for an algebra to be finitely representable. We leave open the questions of whether every DqRA is representable, and also whether the class of representable DqRAs forms a variety. Moreover, our definition provides many other opportunities for investigations in the spirit of those carried out for representable relation algebras.
Source: Algebra Universalis
Authors: Andrew Craig, Claudette Robinson
Institution: University of Johannesburg
Language: English
Topic: Advanced Algebra and Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,190
OpenAlex ID: W4409181036