OpenAlex
On the difficulty of presenting finitely presentable groups
Work
Year: 2011
Type: article
Abstract: We exhibit classes of groups in which the word problem is uniformly solvable but in which there is no algorithm that can compute finite presentations for finitely presentable subgroups. Direct product... more
Cites: 48
Cited by: 7
Related to: 10
FWCI: 0.833
Citation percentile (by year/subfield): 66.94
Open Access status: bronze