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

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

Ralph Strebel, Dion Gildenhuys, Gilbert Baumslag

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

undecidabilitysolvable Lie algebrasisomorphism problemderived lengthalgorithmic problemsinsoluble word problem3- step solublefinitely presented Lie algebraMinsky routines

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable, nilpotent (super)algebras (17B30) Lie algebras and Lie superalgebras (17B99)

Related Items

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

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