Annals of Pure and Applied Logic 162 (8):667-678 (2011)

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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1016/j.apal.2011.01.011
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 51,707
Through your library

References found in this work BETA

Reverse Mathematics and Fully Ordered Groups.Reed Solomon - 1998 - Notre Dame Journal of Formal Logic 39 (2):157-189.

Add more references

Citations of this work BETA

Computable Abelian Groups.Alexander G. Melnikov - 2014 - Bulletin of Symbolic Logic 20 (3):315-356,.

Add more citations

Similar books and articles

Stability of Nilpotent Groups of Class 2 and Prime Exponent.Alan H. Mekler - 1981 - Journal of Symbolic Logic 46 (4):781-788.
Uncomputably Noisy Ergodic Limits.Jeremy Avigad - 2012 - Notre Dame Journal of Formal Logic 53 (3):347-350.
Tailoring Recursion for Complexity.Erich Grädel & Yuri Gurevich - 1995 - Journal of Symbolic Logic 60 (3):952-969.
Poly-Separated and Ω-Stable Nilpotent Groups.Ali Nesin - 1991 - Journal of Symbolic Logic 56 (2):694-699.
Existentially Complete Torsion-Free Nilpotent Groups.D. Saracino - 1978 - Journal of Symbolic Logic 43 (1):126-134.


Added to PP index

Total views
15 ( #616,688 of 2,333,390 )

Recent downloads (6 months)
1 ( #587,782 of 2,333,390 )

How can I increase my downloads?


My notes