Finite representability of semigroups with demonic refinement
From MaRDI portal
Recommendations
- Demonic lattices and semilattices in relational semigroups with ordinary composition
- Axioms for signatures with domain and demonic composition
- The algebra of non-deterministic programs: demonic operations, orders and axioms
- A RELATIONAL MODEL OF DEMONIC NONDETERMINISTIC PROGRAMS
- Embedding a demonic semilattice in a relation algebra
Cites work
- scientific article; zbMATH DE number 3156400 (Why is no real title available?)
- scientific article; zbMATH DE number 3611365 (Why is no real title available?)
- scientific article; zbMATH DE number 194642 (Why is no real title available?)
- Demonic Algebra with Domain
- On the Structure of Demonic Refinement Algebras with Enabledness and Termination
- Ordered domain algebras
- Relation algebras by games
- Relational algebraic semantics of deterministic and nondeterministic programs
- Relational heuristics for the design of deterministic programs
- Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types
- Towards a refinement algebra
- Undecidability of representability as binary relations
- Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups
Cited in
(6)- Abstract representation theorems for demonic refinement algebras
- Reducts of relation algebras: the aspects of axiomatisability and finite representability
- Domain range semigroups and finite representations
- Finite Representability of Semigroups with Demonic Refinement
- Demonic lattices and semilattices in relational semigroups with ordinary composition
- Decidability of the representation extension property for finite semigroups
This page was built for publication: Finite representability of semigroups with demonic refinement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q829757)
