All Questions

The (uniform) word problem for groups can be stated in several equivalent ways: Word Problem for Groups (WP) Instance: A finite presentation of a group G and an element w of G as a product of ...

Let $G$ be a f.g. nilpotent group. I wanted to know if the order problem (given $g \in G$, deciding if there exists $n$ s.t. $g^n=e$) is decidable in $G$? In such a group, the word problem is ...

I would like to know of any examples of families of groups that are known (or conjectured) to have a solvable uniform word problem, i.e. an algorithm that given a presentation $P$ of a group in the ...

For which properties (P) [of groups] does the following hold: given a group $G$ which has a finite presentation with at most $n$ relations of length at most $\ell$, there is a $R(n,\ell)$ so that, if ...