On the computability of a class of periodic abelian groups
From MaRDI portal
Publication:5457778
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
Cited in
(12)- The isomorphism problem for computable Abelian p-groups of bounded length
- Computability of the class of strongly constructivizable Abelian \(p\)-groups
- Computability of the class of strongly constructivizable abelian \(p\)-groups
- Abelian \(p\)-groups and the halting problem
- The complexity of inversion in groups
- Polynomial-time Abelian groups
- Enumerating abelian \(p\)-groups
- Computable topological groups and Pontryagin duality
- Decidability and computability of certain torsion-free abelian groups
- Computable abelian groups
- Computable torsion abelian groups
- scientific article; zbMATH DE number 1568930 (Why is no real title available?)
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)