Sciweavers

Share
APAL
2011

The complexity of central series in nilpotent computable groups

9 years 5 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 independent even when restricted to groups which admit computable orders.
Barbara F. Csima, Reed Solomon
Added 12 May 2011
Updated 12 May 2011
Type Journal
Year 2011
Where APAL
Authors Barbara F. Csima, Reed Solomon
Comments (0)
books