Complexity of equational theory of relational algebras with standard projection elements
Complexity of equational theory of relational algebras with standard projection elements
S. Mikulás,I. Sain,András Simon
2015 · DOI: 10.1007/s11229-015-0689-1
Synthese · 2 Citations
TLDR
It is proved that the relation algebra reducts of TPA are decidable and the set of all equations valid in TPA are shown to be valid.