Finitely Presented Groups with Word Problems of Arbitrary Degrees of Insolubility

DOI10.1112/PLMS/S3-14.4.633MaRDI QIDQ5639879zbMATH OpenOpenAlexFDO

Authors C. R. J. Clapham

Publication date 1964

Published in Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/plms/s3-14.4.633

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cited in

(20)

• Model-theoretic and algorithmic questions in group theory
• Unsolvable algorithmic problems for semigroups, groups and rings
• m-degrees of the word problem
• Decision problems in classes of group presentations with uniformly solvable word problem
• Infinitely generated subgroups of finitely presented groups. I
• An automaton group with undecidable order and Engel problems
• Gröbner-Shirshov bases, conformal algebras, and pseudo-algebras.
• Recursively enumerable degress and the conjugacy problem
• On the complexity of the identity problem for finitely defined groups
• Degrees of unsolvability of the conjugacy problem for finitely-presented groups
• Representation of Turing reducibility by word and conjugacy problems in finitely presented groups
• The conjugacy problem for a free product with amalgamation
• An algebraic characterization of groups with soluble word problem
• scientific article; zbMATH DE number 3439107 (Why is no real title available?)
• Amenable groups without finitely presented amenable covers
• The computability of group constructions II
• Word problems and ceers
• Two results on complexities of decision problems of groups
• HNN extensions and embedding theorems for groups
• Embeddings in finitely presented groups which preserve the center.

This page was built for publication: Finitely Presented Groups with Word Problems of Arbitrary Degrees of Insolubility

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