Algorithmic problems for solvable Lie algebras

DOI10.1007/BF01674778zbMath0445.17010WikidataQ115393246 ScholiaQ115393246MaRDI QIDQ1145202

G. P. Kukin

Publication date: 1979

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/187021

zbMATH Keywords

unsolvable word problemvariety of Lie algebras

Mathematics Subject Classification ID

Identities, free Lie (super)algebras (17B01) Solvable, nilpotent (super)algebras (17B30) Word problems, etc. in computability and recursion theory (03D40)

Related Items (4)

Unsolvable algorithmic problems for semigroups, groups and rings ⋮ Recursively enumerable m- and tt-degrees. I: The quantity of m-degrees ⋮ tt-degrees of recursively enumerable Turing degrees. II ⋮ Nonassociative rings

Cites Work

• The isomorphism problem for solvable groups
• The subalgebras of free Lie \(p\)-algebras
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithmic problems for solvable Lie algebras