The complexity of central series in nilpotent computable groups

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

Abstract

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,150

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

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.
Computable structures and the hyperarithmetical hierarchy.C. J. Ash - 2000 - New York: Elsevier. Edited by J. Knight.
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.

Analytics

Added to PP
2013-10-27

Downloads
31 (#517,462)

6 months
6 (#526,006)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

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

Add more citations

References found in this work

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

Add more references