Finitely Presented Groups with Word Problems of Arbitrary Degrees of Insolubility
From MaRDI portal
Publication:5639879
DOI10.1112/plms/s3-14.4.633zbMath0232.20063OpenAlexW2001162243MaRDI QIDQ5639879
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
Related Items (18)
Unnamed Item ⋮ Embeddings in finitely presented groups which preserve the center. ⋮ Unsolvable algorithmic problems for semigroups, groups and rings ⋮ m-degrees of the word problem ⋮ Word problems and ceers ⋮ Decision problems in classes of group presentations with uniformly solvable word problem ⋮ An automaton group with undecidable order and Engel problems ⋮ The computability of group constructions II ⋮ An algebraic characterization of groups with soluble word problem ⋮ Gröbner-Shirshov bases, conformal algebras, and pseudo-algebras. ⋮ Amenable groups without finitely presented amenable covers ⋮ Infinitely generated subgroups of finitely presented groups. I ⋮ 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 ⋮ Model-theoretic and algorithmic questions in group theory
This page was built for publication: Finitely Presented Groups with Word Problems of Arbitrary Degrees of Insolubility
