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

DOI10.1016/0022-4049(86)90136-2zbMath0577.20021OpenAlexW3023099848WikidataQ115364450 ScholiaQ115364450MaRDI QIDQ1065930

Ralph Strebel, Dion Gildenhuys, Gilbert Baumslag

Publication date: 1986

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-4049(86)90136-2

zbMATH Keywords

soluble groupsfinitely presented groupisomorphism problemcentral wordsalgorithmic problemsinsoluble word problemKharlampovich's theoremrecursive set

Mathematics Subject Classification ID

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 (14)

Infinite presentability of groups and condensation ⋮ Undecidability of the identity problem for finite semigroups ⋮ Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. III ⋮ THE RECOGNITION COMPLEXITY OF DECIDABLE THEORIES ⋮ Deciding if an automorphism of an infinite soluble group is inner ⋮ Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two ⋮ Finitely presented solvable groups and Lie algebras with unsolvable word problem ⋮ The algorithmic theory of polycyclic-by-finite groups ⋮ Subgroups of free metabelian groups. ⋮ Amenable groups without finitely presented amenable covers ⋮ The Algorithmic Theory of Finitely Generated Metabelian Groups ⋮ The third commutant membership problem in solvable groups ⋮ The isomorphism problem for toral relatively hyperbolic groups. ⋮ European Summer Meeting of the Association for Symbolic Logic, Uppsala 1991

Cites Work

• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• The equality problem and free products of Lie algebras and of associative algebras
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. III
• Subalgebras of finitely presented solvable Lie algebras
• Subgroups of finitely presented metabelian groups
• Unnamed Item
• Unnamed Item
• Unnamed Item

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