Effective categoricity of Abelian p -groups

Annals of Pure and Applied Logic 159 (1-2):187-197 (2009)
  Copy   BIBTEX

Abstract

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Space complexity of Abelian groups.Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel & Zia Uddin - 2009 - Archive for Mathematical Logic 48 (1):115-140.
Relative categoricity in abelian groups II.Wilfrid Hodges & Anatoly Yakovlev - 2009 - Annals of Pure and Applied Logic 158 (3):203-231.
The model theory of finitely generated finite-by-Abelian groups.Francis Oger - 1984 - Journal of Symbolic Logic 49 (4):1115-1124.
Some model theory of Abelian groups.Paul C. Eklof - 1972 - Journal of Symbolic Logic 37 (2):335-342.
Axiomatization of abelian-by- G groups for a finite group G.Francis Oger - 2001 - Archive for Mathematical Logic 40 (7):515-521.
P-compatible Abelian groups.Krystyna Mruczek-Nasieniewska - 2005 - Logic and Logical Philosophy 14 (2):253-263.
Existential equivalence of ordered abelian groups with parameters.V. Weispfenning - 1990 - Archive for Mathematical Logic 29 (4):237-248.

Analytics

Added to PP
2013-12-22

Downloads
20 (#723,940)

6 months
4 (#698,851)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Valentina Harizanov
George Washington University

Citations of this work

Computable Abelian groups.Alexander G. Melnikov - 2014 - Bulletin of Symbolic Logic 20 (3):315-356,.
Abelian p-groups and the Halting problem.Rodney Downey, Alexander G. Melnikov & Keng Meng Ng - 2016 - Annals of Pure and Applied Logic 167 (11):1123-1138.
PAC learning, VC dimension, and the arithmetic hierarchy.Wesley Calvert - 2015 - Archive for Mathematical Logic 54 (7-8):871-883.

Add more citations

References found in this work

Generic copies of countable structures.Chris Ash, Julia Knight, Mark Manasse & Theodore Slaman - 1989 - Annals of Pure and Applied Logic 42 (3):195-205.
Computable Models of Theories with Few Models.Bakhadyr Khoussainov, Andre Nies & Richard A. Shore - 1997 - Notre Dame Journal of Formal Logic 38 (2):165-178.
Recursive isomorphism types of recursive Boolean algebras.J. B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):572-594.
Effective model theory vs. recursive model theory.John Chisholm - 1990 - Journal of Symbolic Logic 55 (3):1168-1191.

View all 15 references / Add more references