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.

• Type: Journal
• Year: 2011
• Where: APAL
• Authors: Barbara F. Csima, Reed Solomon
• Keywords: APAL 2011, Computable Orders, Lower Central Series, Nilpotent Computable Group, Software Engineering