Some algorithmic problems for relatively free groups

DOI10.1007/BF02362520zbMath0898.20019OpenAlexW2049901765MaRDI QIDQ1126539

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

word problemsfinitely presented solvable groupsundecidable torsion-freeness

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some recognizable properties of solvable groups
• Unsolvability of the endomorphic reducibility problem in free nilpotent groups and in free rings
• A theorem on finitely generated hyperabelian groups
• On the complexity of the identity problem for finitely defined groups
• Truth-table degrees and the Boone groups
• Some properties of a Magnus embedding
• FINITE GROUPS HAVING ISOMORPHIC IMAGES IN EVERY FINITE GROUP OF WHICH THEY ARE HOMOMORPHIC IMAGES
• Ein Rekursiv Aufzählbarer btt‐Grad, der Nicht Zum Wortproblem Einer Gruppe Gehört
• Varieties of groups
• On a Problem of J.H.C. Whitehead and a Problem of Alonzo Church.
• Uncountably many Varieties of Groups

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