| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6424786 | Annals of Pure and Applied Logic | 2013 | 15 Pages |
Abstract
We show that if H is an effectively completely decomposable computable torsion-free abelian group, then there is a computable copy G of H such that G has computable orders but not orders of every (Turing) degree.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
Asher M. Kach, Karen Lange, Reed Solomon,