Degrees of orders on torsion-free Abelian groups

Annals of Pure and Applied Logic 164 (7-8):822-836 (2013)
  Copy   BIBTEX

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 degree

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

On stable torsion-free nilpotent groups.Claus Grünenwald & Frieder Haug - 1993 - Archive for Mathematical Logic 32 (6):451-462.
Reverse Mathematics and Fully Ordered Groups.Reed Solomon - 1998 - Notre Dame Journal of Formal Logic 39 (2):157-189.
Space complexity of Abelian groups.Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel & Zia Uddin - 2009 - Archive for Mathematical Logic 48 (1):115-140.
Infinitary properties of abelian torsion groups.Jon Barwise & Paul Eklof - 1970 - Annals of Mathematical Logic 2 (1):25-68.
CM-Triviality and stable groups.Frank O. Wagner - 1998 - Journal of Symbolic Logic 63 (4):1473-1495.

Analytics

Added to PP
2013-12-12

Downloads
431 (#43,718)

6 months
5 (#629,136)

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,.
Orders on computable rings.Huishan Wu - 2020 - Mathematical Logic Quarterly 66 (2):126-135.

Add more citations

References found in this work

Recursion theory and ordered groups.R. G. Downey & Stuart A. Kurtz - 1986 - Annals of Pure and Applied Logic 32:137-151.
Graph colorings and recursively bounded Π10-classes.J. B. Remmel - 1986 - Annals of Pure and Applied Logic 32:185-194.
Countable algebra and set existence axioms.Harvey M. Friedman - 1983 - Annals of Pure and Applied Logic 25 (2):141.
Degree spectra of intrinsically C.e. Relations.Denis R. Hirschfeldt - 2001 - Journal of Symbolic Logic 66 (2):441-469.
Every recursive boolean algebra is isomorphic to one with incomplete atoms.Rod Downey - 1993 - Annals of Pure and Applied Logic 60 (3):193-206.

View all 11 references / Add more references