Decompositions of decidable abelian groups

DOI10.1142/S0218196719500644OpenAlexW2970632373WikidataQ114614822 ScholiaQ114614822MaRDI QIDQ5216188

Alexander G. Melnikov, Nikolay Bazhenov, Sergei S. Goncharov

Publication date: 17 February 2020

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196719500644

zbMATH Keywords

abelian groupdegree of categoricitycomputable categoricitycomputable model theorydecidable structure

Mathematics Subject Classification ID

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

Related Items

A note on decidable categoricity and index sets ⋮ On decidable categoricity and almost prime models ⋮ Strong degrees of categoricity and weak density

Cites Work

• Unnamed Item
• 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
• Independence in computable algebra
• Some constructivizations of Abelian groups
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Effective categoricity of abelian \(p\)-groups
• Autostability of models and Abelian groups
• Strong and weak constructivization and computable families
• Model theory
• Computable structures and the hyperarithmetical hierarchy
• Combinatorial group theory.
• Computable torsion abelian groups
• Back and forth relations for reduced abelian \(p\)-groups
• A computability theoretic equivalent to Vaught's conjecture
• Degrees of categoricity and the hyperarithmetic hierarchy
• Degrees of autostability for linear orders and linearly ordered abelian groups
• Effectively categorical abelian groups
• Degrees of autostability relative to strong constructivizations
• Abelian groups without elements of finite order
• Degrees of categoricity of computable structures
• COMPUTABLE ABELIAN GROUPS
• Turing's Legacy
• Iterated effective embeddings of abelian p-groups
• Computable completely decomposable groups
• Ulm's Theorem for Partially Ordered Structures Related to Simply Presented Abelian p-Groups
• The decomposability problem for torsion-free abelian groups is analytic-complete
• Computable Algebra, General Theory and Theory of Computable Fields
• Elementary properties of Abelian groups