On representing semigroups with subsemilattices.
axiomatisabilityrelation algebrassemigroups of binary relationssemigroups of functionssemigroups of partial maps
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Semilattices (06A12) Ordered semigroups and monoids (06F05) Inverse semigroups (20M18) Semigroups of transformations, relations, partitions, etc. (20M20) Representation of semigroups; actions of semigroups on sets (20M30)
An assertion semigroup (or \(A\)-semigroup) is a structure \((\mathbf S,E)\) where \(\mathbf S\) is a semigroup and \(E\) is a distinguished subsemilattice of \(\mathbf S\). \(A\)-semigroup \(\mathbf S\) is called weakly representable as an \(A\)-semigroup of binary relations if there is a faithful semigroup representation \(\varphi\colon\mathbf S\to\mathcal B(X)\), where \(\mathcal B(X)\) is the semigroup of all binary relations on a set \(X\), such that the elements of \(E\) are represented as restrictions of the identity map. The representation \(\varphi\) is a strong representation if the elements of \(E\) are the only elements of \(\mathbf S\) represented as restrictions of the identity map. Along with the semigroup \(\mathcal B(X)\) the semigroups \(\mathcal P(X)\) and \(\mathcal T(X)\) are considered which are the semigroups of all partial transformations and of all partial one-to-one transformations on \(X\), respectively. The corresponding classes of representable \(A\)-semigroups are quasi-varieties but it is shown that they cannot be finitely axiomatized in first order logic. The method is used to establish the absence of a finite axiomatisation in various classes of semigroups, unary semigroups and ordered semigroups. Along with new results new proofs of some known facts concerning non-finite axiomatisability are presented.
- Representations of distributive lattice-ordered semigroups with binary relations
- Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups
- Representable semilattice-ordered monoids
- Partial Maps with Domain and Range: Extending Schein's Representation
- Representations of ordered semigroups.
- Domain and range for angelic and demonic compositions
- The semigroup of not bijective finite selfmaps of an infinite set
- \((\mathscr{F},\mathscr{G})\)-abundant semigroups
- Reducts of relation algebras: the aspects of axiomatisability and finite representability
- Monoids with tests and the algebra of possibly non-halting programs
- Representations of distributive lattice-ordered semigroups with binary relations
- Representable semilattice-ordered monoids
- Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups
- Axioms for signatures with domain and demonic composition
- Some properties of a class of polyhedral semigroups based upon the subword reversing method.
- Effective representations of path semigroups.
- scientific article; zbMATH DE number 4212331 (Why is no real title available?)
- Partial Maps with Domain and Range: Extending Schein's Representation
- Domain and range operations in semigroups and rings.
- scientific article; zbMATH DE number 5568599 (Why is no real title available?)
- scientific article; zbMATH DE number 3931283 (Why is no real title available?)
- On representable pairs
- A method for finding new sets of axioms for classes of semigroups.
- Boolean topological graphs of semigroups: the lack of first-order axiomatization
- scientific article; zbMATH DE number 5218140 (Why is no real title available?)
- On representations of variants of semigroups
- Laws for generalised interior operations in semigroups
- On DR-semigroups satisfying the ample conditions
- New methods to construct uninorms on bounded lattices via uninorms defined on their sublattices
- The algebra of functions with antidomain and range
This page was built for publication: On representing semigroups with subsemilattices.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360174)
