Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II

DOI10.1016/0021-8693(85)90085-7zbMATH Open0579.20031OpenAlexW4205201762WikidataQ115366933 ScholiaQ115366933MaRDI QIDQ1067006FDOQ1067006

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

Recommendations

• scientific article; zbMATH DE number 3875527
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. III
• Publication:3033961
• scientific article; zbMATH DE number 3884377

zbMATH Keywords

isomorphism problemfinitely presented groupalgorithmic problemsdirect decomposabilityalgorithmic undecidability in soluble groupsinsoluble word problem

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable groups, supersolvable groups (20F16)

Cites Work

• Title not available (Why is that?)
• On Group-Theoretic Decision Problems and Their Classification. (AM-68)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the algorithmic insolvability of the word problem in group theory
• Recursive unsolvability of group theoretic problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II
• Some Unsolvable Problems about Elements and Subgroups of Groups.
• Some recognizable properties of solvable groups
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (18)

• Recognizing a relatively hyperbolic group by its Dehn fillings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I
• Unsolvable algorithmic problems for semigroups, groups and rings
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II
• Title not available (Why is that?)
• The isomorphism problem for all hyperbolic groups.
• Title not available (Why is that?)
• Undecidability of the centers of groups and group algebras.
• Title not available (Why is that?)
• The third commutant membership problem in solvable groups
• The isomorphism problem for residually torsion-free nilpotent groups.
• Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two
• Title not available (Why is that?)
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. III
• Deciding if an automorphism of an infinite soluble group is inner
• Finitely presented solvable groups and Lie algebras with unsolvable word problem

This page was built for publication: Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II

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