This is not my area of research, but I am curious. Let $G=\left< XR \right>$ be a finitely presented group, where $X$ and $R$ are finite. There are many questions which are undecidable for all such $G$, for example whether $G$ is trivial or whether a particular word is trivial in $G$. Is there any nontrivial question (by trivial I mean that the answer is always yes or always no) which is decidable? For instance, is there a class $S$ (nonempty and not equal to all the finitely presented groups) such you can always decide whether $G$ is in this class?
Take the 2minute tour
×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

The problem whether $G$ is perfect, that is $G=[G,G]$ is decidable because you need to abelianize all relations and solve a system of linear equations over $\mathbb Z$. 


Many of the undecidable properties of finitely presented groups are verifiable i.e. if they are true, then they can be proved true. Such properities include trivial, finite, abelian, nilpotent, free, automatic, hyperbolic, isomorphic to some other specified finitely presented group. As a followup question, are there any properties of finitely presented groups that are known to be neither verifiable nor for there negation to be verifiable? Might solvability be such a property? 

