- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Effective categoricity of Abelian p -groups
Annals of Pure and Applied Logic 159 (1-2):187-197 (2009)
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 categoricalAuthor's Profile
DOI
10.1016/j.apal.2008.11.003
My notes
Similar books and articles
Effective categoricity of equivalence structures.Wesley Calvert, Douglas Cenzer, Valentina Harizanov & Andrei Morozov - 2006 - Annals of Pure and Applied Logic 141 (1):61-78.
Space complexity of Abelian groups.Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel & Zia Uddin - 2009 - Archive for Mathematical Logic 48 (1):115-140.
Equivalence structures and isomorphisms in the difference hierarchy.Douglas Cenzer, Geoffrey LaForte & Jeffrey Remmel - 2009 - Journal of Symbolic Logic 74 (2):535-556.
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.
Undecidable lt theories of topological Abelian groups.Gregory L. Cherlin & Peter H. Schmitt - 1981 - Journal of Symbolic Logic 46 (4):761 - 772.
A common abstraction of MV-Algebras and Abelian l-groups.Francesco Paoli - 2000 - Studia Logica 65 (3):355-366.
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.
Abelian‐by‐G Groups, for G Finite, from the Model Theoretic Point of View.Annalisa Marcja & Carlo Toffalori - 1994 - Mathematical Logic Quarterly 40 (1):125-131.
Decidability and Computability of Certain Torsion-Free Abelian Groups.Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov & Daniel Turetsky - 2010 - Notre Dame Journal of Formal Logic 51 (1):85-96.
Recursively presented Abelian groups: Effective p-group theory. I.Charlotte Lin - 1981 - Journal of Symbolic Logic 46 (3):617-624.
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
16 (#742,823)
6 months
1 (#868,485)
2013-12-22
Downloads
16 (#742,823)
6 months
1 (#868,485)
Historical graph of downloads
Author's Profile
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.
Computability-theoretic categoricity and Scott families.Ekaterina Fokina, Valentina Harizanov & Daniel Turetsky - 2019 - Annals of Pure and Applied Logic 170 (6):699-717.
PAC learning, VC dimension, and the arithmetic hierarchy.Wesley Calvert - 2015 - Archive for Mathematical Logic 54 (7-8):871-883.
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.
Effective categoricity of equivalence structures.Wesley Calvert, Douglas Cenzer, Valentina Harizanov & Andrei Morozov - 2006 - Annals of Pure and Applied Logic 141 (1):61-78.
Effective model theory vs. recursive model theory.John Chisholm - 1990 - Journal of Symbolic Logic 55 (3):1168-1191.
Recursive isomorphism types of recursive Boolean algebras.J. B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):572-594.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6b7fd944d-lrjzp N