Title of article
Effective categoricity of Abelian -groups
Author/Authors
Calvert، نويسنده , , Wesley and Cenzer، نويسنده , , Douglas and Harizanov، نويسنده , , Valentina S. and Morozov، نويسنده , , Andrei، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
11
From page
187
To page
197
Abstract
We investigate effective categoricity of computable Abelian p -groups A . 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 Δ 2 0 categorical and relatively Δ 2 0 categorical.
Keywords
Scott family , Computable structures , Abelian p -groups , Computable categoricity , ? 2 0 categoricity , Relative categoricity
Journal title
Annals of Pure and Applied Logic
Serial Year
2009
Journal title
Annals of Pure and Applied Logic
Record number
1443999
Link To Document