Enumerating limit groups. (Q838396)

From the introduction: ``This paper is the first of a series, in which we intend to prove algorithmic versions of Sela's results.'' The main result of the present article is Theorem A: The class of limit groups is recursively enumerable. Also, Theorem C (resp. Corollary 4.3) states the existence of an algorithm which given a presentation for a group and a solution to the word problem in it, determines whether the group is a limit group (resp. a free group). A key tool is the use of local retractions inspired by \textit{D. D. Long} and \textit{A. W. Reid} [Topology 47, No. 3, 137-159 (2008; Zbl 1169.57003)].