Abstract
For a countable structure A, the (Turing) degree spectrum of A is the set of all Turing degrees of its isomorphic copies. If the degree spectrum of A has the least degree d, then we say that d is the (Turing) degree of the isomorphism type of A. So far, degrees of the isomorphism types have been studied for abelian and metabelian groups. Here, we focus on highly nonabelian groups. We show that there are various centerless groups whose isomorphism types have arbitrary Turing degrees. We also show that there are various centerless groups whose isomorphism types do not have Turing degrees.
| Original language | English |
|---|---|
| Pages (from-to) | 3383-3391 |
| Number of pages | 9 |
| Journal | Proceedings of the American Mathematical Society |
| Volume | 135 |
| Issue number | 10 |
| DOIs | |
| State | Published - Oct 2007 |
Keywords
- Computable structure
- Degree spectrum
- Group
- Isomorphism
- Turing degree
Fingerprint
Dive into the research topics of 'Turing degrees of nonabelian groups'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver