On the computability of a class of periodic abelian groups

zbMATH Open1132.03346MaRDI QIDQ5457778FDOQ5457778

Authors: B. S. Kalenova, N. G. Khisamiev 

Publication date: 14 April 2008

Recommendations

• Computability of the class of strongly constructivizable abelian \(p\)-groups
• Decidability and computability of certain torsion-free abelian groups
• Computability of the class of strongly constructivizable Abelian \(p\)-groups
• Constructive Abelian \(p\)-groups
• scientific article; zbMATH DE number 14727

zbMATH Keywords

computable representationclass of modelsuniformly constructive sequence

Mathematics Subject Classification ID

Torsion groups, primary groups and generalized primary groups (20K10) Theory of numerations, effectively presented structures (03D45)

Cited In (12)

• Decidability and computability of certain torsion-free abelian groups
• Computability of the class of strongly constructivizable Abelian \(p\)-groups
• Computability of the class of strongly constructivizable abelian \(p\)-groups
• Computable topological groups and Pontryagin duality
• Computable abelian groups
• Computable torsion abelian groups
• Abelian \(p\)-groups and the halting problem
• Enumerating abelian \(p\)-groups
• The complexity of inversion in groups
• Title not available (Why is that?)
• Polynomial-time Abelian groups
• The isomorphism problem for computable Abelian _p-groups of bounded length

This page was built for publication: On the computability of a class of periodic abelian groups

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