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

DOI10.2178/JSL/1107298523MaRDI QIDQ3370768zbMATH OpenOpenAlexWikidataFDO

Authors 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 groupsComputable structureshyperarithmetical hierarchyisomorphism problem

Mathematics Subject Classification ID

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

Abstract: Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider only countable members. This paper explores such a notion for classes of computable structures by working out a sequence of examples. We follow recent work by Goncharov and Knight in using the degree of the isomorphism problem for a class to distinguish classifiable classes from non-classifiable. In this paper, we calculate the degree of the isomorphism problem for Abelian $p$-groups of bounded Ulm length. The result is a sequence of classes whose isomorphism problems are cofinal in the hyperarithmetical hierarchy. In the process, new back-and-forth relations on such groups are calculated.

Recommendations

• Computability of the class of strongly constructivizable abelian \(p\)-groups
• scientific article; zbMATH DE number 1568930
• Computability of the class of strongly constructivizable Abelian \(p\)-groups
• On the computability of a class of periodic abelian groups
• THE ISOMORPHISM PROBLEM FOR MODULAR ABELIAN p-GROUP ALGEBRAS

Cites work

• A Borel reductibility theory for classes of countable structures
• Back and forth relations for reduced abelian p-groups
• Computable structures and the hyperarithmetical hierarchy
• Countable algebra and set existence axioms
• Degree spectra and computable dimensions in algebraic structures
• scientific article; zbMATH DE number 1226875 (Why is no real title available?)
• scientific article; zbMATH DE number 3308418 (Why is no real title available?)
• Labelling systems and r.e. structures
• Recursively presented Abelian groups: Effective p-Group theory. I
• The constructive theory of countable abelian p-groups
• Undecidable fragments of elementary theories

Cited in

(34)

• Index sets for some classes of structures
• Computability of the class of strongly constructivizable Abelian \(p\)-groups
• Computability of the class of strongly constructivizable abelian \(p\)-groups
• Scott sentences for certain groups
• Computable transformations of structures
• On the isomorphism problem for some classes of computable algebraic structures
• Enumerating abelian \(p\)-groups
• Scott sentences for equivalence structures
• The embedding problem for computable projective planes
• Boolean algebras, Tarski invariants, and index sets
• Computable abelian groups
• Comparing classes of finite sums
• Iterated effective embeddings of abelian p-groups
• Abelian p-groups and the halting problem
• On the n-back-and-forth types of Boolean algebras
• Classification from a Computable Viewpoint
• Isomorphisms, definable relations, and Scott families of class 2 nilpotent groups
• Equivalence Relations on Classes of Computable Structures
• A model-theoretic proof for P ≠ NP over all infinite abelian group
• Torsion-free abelian groups with optimal Scott families
• scientific article; zbMATH DE number 1568930 (Why is no real title available?)
• On Borel complexity of the isomorphism problems for graph related classes of Lie algebras and finite p-groups
• A first-order theory of Ulm type
• The complexity of decomposability of computable rings
• Computability in infinite Galois theory and algorithmically random algebraic fields
• Complexity of well-ordered sets in an ordered abelian group
• Failure modes for structural highness notions
• Computable formal contexts
• 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
• PAC learning, VC dimension, and the arithmetic hierarchy
• Computable numberings of the class of Boolean algebras with distinguished endomorphisms
• The isomorphism problem for torsion-free abelian groups is analytic complete

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

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