Decompositions of decidable abelian groups

DOI10.1142/S0218196719500644MaRDI QIDQ5216188zbMATH OpenOpenAlexWikidataFDO

Authors Alexander Melnikov, Nikolay Bazhenov, S. 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 groupcomputable categoricitycomputable model theorydecidable structuredegree of categoricity

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) Torsion-free groups, finite rank (20K15)

Recommendations

• Decidability and computability of certain torsion-free abelian groups
• Computable completely decomposable groups
• Effectively categorical abelian groups
• The decomposability problem for torsion-free abelian groups is analytic-complete
• On the computational complexity of the theory of Abelian groups

Cites work

• A computability theoretic equivalent to Vaught's conjecture
• Abelian p-groups and the halting problem
• Abelian groups without elements of finite order
• Autostability of models and Abelian groups
• Back and forth relations for reduced abelian p-groups
• Combinatorial group theory.
• Computable abelian groups
• Computable Algebra, General Theory and Theory of Computable Fields
• Computable completely decomposable groups
• Computable structures and the hyperarithmetical hierarchy
• Computable torsion abelian groups
• Degrees of autostability for linear orders and linearly ordered abelian groups
• Degrees of autostability relative to strong constructivizations
• Degrees of categoricity and the hyperarithmetic hierarchy
• Degrees of categoricity of computable structures
• Effective categoricity of abelian p-groups
• Effectively categorical abelian groups
• Elementary properties of Abelian groups
• scientific article; zbMATH DE number 3153997 (Why is no real title available?)
• scientific article; zbMATH DE number 3767640 (Why is no real title available?)
• scientific article; zbMATH DE number 3779289 (Why is no real title available?)
• scientific article; zbMATH DE number 1303204 (Why is no real title available?)
• scientific article; zbMATH DE number 2047478 (Why is no real title available?)
• scientific article; zbMATH DE number 890268 (Why is no real title available?)
• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• scientific article; zbMATH DE number 3214535 (Why is no real title available?)
• scientific article; zbMATH DE number 3250559 (Why is no real title available?)
• scientific article; zbMATH DE number 3406215 (Why is no real title available?)
• Independence in computable algebra
• Iterated effective embeddings of abelian p-groups
• Model theory
• Some constructivizations of Abelian groups
• Strong and weak constructivization and computable families
• The decomposability problem for torsion-free abelian groups is analytic-complete
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Turing's legacy. Developments from Turing's ideas in logic
• Ulm's Theorem for Partially Ordered Structures Related to Simply Presented Abelian p-Groups

Cited in

(14)

• Space complexity of abelian groups
• On the computational complexity of the theory of Abelian groups
• Effectively completely decomposable Abelian groups.
• Decomposability and computability
• A note on decidable categoricity and index sets
• On decidable categoricity and almost prime models
• Strong degrees of categoricity and weak density
• Effectively categorical abelian groups
• scientific article; zbMATH DE number 5908541 (Why is no real title available?)
• Computable completely decomposable groups
• scientific article; zbMATH DE number 1163947 (Why is no real title available?)
• Algorithms in direct decompositions of torsion-free abelian groups
• Intruder deduction for the equational theory of abelian groups with distributive encryption
• Decidability and computability of certain torsion-free abelian groups

This page was built for publication: Decompositions of decidable abelian groups

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