A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier) (Q1892306)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 762340
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier) |
scientific article; zbMATH DE number 762340 |
Statements
A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier) (English)
0 references
3 July 1995
0 references
The paper deals with Squier's arguments on finite derivation type [\textit{C. C. Squier}, J. Pure Appl. Algebra 49, 201-217 (1987; Zbl 0648.20045); \textit{C. C. Squier} and \textit{F. Otto}, Lect. Notes Comput. Sci. 256, 74-82 (1987; Zbl 0625.03023)]. Proofs are made shorter and easier by categorical machinery. Squier's finiteness condition is of invariant type. It can be defined in terms of a finite presentation, but does not depend on the choice of this presentation. The result is that if a monoid has finite derivation type, then its third homology group is of finite type.
0 references
finite derivation type
0 references
finiteness condition
0 references
finite presentation
0 references
monoid
0 references
homology group
0 references
0.8745405077934265
0 references
0.870945930480957
0 references
0.862190306186676
0 references
0.8587504625320435
0 references
