Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4662188 | Annals of Pure and Applied Logic | 2009 | 11 Pages |
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 categorical and relatively categorical.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic