Finite representability of semigroups with demonic refinement

DOI10.1007/s00012-021-00718-5OpenAlexW3084978857MaRDI QIDQ829757

Jaš Šemrl, Robin Hirschl

Publication date: 6 May 2021

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.06970

zbMATH Keywords

relation algebraordered semigroupsdemonic refinementfinite representability property

Mathematics Subject Classification ID

Ordered semigroups and monoids (06F05) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items (2)

Reducts of relation algebras: the aspects of axiomatisability and finite representability ⋮ Domain range semigroups and finite representations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relation algebras by games
• Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types
• Relational heuristics for the design of deterministic programs
• Relational algebraic semantics of deterministic and nondeterministic programs
• Towards a refinement algebra
• Ordered domain algebras
• Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups
• On the Structure of Demonic Refinement Algebras with Enabledness and Termination
• Undecidability of representability as binary relations
• Demonic Algebra with Domain

This page was built for publication: Finite representability of semigroups with demonic refinement