Šemrl, J;
(2021)
Domain Range Semigroups and Finite Representations.
In:
Relational and Algebraic Methods in Computer Science. RAMiCS 2021.
(pp. pp. 483-498).
Springer: Cham, Switzerland.
Preview |
Text
2106.02709v2.pdf - Accepted Version Download (216kB) | Preview |
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.
| Type: | Proceedings paper |
|---|---|
| Title: | Domain Range Semigroups and Finite Representations |
| Event: | International Conference on Relational and Algebraic Methods in Computer Science |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1007/978-3-030-88701-8_29 |
| Publisher version: | https://doi.org/10.1007/978-3-030-88701-8_29 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher's terms and conditions. |
| Keywords: | Domain-Range Semigroups · Demonic Composition · Finite Representation Property. |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery-pp.ucl.ac.uk/id/eprint/10134911 |
Archive Staff Only
 |
View Item |
