Effectively categorical abelian groups

DOI10.1016/j.jalgebra.2012.09.020zbMath1315.03054MaRDI QIDQ2377433

Alexander G. Melnikov, Rodney G. Downey

Publication date: 2 July 2013

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgebra.2012.09.020

zbMATH Keywords

free abelian groups; computable model theory; effective categoricity; computable abelian groups; computable free modules

Mathematics Subject Classification ID

20K20: Torsion-free groups, infinite rank

03C57: Computable structure theory, computable model theory

03C35: Categoricity and completeness of theories

Related Items

On a question of Kalimullin, Torsion-free abelian groups with optimal Scott families, A Friedberg enumeration of equivalence structures, Finding bases of uncountable free abelian groups is usually difficult, Decompositions of decidable abelian groups, The decomposability problem for torsion-free abelian groups is analytic-complete, ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS, ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES, Abelian \(p\)-groups and the halting problem, Degrees of orders on torsion-free abelian groups, Whitehead's problem and reverse mathematics, Computable torsion abelian groups, Computability-theoretic categoricity and Scott families, The complexity of module radicals, Categoricity spectra of computable structures, Enumerating classes of effective quasi-Polish spaces, On \(\Delta_2^0\)-categoricity of equivalence relations, COMPUTABLE ABELIAN GROUPS, Iterated effective embeddings of abelian p-groups, Computable completely decomposable groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Autostability of models and Abelian groups
• Computable models of theories with few models
• Computable structures and the hyperarithmetical hierarchy
• \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
• Back and forth relations for reduced abelian \(p\)-groups
• Order-computable sets
• Degrees of categoricity of computable structures
• Describing free groups
• Describing free groups, Part II: Π⁰₄ hardness and no Σ₂⁰ basis
• Limitwise monotonic sequences and degree spectra of structures
• Effective procedures in field theory
• Subgroups of finitely presented groups
• Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
• 0″-Categorical Completely Decomposable Torsion-Free Abelian Groups
• Computable Ordered Abelian Groups and Fields
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Recursively Categorical Linear Orderings
• Recursively enumerable vector spaces
• Computational complexity, speedable and levelable sets
• Jump degrees of torsion-free abelian groups
• LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
• Bounding prime models
• CONSTRUCTIVE ALGEBRAS I
• ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
• Computable Algebra, General Theory and Theory of Computable Fields