Effectively categorical abelian groups
DOI10.1016/J.JALGEBRA.2012.09.020zbMATH Open1315.03054OpenAlexW2051202241MaRDI QIDQ2377433FDOQ2377433
Authors: Alexander 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
Recommendations
free abelian groupscomputable model theoryeffective categoricitycomputable abelian groupscomputable free modules
Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57) Torsion-free groups, infinite rank (20K20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Autostability of models and Abelian groups
- Computable structures and the hyperarithmetical hierarchy
- Subgroups of finitely presented groups
- Recursively Categorical Linear Orderings
- Recursively enumerable vector spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computable models of theories with few models
- Limitwise monotonic sequences and degree spectra of structures
- LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
- CONSTRUCTIVE ALGEBRAS I
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- Back and forth relations for reduced abelian \(p\)-groups
- Degrees of categoricity of computable structures
- Effective procedures in field theory
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computable Algebra, General Theory and Theory of Computable Fields
- ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
- Bounding prime models
- Title not available (Why is that?)
- Enumerations and completely decomposable torsion-free abelian groups
- Decidability and computability of certain torsion-free abelian groups
- Describing free groups
- Describing free groups. II: \(\Pi ^{0}_{4}\) hardness and no \(\Sigma _{2}^{0}\) basis
- Title not available (Why is that?)
- The isomorphism problem for torsion-free abelian groups is analytic complete
- Jump degrees of torsion-free abelian groups
- Title not available (Why is that?)
- Order-computable sets
- Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
- Computational complexity, speedable and levelable sets
- Computable ordered abelian groups and fields
- \(\mathbf 0\)-categorical completely decomposable torsion-free abelian groups
Cited In (25)
- Computable completely decomposable groups
- Enumerating classes of effective quasi-Polish spaces
- Iterated effective embeddings of abelian \(p\)-groups
- Computability-theoretic categoricity and Scott families
- Title not available (Why is that?)
- Whitehead's problem and reverse mathematics
- \(\mathbf 0\)-categorical completely decomposable torsion-free abelian groups
- Categoricity spectra of computable structures
- Decompositions of decidable abelian groups
- Computable abelian groups
- Computable torsion abelian groups
- Abelian \(p\)-groups and the halting problem
- Effective categoricity of abelian \(p\)-groups
- On a question of Kalimullin
- ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
- Effectively completely decomposable Abelian groups.
- Back and forth relations for reduced abelian \(p\)-groups
- Torsion-free abelian groups with optimal Scott families
- On \(\Delta_2^0\)-categoricity of equivalence relations
- The decomposability problem for torsion-free abelian groups is analytic-complete
- Finding bases of uncountable free abelian groups is usually difficult
- The complexity of module radicals
- Degrees of orders on torsion-free abelian groups
- A Friedberg enumeration of equivalence structures
- ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
This page was built for publication: Effectively categorical abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377433)