Enumerating abelian \(p\)-groups

DOI10.1016/j.jalgebra.2020.04.039zbMath1457.03060OpenAlexW3033091735MaRDI QIDQ2193224

Alexander G. Melnikov, Keng Meng Ng, Rodney G. Downey

Publication date: 25 August 2020

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgebra.2020.04.039

zbMATH Keywords

abelian groupsclassification problemsFriedberg enumerationapplications of Turing computability

Mathematics Subject Classification ID

Torsion groups, primary groups and generalized primary groups (20K10) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items

Punctual dimension of algebraic structures in certain classes ⋮ Computable topological abelian groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Abelian \(p\)-groups and the halting problem
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Computable models of theories with few models
• Computable structures and the hyperarithmetical hierarchy
• Computable torsion abelian groups
• Classifications of computable structures
• Constructive Abelian \(p\)-groups
• COMPUTABLE ABELIAN GROUPS
• Limitwise monotonic sequences and degree spectra of structures
• Classifications of countably-based abelian profinite groups
• Solvable Group Isomorphism Is (Almost) in NP ∩ coNP
• Computable completely decomposable groups
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Ulm's Theorem for Partially Ordered Structures Related to Simply Presented Abelian p-Groups
• A Friedberg enumeration of equivalence structures
• CONSTRUCTIVE ALGEBRAS I
• Computable Algebra, General Theory and Theory of Computable Fields

This page was built for publication: Enumerating abelian \(p\)-groups