Sciweavers

APAL
2011
12 years 10 months ago
The complexity of central series in nilpotent computable groups
The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are indepe...
Barbara F. Csima, Reed Solomon