scientific article; zbMATH DE number 4014693

From MaRDI portal
Publication:3026992





[For the entire collection see Zbl 0619.00025.] The main purpose of this paper is to describe a negative answer to the following question: Does every finitely presented monoid with a decidable word problem have a presentation (\(\Sigma\) ;R) where R is a finite canonical rewriting system? To obtain this answer a certain homological finiteness condition for monoids is considered. If M is a monoid that can be presented by a finite canonical rewriting system, then M is an \((FP)_ 3\)-monoid. Since there are well-known examples of finitely presented groups that have easily decidable word problem, but that do not meet this condition, this implies that there are finitely presented monoids (and groups) with decidable word problem that cannot be presented by finite canonical rewriting systems.




Cited in
(26)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3026992)