Decidability and computability of certain torsion-free abelian groups

DOI10.1215/00294527-2010-006zbMATH Open1211.03063OpenAlexW1976264814MaRDI QIDQ976537FDOQ976537

Authors: Asher M. Kach, J. F. Knight, Oleg Kudinov, Alexander Melnikov, Rodney G. Downey, S. S. Goncharov, Daniel 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

Recommendations

• Computable torsion abelian groups
• Decompositions of decidable abelian groups
• Computable abelian groups
• On the computational complexity of the theory of Abelian groups
• On the computability of a class of periodic abelian groups
• On the undecidability of some classes of abelian-by-finite groups
• scientific article
• On the complexity of computation in finite Abelian, nilpotent and soluble groups
• Computability of the class of strongly constructivizable Abelian \(p\)-groups
• Computability of the class of strongly constructivizable abelian \(p\)-groups

zbMATH Keywords

coding in groupscompletely decomposable torsion-free abelian groups

Mathematics Subject Classification ID

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

Cited In (20)

• Computable completely decomposable groups
• Enumerations and completely decomposable torsion-free abelian groups
• On decidability of amenability in computable groups
• Title not available (Why is that?)
• Computability of the class of strongly constructivizable Abelian \(p\)-groups
• On Constructive Nilpotent Groups
• Computability of the class of strongly constructivizable abelian \(p\)-groups
• Computable abelian groups
• Computable torsion abelian groups
• On the computability of a class of periodic abelian groups
• Индексное множество автоустойчивых упорядоченных абелевых групп
• On \(\Sigma\)-subsets of naturals over abelian groups
• Undecidable theories of valuated abelian groups
• The Join Levels of the Trotter-Weil Hierarchy Are Decidable
• The computational complexity of torsion-freeness of finitely presented groups
• Title not available (Why is that?)
• Effectively completely decomposable Abelian groups.
• Effectively categorical abelian groups
• The decomposability problem for torsion-free abelian groups is analytic-complete
• Degrees of orders on torsion-free abelian groups

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976537)