Computable Abelian groups

Bulletin of Symbolic Logic 20 (3):315-356, (2014)
  Copy   BIBTEX

Abstract

We provide an introduction to methods and recent results on infinitely generated abelian groups with decidable word problem

Categories

Keywords

Reprint years

DOI

10.1017/bsl.2014.32

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 107,751

External links

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

Through your library

My notes

Similar books and articles

Abelian‐by‐G Groups, for G Finite, from the Model Theoretic Point of View.Annalisa Marcja & Carlo Toffalori - 1994 - Mathematical Logic Quarterly 40 (1):125-131.
Decidability and Computability of Certain Torsion-Free Abelian Groups.Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov & Daniel Turetsky - 2010 - Notre Dame Journal of Formal Logic 51 (1):85-96.
The model theory of finitely generated finite-by-Abelian groups.Francis Oger - 1984 - Journal of Symbolic Logic 49 (4):1115-1124.
Scott sentences for certain groups.Julia F. Knight & Vikram Saraph - 2018 - Archive for Mathematical Logic 57 (3-4):453-472.
Degrees of orders on torsion-free Abelian groups.Asher M. Kach, Karen Lange & Reed Solomon - 2013 - Annals of Pure and Applied Logic 164 (7-8):822-836.
Effective categoricity of Abelian p -groups.Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov & Andrei Morozov - 2009 - Annals of Pure and Applied Logic 159 (1-2):187-197.
From "metabelian q-vector spaces" to new ω-stable groups.Olivier Chapuis - 1996 - Bulletin of Symbolic Logic 2 (1):84-93.
Π10 classes and orderable groups.Reed Solomon - 2002 - Annals of Pure and Applied Logic 115 (1-3):279-302.
On the complexity of the classification problem for torsion-free Abelian groups of finite rank.Simon Thomas - 2001 - Bulletin of Symbolic Logic 7 (3):329-344.
New Degree Spectra of Abelian Groups.Alexander G. Melnikov - 2017 - Notre Dame Journal of Formal Logic 58 (4):507-525.

Analytics

Added to PP
2014-12-05

Downloads
26 (#1,006,530)

6 months
6 (#937,418)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Alexander Melnikov
National Research University Higher School of Economics

Citations of this work

Computable Presentations of C*-Algebras.F. O. X. Alec - 2024 - Journal of Symbolic Logic 89 (3):1313-1338.
Computable Topological Groups.K. O. H. Heer Tern, Alexander G. Melnikov & N. G. Keng Meng - 2025 - Journal of Symbolic Logic 90 (1):188-220.
The computational complexity of module socles.Huishan Wu - 2022 - Annals of Pure and Applied Logic 173 (5):103089.

View all 8 citations / Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Computable Models of Theories with Few Models.Bakhadyr Khoussainov, Andre Nies & Richard A. Shore - 1997 - Notre Dame Journal of Formal Logic 38 (2):165-178.
Degrees of structures.Linda Jean Richter - 1981 - Journal of Symbolic Logic 46 (4):723-731.

View all 24 references / Add more references