The isomorphism problem for computable Abelian p-groups of bounded length

DOI10.2178/jsl/1107298523zbMath1099.03031arXivmath/0406505OpenAlexW2004139322WikidataQ59199694 ScholiaQ59199694MaRDI QIDQ3370768

Wesley Calvert

Publication date: 8 February 2006

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0406505

zbMATH Keywords

Abelian groupsisomorphism problemhyperarithmetical hierarchyComputable structures

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 (18)

Comparing classes of finite sums ⋮ Torsion-free abelian groups with optimal Scott families ⋮ The embedding problem for computable projective planes ⋮ PAC learning, VC dimension, and the arithmetic hierarchy ⋮ Computable numberings of the class of Boolean algebras with distinguished endomorphisms ⋮ The complexity of decomposability of computable rings ⋮ Scott sentences for certain groups ⋮ The isomorphism problem for torsion-free abelian groups is analytic complete ⋮ Equivalence Relations on Classes of Computable Structures ⋮ The computable embedding problem ⋮ The \(\delta_\alpha^0\)-computable enumerations of the classes of projective planes ⋮ Complexity of the isomorphism problem for computable free projective planes of finite rank ⋮ Boolean algebras, Tarski invariants, and index sets ⋮ COMPUTABLE ABELIAN GROUPS ⋮ Index sets for some classes of structures ⋮ Scott sentences for equivalence structures ⋮ On the $n$-back-and-forth types of Boolean algebras ⋮ Classification from a Computable Viewpoint

Cites Work

• Unnamed Item
• Unnamed Item
• Labelling systems and r.e. structures
• Countable algebra and set existence axioms
• Computable structures and the hyperarithmetical hierarchy
• Degree spectra and computable dimensions in algebraic structures
• Back and forth relations for reduced abelian \(p\)-groups
• Undecidable fragments of elementary theories
• The constructive theory of countable abelian p-groups
• A Borel reductibility theory for classes of countable structures
• Recursively presented Abelian groups: Effective p-Group theory. I

This page was built for publication: The isomorphism problem for computable Abelian _p-groups of bounded length