Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II
DOI10.1016/0021-8693(85)90085-7zbMath0579.20031OpenAlexW4205201762WikidataQ115366933 ScholiaQ115366933MaRDI QIDQ1067006
Gilbert Baumslag, Dion Gildenhuys, Ralph Strebel
Publication date: 1985
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-8693(85)90085-7
finitely presented groupisomorphism problemalgorithmic problemsdirect decomposabilityinsoluble word problemalgorithmic undecidability in soluble groups
Solvable groups, supersolvable groups (20F16) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursive unsolvability of group theoretic problems
- Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II
- Some recognizable properties of solvable groups
- On the algorithmic insolvability of the word problem in group theory
- Some Unsolvable Problems about Elements and Subgroups of Groups.
- On Group-Theoretic Decision Problems and Their Classification. (AM-68)
This page was built for publication: Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II