- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The complexity of central series in nilpotent computable groups
Annals of Pure and Applied Logic 162 (8):667-678 (2011)
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 ordersLinks
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
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.
Applications of Kolmogorov Complexity to Computable Model Theory.B. Khoussainov, P. Semukhin & F. Stephan - 2007 - Journal of Symbolic Logic 72 (3):1041 - 1054.
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.
On Computable Self-Embeddings of Computable Linear Orderings.Rodney G. Downey, Bart Kastermans & Steffen Lempp - 2009 - Journal of Symbolic Logic 74 (4):1352 - 1366.
Intrinsic bounds on complexity and definability at limit levels.John Chisholm, Ekaterina B. Fokina, Sergey S. Goncharov, Valentina S. Harizanov, Julia F. Knight & Sara Quinn - 2009 - Journal of Symbolic Logic 74 (3):1047-1060.
Poly-separated and ω-stable nilpotent groups.Ali Nesin - 1991 - Journal of Symbolic Logic 56 (2):694-699.
Preservation of saturation and stability in a variety of nilpotent groups.Pat Rogers - 1981 - Journal of Symbolic Logic 46 (3):499-512.
Existentially complete torsion-free nilpotent groups.D. Saracino - 1978 - Journal of Symbolic Logic 43 (1):126-134.
Existentially closed torsion-free nilpotent groups of class three.Berthold J. Maier - 1984 - Journal of Symbolic Logic 49 (1):220-230.
Classes of Ulm type and coding rank-homogeneous trees in other structures.E. Fokina, J. F. Knight, A. Melnikov, S. M. Quinn & C. Safranski - 2011 - Journal of Symbolic Logic 76 (3):846 - 869.
Analytics
Added to PP
2013-10-27
Downloads
30 (#521,181)
6 months
5 (#638,139)
2013-10-27
Downloads
30 (#521,181)
6 months
5 (#638,139)
Historical graph of downloads
Citations of this work
Computable Abelian groups.Alexander G. Melnikov - 2014 - Bulletin of Symbolic Logic 20 (3):315-356,.
References found in this work
Degree spectra and computable dimensions in algebraic structures.Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore & Arkadii M. Slinko - 2002 - Annals of Pure and Applied Logic 115 (1-3):71-113.
Reverse Mathematics and Fully Ordered Groups.Reed Solomon - 1998 - Notre Dame Journal of Formal Logic 39 (2):157-189.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-4c2ch uwo