Enumerating abelian \(p\)-groups (Q2193224): Difference between revisions

A class \(\mathcal{K}\) of structures is said to have a Friedberg enumeration if there is a computable family \(\mathcal{A}_i\), \(i<\omega\) of computable structures in \(\mathcal{K}\) such that every computable structure in \(\mathcal{K}\) is classically isomorphic to some \(\mathcal{A}_i\), for exactly one \(i<\omega\). The authors prove that for each natural number \(n >0\) there is a Friedberg enumeration of all computable abelian \(p\)-groups of Ulm type \(\leq n\). As a corollary they obtain that for each natural number \(n>0\) there exists a Friedberg enumeration of recursive pro-\(p\)-abelian groups of pro-Ulm type \(\leq n\).