Abelian p-groups and the halting problem

DOI10.1016/J.APAL.2016.04.016MaRDI QIDQ306578zbMATH OpenOpenAlexFDO

Authors Rodney G. Downey, Alexander Melnikov, Keng Meng Ng

Publication date 31 August 2016

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apal.2016.04.016

zbMATH Keywords

abelian groupscomputable categoricity

Mathematics Subject Classification ID

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

Recommendations

• Effective categoricity of abelian p-groups
• On the computability of a class of periodic abelian groups
• Back and forth relations for reduced abelian p-groups
• scientific article; zbMATH DE number 14727
• The isomorphism problem for computable Abelian _p-groups of bounded length

Cites work

• scientific article; zbMATH DE number 1002913 (Why is no real title available?)
• scientific article; zbMATH DE number 4109007 (Why is no real title available?)
• scientific article; zbMATH DE number 3767640 (Why is no real title available?)
• scientific article; zbMATH DE number 1303204 (Why is no real title available?)
• scientific article; zbMATH DE number 1936723 (Why is no real title available?)
• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• Autostability of models and Abelian groups
• Back and forth relations for reduced abelian p-groups
• CONSTRUCTIVE ALGEBRAS I
• Computable Algebra, General Theory and Theory of Computable Fields
• Computable completely decomposable groups
• Computable structures and the hyperarithmetical hierarchy
• Effective categoricity of abelian p-groups
• Effective categoricity of equivalence structures
• Effective procedures in field theory
• Effectively categorical abelian groups
• Effectively completely decomposable Abelian groups.
• On \(\Delta_2^0\)-categoricity of equivalence relations
• Problem of the number of non-self-equivalent constructivizations
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Subgroups of finitely presented groups
• \(\Delta^0_2\)-categoricity of equivalence structures
• \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings

Cited in

(14)

• Iterated effective embeddings of abelian \(p\)-groups
• Computability-theoretic categoricity and Scott families
• Categoricity spectra of computable structures
• Decompositions of decidable abelian groups
• Punctual categoricity relative to a computable oracle
• Enumerating abelian \(p\)-groups
• The P-DNP problem for infinite Abelian groups
• Effective categoricity of abelian p-groups
• Effective domination and the bounded jump
• Back and forth relations for reduced abelian p-groups
• A model-theoretic proof for P ≠ NP over all infinite abelian group
• On \(\Delta_2^0\)-categoricity of equivalence relations
• Effectively categorical abelian groups
• A Friedberg enumeration of equivalence structures

This page was built for publication: Abelian \(p\)-groups and the halting problem

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