Domain Range Semigroups and Finite Representations

06/04/2021
by   Jaš Šemrl, et al.
0

Relational semigroups with domain and range are a useful tool for modelling nondeterministic programs. We prove that the representation class R(D,R,*) is not finitely axiomatisable, answering arXiv:1811.01712 Question 5.1. We show that any signature containing D, R, ⌣, ; but not - or · has the finite representation property, an extension of the result for ordered domain algebras {0,1,D,R, ≤, 1', ⌣,;}. We survey the results in the area of the finite representation property and raise a number of open questions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/01/2021

Amalgamation is PSPACE-hard

The finite models of a universal sentence Φ in a finite relational signa...
research
05/14/2021

Demonic Lattices and Semilattices in Relational Semigroups with Ordinary Composition

Relation algebra and its reducts provide us with a strong tool for reaso...
research
10/30/2018

Domain and range for angelic and demonic compositions

We give finite axiomatizations for the varieties generated by representa...
research
09/15/2020

Finite Representability of Semigroups with Demonic Refinement

Composition and demonic refinement ⊑ of binary relations are defined by ...
research
10/10/2020

Structural Ramsey Theory and the Extension Property for Partial Automorphisms

We survey recent developments concerning two properties of classes of fi...
research
07/01/2022

Projectivity revisited

The behaviour of statistical relational representations across different...
research
09/21/2021

Query Evaluation in DatalogMTL – Taming Infinite Query Results

In this paper, we investigate finite representations of DatalogMTL. Firs...

Please sign up or login with your details

Forgot password? Click here to reset