Domain Range Semigroups and Finite Representations
Logic in Computer Science
2021-08-26 v2
Abstract
Relational semigroups with domain and range are a useful tool for modelling nondeterministic programs. We prove that the representation class of domain-range semigroups with demonic composition is not finitely axiomatisable. We extend the result for ordered domain algebras and show that any relation algebra reduct signature containing domain, range, converse, and composition, but no negation, meet, nor join has the finite representation property. That is any finite representable structure of such a signature is representable over a finite base. We survey the results in the area of the finite representation property.
Keywords
Cite
@article{arxiv.2106.02709,
title = {Domain Range Semigroups and Finite Representations},
author = {Jaš Šemrl},
journal= {arXiv preprint arXiv:2106.02709},
year = {2021}
}