A FINITELY PRESENTED SOLVABLE GROUP WITH UNSOLVABLE WORD PROBLEM

DOI10.1070/IM1982v019n01ABEH001405zbMath0494.20021OpenAlexW1985990310MaRDI QIDQ3957135

O. G. Kharlampovich

Publication date: 1982

Published in: Mathematics of the USSR-Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/im1982v019n01abeh001405

zbMATH Keywords

unsolvable word problemfinitely presented solvable group

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

Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. III ⋮ An example of a fractal finitely generated solvable group ⋮ THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED ⋮ The complexity of Grigorchuk groups with application to cryptography ⋮ Subgroups of free metabelian groups. ⋮ A sufficient condition for finite presentability of abelian-by-nilpotent groups. ⋮ Diophantine problems in solvable groups

This page was built for publication: A FINITELY PRESENTED SOLVABLE GROUP WITH UNSOLVABLE WORD PROBLEM