Abelian p-groups and the halting problem

DOI10.1016/J.APAL.2016.04.016zbMATH Open1402.03067OpenAlexW2343502051MaRDI QIDQ306578FDOQ306578

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

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

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)

Cites Work

• Title not available (Why is that?)
• Autostability of models and Abelian groups
• Computable structures and the hyperarithmetical hierarchy
• Subgroups of finitely presented groups
• CONSTRUCTIVE ALGEBRAS I
• Effective categoricity of abelian \(p\)-groups
• Problem of the number of non-self-equivalent constructivizations
• Effectively completely decomposable Abelian groups.
• \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
• Back and forth relations for reduced abelian \(p\)-groups
• On \(\Delta_2^0\)-categoricity of equivalence relations
• Effectively categorical abelian groups
• Effective categoricity of equivalence structures
• \(\Delta^0_2\)-categoricity of equivalence structures
• Title not available (Why is that?)
• Computable completely decomposable groups
• 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?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computable Algebra, General Theory and Theory of Computable Fields

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)