Switch to: Citations

References in:

Abelian p-groups and the Halting problem

Rodney Downey, Alexander G. Melnikov & Keng Meng Ng

Annals of Pure and Applied Logic 167 (11):1123-1138 (2016)

Add references

You must login to add references.

Effective categoricity of equivalence structures.Wesley Calvert, Douglas Cenzer, Valentina Harizanov & Andrei Morozov - 2006 - Annals of Pure and Applied Logic 141 (1):61-78.details We investigate effective categoricity of computable equivalence structures . We show that is computably categorical if and only if has only finitely many finite equivalence classes, or has only finitely many infinite classes, bounded character, and at most one finite k such that there are infinitely many classes of size k. We also prove that all computably categorical structures are relatively computably categorical, that is, have computably enumerable Scott families of existential formulas. Since all computable equivalence structures are relatively categorical, (...) Download Export citation Bookmark 22 citations
Δ20-categoricity in Boolean algebras and linear orderings.Charles F. D. McCoy - 2003 - Annals of Pure and Applied Logic 119 (1-3):85-120.details We characterize Δ20-categoricity in Boolean algebras and linear orderings under some extra effectiveness conditions. We begin with a study of the relativized notion in these structures. Download Export citation Bookmark 12 citations
Back and forth relations for reduced abelian p-groups.Ewan J. Barker - 1995 - Annals of Pure and Applied Logic 75 (3):223-249.details In order to apply known general theorems about the effective properties of recursive structures in a particular recursive structure, it is necessary to verify that certain decidability conditions are satisfied. This requires the determination of when certain relations, called back and forth relations, hold between finite strings of elements from the structure. Here we determine this for recursive reduced abelian p-groups, thus enabling us to apply these theorems. Download Export citation Bookmark 8 citations
On Δ 2 0 -categoricity of equivalence relations.Rod Downey, Alexander G. Melnikov & Keng Meng Ng - 2015 - Annals of Pure and Applied Logic 166 (9):851-880.details Download Export citation Bookmark 4 citations
Effective categoricity of Abelian p -groups.Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov & Andrei Morozov - 2009 - Annals of Pure and Applied Logic 159 (1-2):187-197.details We investigate effective categoricity of computable Abelian p-groups . We prove that all computably categorical Abelian p-groups are relatively computably categorical, that is, have computably enumerable Scott families of existential formulas. We investigate which computable Abelian p-groups are categorical and relatively categorical. Download Export citation Bookmark 4 citations

1