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

DOI10.1016/0022-4049(88)90022-9zbMath0669.17019WikidataQ115364444 ScholiaQ115364444MaRDI QIDQ1118677

Gilbert Baumslag, Ralph Strebel, Dion Gildenhuys

Publication date: 1988

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(88)90022-9

zbMATH Keywords

undecidability; solvable Lie algebras; isomorphism problem; derived length; algorithmic problems; insoluble word problem; 3- step soluble; finitely presented Lie algebra; Minsky routines

Mathematics Subject Classification ID

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

17B30: Solvable, nilpotent (super)algebras

17B99: Lie algebras and Lie superalgebras

Related Items

Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I, On commutator ideals in free Lie algebras.

Cites Work

• Unnamed Item
• 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. I
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II
• Equality problem for center-by-metabelian Lie algebras
• Subalgebras of finitely presented solvable Lie algebras
• A FINITELY PRESENTED SOLVABLE GROUP WITH UNSOLVABLE WORD PROBLEM