Abbreviation: Sgrp
A \emph{semigroup} is a structure S=⟨S,⋅⟩, where ⋅ is an infix binary operation, called the \emph{semigroup product}, such that
⋅ is associative: (xy)z=x(yz).
Let S and T be semigroups. A morphism from S to T is a function h:S→T that is a homomorphism:
h(xy)=h(x)h(y)
Example 1: ⟨XX,∘⟩, the collection of functions on a sets X, with composition.
Example 1: ⟨Σ+,⋅⟩, the collection of nonempty strings over Σ, with concatenation.
Classtype | variety |
---|---|
Equational theory | decidable in polynomial time |
Quasiequational theory | undecidable |
First-order theory | undecidable |
Locally finite | no |
Residual size | unbounded |
Congruence distributive | no |
Congruence modular | no |
Congruence n-permutable | no |
Congruence regular | no |
Congruence uniform | no |
Congruence extension property | |
Definable principal congruences | |
Equationally def. pr. cong. | no |
Amalgamation property | no |
Strong amalgamation property | no |
Epimorphisms are surjective | no |
f(1)=1f(2)=5f(3)=24f(4)=188f(5)=1915f(6)=28634f(7)=1627672f(8)=3684030417f(9)=105978177936292
[http://oeis.org/A027851 Semigroups in the Encyclopedia of Integer Sequences]