Computable completely decomposable groups

DOI10.1090/S0002-9947-2014-06115-1zbMath1341.03056OpenAlexW2059389084MaRDI QIDQ3190417

Alexander G. Melnikov, Rodney G. Downey

Publication date: 17 September 2014

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9947-2014-06115-1

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (15)

Abelian \(p\)-groups and the halting problem ⋮ Torsion-free abelian groups with optimal Scott families ⋮ The complexity of decomposability of computable rings ⋮ Enumerating abelian \(p\)-groups ⋮ A Friedberg enumeration of equivalence structures ⋮ Independence in computable algebra ⋮ COMPUTABLE ABELIAN GROUPS ⋮ Categoricity spectra of computable structures ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Decompositions of decidable abelian groups ⋮ Categorical linearly ordered structures ⋮ ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES ⋮ The decomposability problem for torsion-free abelian groups is analytic-complete ⋮ Computable topological abelian groups ⋮ On \(\Delta_2^0\)-categoricity of equivalence relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degrees of orders on torsion-free abelian groups
• Enumerations and completely decomposable torsion-free abelian groups
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Decidability and computability of certain torsion-free abelian groups
• Finite rank torsion free Abelian groups and rings
• Handbook of algebra. Volume 2
• Computable structures and the hyperarithmetical hierarchy
• Effectively completely decomposable Abelian groups.
• \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
• Back and forth relations for reduced abelian \(p\)-groups
• Effectively categorical abelian groups
• Abelian groups without elements of finite order
• Limitwise monotonic sequences and degree spectra of structures
• Effective procedures in field theory
• Computable Ordered Abelian Groups and Fields
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Effective content of field theory
• Abelian Group Theory and Related Topics
• LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
• A Class of Torsion-Free Abelian Groups of Finite Rank
• Computable Algebra, General Theory and Theory of Computable Fields

This page was built for publication: Computable completely decomposable groups