Some algorithmic problems for relatively free groups
DOI10.1007/BF02362520zbMATH Open0898.20019OpenAlexW2049901765MaRDI QIDQ1126539FDOQ1126539
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
Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Commutator calculus (20F12) Solvable groups, supersolvable groups (20F16) Quasivarieties and varieties of groups (20E10)
Cites Work
- Varieties of groups
- Title not available (Why is that?)
- Unsolvability of the endomorphic reducibility problem in free nilpotent groups and in free rings
- Title not available (Why is that?)
- Some properties of a Magnus embedding
- On the complexity of the identity problem for finitely defined groups
- FINITE GROUPS HAVING ISOMORPHIC IMAGES IN EVERY FINITE GROUP OF WHICH THEY ARE HOMOMORPHIC IMAGES
- Title not available (Why is that?)
- Some recognizable properties of solvable groups
- A theorem on finitely generated hyperabelian groups
- On a Problem of J.H.C. Whitehead and a Problem of Alonzo Church.
- Uncountably many Varieties of Groups
- Title not available (Why is that?)
- Truth-table degrees and the Boone groups
- Title not available (Why is that?)
- Ein Rekursiv Aufzählbarer btt‐Grad, der Nicht Zum Wortproblem Einer Gruppe Gehört
- Title not available (Why is that?)
Cited In (2)
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)
