Computable abelian groups

DOI10.1017/BSL.2014.32MaRDI QIDQ2795203zbMATH OpenOpenAlexFDO

Authors Alexander 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)

Recommendations

• Computable topological abelian groups
• Computable ordered abelian groups and fields
• Computable torsion abelian groups
• The computable dimension of ordered abelian groups
• scientific article; zbMATH DE number 609987
• On the computability of a class of periodic abelian groups
• scientific article; zbMATH DE number 56705
• On the computational complexity of the theory of Abelian groups
• Computing with Abelian sections of finitely presented groups
• On some computational problems in finite abelian groups

Cites work

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

Cited in

(31)

• Computability of the class of strongly constructivizable Abelian \(p\)-groups
• Computability of the class of strongly constructivizable abelian \(p\)-groups
• Computable torsion abelian groups
• Punctual dimension of algebraic structures in certain classes
• Categoricity spectra of computable structures
• Computable topological abelian groups
• The computational complexity of module socles
• Punctual copies of algebraic structures
• Enumerating abelian \(p\)-groups
• A note on decidable categoricity and index sets
• Computer and Human Reasoning: Single Implicative Axioms for Groups and for Abelian Groups
• Torsion-free abelian groups with optimal Scott families
• Computable topological groups and Pontryagin duality
• Independence in computable algebra
• Decompositions of decidable abelian groups
• Algebraic structures computable without delay
• COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS
• Computability of Polish spaces up to homeomorphism
• Computable embeddability for algebraic structures
• Primitive recursive reverse mathematics
• The complexity of decomposability of computable rings
• Every \(\Delta^0_2\) Polish space is computable topological
• Computable presentations of C*-algebras
• Computably locally compact groups and their closed subgroups
• Computable formal contexts
• Remarks and problems about algorithmic descriptions of groups
• Computable topological groups
• Comparing notions of presentability in Polish spaces and Polish groups
• Weihrauch complexity for elementary embeddings into countable saturated models
• New degree spectra of Polish spaces
• Decidability and computability of certain torsion-free abelian groups

This page was built for publication: Computable abelian groups

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