Abelian \(p\)-groups and the halting problem
From MaRDI portal
Publication:306578
DOI10.1016/j.apal.2016.04.016zbMath1402.03067OpenAlexW2343502051MaRDI QIDQ306578
Keng Meng Ng, Rodney G. Downey, Alexander G. Melnikov
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
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Abelian groups (20K99)
Related Items (8)
Enumerating abelian \(p\)-groups ⋮ A Friedberg enumeration of equivalence structures ⋮ Computability-theoretic categoricity and Scott families ⋮ Punctual categoricity relative to a computable oracle ⋮ Categoricity spectra of computable structures ⋮ Decompositions of decidable abelian groups ⋮ Effective domination and the bounded jump ⋮ On \(\Delta_2^0\)-categoricity of equivalence relations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Effective categoricity of abelian \(p\)-groups
- Autostability of models and Abelian groups
- Problem of the number of non-self-equivalent constructivizations
- Computable structures and the hyperarithmetical hierarchy
- 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
- Computable completely decomposable groups
- Effective procedures in field theory
- Subgroups of finitely presented groups
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- CONSTRUCTIVE ALGEBRAS I
- Computable Algebra, General Theory and Theory of Computable Fields
This page was built for publication: Abelian \(p\)-groups and the halting problem
