COMPUTABLE ABELIAN GROUPS

DOI10.1017/bsl.2014.32zbMath1345.03065OpenAlexW2123895074MaRDI QIDQ2795203

Alexander G. Melnikov

Publication date: 18 March 2016

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/bsl.2014.32

zbMATH Keywords

abelian groupscomputability theorydecidable word problem

Mathematics Subject Classification ID

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

Related Items

The computational complexity of module socles ⋮ New degree spectra of Polish spaces ⋮ Torsion-free abelian groups with optimal Scott families ⋮ Punctual copies of algebraic structures ⋮ Primitive recursive reverse mathematics ⋮ Computable torsion abelian groups ⋮ The complexity of decomposability of computable rings ⋮ Enumerating abelian \(p\)-groups ⋮ A note on decidable categoricity and index sets ⋮ Independence in computable algebra ⋮ Algebraic structures computable without delay ⋮ Punctual dimension of algebraic structures in certain classes ⋮ Computable topological groups and Pontryagin duality ⋮ Categoricity spectra of computable structures ⋮ Decompositions of decidable abelian groups ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM ⋮ Computable topological abelian groups ⋮ Computable embeddability for algebraic structures

Cites Work

• Degrees of orders on torsion-free abelian groups
• The complexity of central series in nilpotent computable groups
• Enumerations and completely decomposable torsion-free abelian groups
• Some constructivizations of Abelian groups
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Decidability and computability of certain torsion-free abelian groups
• Effective categoricity of abelian \(p\)-groups
• Nonconstructivizability of the reduced part of a strongly constructive torsion-free Abelian group
• Recursion theory and ordered groups
• On the integral homology of finitely presented groups
• Computable models of theories with few models
• Computable structures and the hyperarithmetical hierarchy
• A jump inversion theorem for the enumeration jump
• Degree spectra and computable dimensions in algebraic structures
• The computable dimension of ordered abelian groups
• Back and forth relations for reduced abelian \(p\)-groups
• Effectively categorical abelian groups
• Subspaces of computable vector spaces
• Abelian groups without elements of finite order
• Limitwise monotonic sequences and degree spectra of structures
• Spectra of highn and non-lown degrees
• The additive group of the rationals does not have an automatic presentation
• Every Set has a Least Jump Enumeration
• Algorithmic Randomness and Complexity
• Classes of Ulm type and coding rank-homogeneous trees in other structures
• Computable completely decomposable groups
• Effective procedures in field theory
• Subgroups of finitely presented groups
• The isomorphism problem for computable Abelian _p-groups of bounded length
• Effective content of field theory
• Recursively presented Abelian groups: Effective p-Group theory. I
• Recursively enumerable vector spaces
• Controlling the dependence degree of a recursively enumerable vector space
• The computational complexity of torsion-freeness of finitely presented groups
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees
• Degrees of Structures
• The classification problem for torsion-free abelian groups of finite rank
• The isomorphism relation on countable torsion free abelian groups
• Jump degrees of torsion-free abelian groups
• Turing degrees of isomorphism types of algebraic objects
• Isomorphism relations on computable structures
• Computable trees of Scott rank ω₁^CK, and computable approximation
• η-representation of sets and degrees
• Countable vector spaces with recursive operations Part I¹
• Countable vector spaces with recursive operations Part II
• The word problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item