Contractive presentations: A family of inverse monoids and semigroups with finite \({\mathcal R}\)-classes (Q1185779): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 01:14, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Contractive presentations: A family of inverse monoids and semigroups with finite \({\mathcal R}\)-classes |
scientific article |
Statements
Contractive presentations: A family of inverse monoids and semigroups with finite \({\mathcal R}\)-classes (English)
0 references
28 June 1992
0 references
Some decidability results are obtained for inverse monoids presented by generators and a special class of relations, contractive and strictly contractive relations. These relations are defined using graphical constructions (Munn trees). A fundamental characteristic of the monoids investigated is: if \(F\) is a free inverse monoid and \(M=F/\theta\) then for \(m\in F\), the \(\mathcal R\)-class of \(m\theta\) has no more elements than the \(\mathcal R\)-class of \(m\). The word problem for a finitely based contractive variety of inverse semigroups is decidable and the free objects in such a variety have finite \(\mathcal D\)-classes and are residually finite.
0 references
decidability
0 references
inverse monoids
0 references
generators
0 references
strictly contractive relations
0 references
Munn trees
0 references
free inverse monoids
0 references
word problem
0 references
finitely based contractive variety
0 references
inverse semigroups
0 references
residually finite
0 references