Space complexity of Abelian groups

Archive for Mathematical Logic 48 (1):115-140 (2009)
  Copy   BIBTEX

Abstract

We develop a theory of LOGSPACE structures and apply it to construct a number of examples of Abelian Groups which have LOGSPACE presentations. We show that all computable torsion Abelian groups have LOGSPACE presentations and we show that the groups ${\mathbb {Z}, Z(p^{\infty})}$, and the additive group of the rationals have LOGSPACE presentations over a standard universe such as the tally representation and the binary representation of the natural numbers. We also study the effective categoricity of such groups. For example, we give conditions are given under which two isomorphic LOGSPACE structures will have a linear space isomorphism.

Other Versions

original Uddin, Zia; Remmel, Jeffrey B.; Downey, Rodney G.; Cenzer, Douglas (2008) "Space complexity of Abelian groups". Archive for Mathematical Logic 48(1):

Links

PhilArchive

External links

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

Through your library

Analytics

Added to PP
2013-11-23

Downloads
129 (#350,306)

6 months
1 (#2,183,658)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Description of structures computable in polynomial time.Pavel E. Alaev - 2026 - Annals of Pure and Applied Logic 177 (1):103636.
Lattice Embeddings and Punctual Linear Orders.Marina Dorzhieva & Ellen Hammatt - forthcoming - Journal of Symbolic Logic:1-29.

Add more citations

References found in this work

Polynomial-time abelian groups.Douglas Cenzer & Jeffrey Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):313-363.
Polynomial-time versus recursive models.Douglas Cenzer & Jeffrey Remmel - 1991 - Annals of Pure and Applied Logic 54 (1):17-58.
Complexity-theoretic algebra II: Boolean algebras.A. Nerode & J. B. Remmel - 1989 - Annals of Pure and Applied Logic 44 (1-2):71-99.

Add more references