COMPUTABLE ABELIAN GROUPS
- 1 September 2014
- journal article
- research article
- Published by Cambridge University Press (CUP) in The Bulletin of Symbolic Logic
- Vol. 20 (3) , 315-356
Abstract
We provide an introduction to methods and recent results on infinitely generated abelian groups with decidable word problem.Keywords
This publication has 64 references indexed in Scilit:
- Degrees of orders on torsion-free Abelian groupsAnnals of Pure and Applied Logic, 2013
- Effective categoricity of Abelian -groupsAnnals of Pure and Applied Logic, 2009
- The computable dimension of ordered abelian groupsAdvances in Mathematics, 2003
- Degree spectra and computable dimensions in algebraic structuresAnnals of Pure and Applied Logic, 2002
- Back and forth relations for reduced abelian p-groupsAnnals of Pure and Applied Logic, 1995
- Recursion theory and ordered groupsAnnals of Pure and Applied Logic, 1986
- Hierarchies of torsion-free Abelian groupsAlgebra and Logic, 1986
- Nonconstructivizability of the reduced part of a strongly constructive torsion-free Abelian groupAlgebra and Logic, 1985
- Strongly constructive abelian p-groupsAlgebra and Logic, 1983
- Problem of the number of non-self-equivalent constructivizationsAlgebra and Logic, 1980