Some algorithmic problems for relatively free groups

DOI10.1007/BF02362520MaRDI QIDQ1126539zbMATH OpenOpenAlexFDO

Authors M. I. Anokhin

Publication date 10 December 1996

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02362520

zbMATH Keywords

finitely presented solvable groupsundecidable torsion-freenessword problems

Mathematics Subject Classification ID

Quasivarieties and varieties of groups (20E10) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Commutator calculus (20F12) Solvable groups, supersolvable groups (20F16)

Review text

It is shown that within the class of \(2\)-generator, finitely presented solvable groups, torsion-freeness is unrecognizable. Related results are also obtained.

Cites work

• A theorem on finitely generated hyperabelian groups
• Ein Rekursiv Aufzählbarer btt‐Grad, der Nicht Zum Wortproblem Einer Gruppe Gehört
• FINITE GROUPS HAVING ISOMORPHIC IMAGES IN EVERY FINITE GROUP OF WHICH THEY ARE HOMOMORPHIC IMAGES
• scientific article; zbMATH DE number 3815951 (Why is no real title available?)
• scientific article; zbMATH DE number 3779604 (Why is no real title available?)
• scientific article; zbMATH DE number 529781 (Why is no real title available?)
• scientific article; zbMATH DE number 3794324 (Why is no real title available?)
• scientific article; zbMATH DE number 3218869 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• On a Problem of J.H.C. Whitehead and a Problem of Alonzo Church.
• On the complexity of the identity problem for finitely defined groups
• Some properties of a Magnus embedding
• Some recognizable properties of solvable groups
• Truth-table degrees and the Boone groups
• Uncountably many Varieties of Groups
• Unsolvability of the endomorphic reducibility problem in free nilpotent groups and in free rings
• Varieties of groups

Cited in

(2)

• Algorithmic problems for free-Abelian times free groups.
• scientific article; zbMATH DE number 2144700 (Why is no real title available?)

This page was built for publication: Some algorithmic problems for relatively free groups

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