Domain range semigroups and finite representations

Jaš Šemrl*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationRelational and Algebraic Methods in Computer Science. RAMiCS 2021.
EditorsUli Fahrenberg, Mai Gehrke, Luigi Santocanale, Michael Winter
PublisherSpringer Cham
Pages483-498
Number of pages16
ISBN (Electronic)0783030887019
ISBN (Print)9783030887001
DOIs
Publication statusPublished - 13 Oct 2021
Externally publishedYes

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume13027
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • domain-range semigroups
  • demonic composition
  • finite representation property

Fingerprint

Dive into the research topics of 'Domain range semigroups and finite representations'. Together they form a unique fingerprint.

Cite this