Decidability and computability of certain torsion-free abelian groups

DOI10.1215/00294527-2010-006zbMath1211.03063OpenAlexW1976264814MaRDI QIDQ976537

Julia F. Knight, Asher M. Kach, Oleg V. Kudinov, Alexander G. Melnikov, Sergei S. Goncharov, Rodney G. Downey, Daniel D. Turetsky

Publication date: 11 June 2010

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1215/00294527-2010-006

zbMATH Keywords

coding in groupscompletely decomposable torsion-free abelian groups

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Torsion-free groups, infinite rank (20K20) Torsion-free groups, finite rank (20K15) Theory of numerations, effectively presented structures (03D45)

Related Items (7)

Effectively categorical abelian groups ⋮ Computable completely decomposable groups ⋮ Degrees of orders on torsion-free abelian groups ⋮ On Constructive Nilpotent Groups ⋮ COMPUTABLE ABELIAN GROUPS ⋮ The decomposability problem for torsion-free abelian groups is analytic-complete ⋮ Индексное множество автоустойчивых упорядоченных абелевых групп

This page was built for publication: Decidability and computability of certain torsion-free abelian groups