Classes of Ulm type and coding rank-homogeneous trees in other structures

Journal of Symbolic Logic 76 (3):846 - 869 (2011)
  Copy   BIBTEX


The first main result isolates some conditions which fail for the class of graphs and hold for the class of Abelian p-groups, the class of Abelian torsion groups, and the special class of "rank-homogeneous" trees. We consider these conditions as a possible definition of what it means for a class of structures to have "Ulm type". The result says that there can be no Turing computable embedding of a class not of Ulm type into one of Ulm type. We apply this result to show that there is no Turing computable embedding of the class of graphs into the class of "rank-homogeneous" trees. The second main result says that there is a Turing computable embedding of the class of rank-homogeneous trees into the class of torsion-free Abelian groups. The third main result says that there is a "rank-preserving" Turing computable embedding of the class of rank-homogeneous trees into the class of Boolean algebras. Using this result, we show that there is a computable Boolean algebra of Scott rank ${\mathrm{\omega }}_{1}^{\mathrm{C}\mathrm{K}}$



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

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

Canonical bases in excellent classes.Tapani Hyttinen & Olivier Lessmann - 2008 - Journal of Symbolic Logic 73 (1):165-180.
Computable Embeddings and Strongly Minimal Theories.J. Chisholm, J. F. Knight & S. Miller - 2007 - Journal of Symbolic Logic 72 (3):1031 - 1040.
How Bad Is Rape?H. E. Baber - 1987 - Hypatia 2 (2):125-138.
The Contemporary Significance of Confucianism.Tang Yijie & Yan Xin - 2008 - Frontiers of Philosophy in China 3 (4):477-501.
The Hiddenness Argument Revisited.J. L. Schellenberg - 2005 - Religious Studies 41 (3):287-303.
Analytic cut trees.Carlo Cellucci - 2000 - Logic Journal of the IGPL 8 (6):733-750.


Added to PP

59 (#261,735)

6 months
6 (#431,022)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Alexander Melnikov
National Research University Higher School of Economics

Citations of this work

Computable Abelian groups.Alexander G. Melnikov - 2014 - Bulletin of Symbolic Logic 20 (3):315-356,.
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.
New Degree Spectra of Abelian Groups.Alexander G. Melnikov - 2017 - Notre Dame Journal of Formal Logic 58 (4):507-525.
Strange Structures from Computable Model Theory.Howard Becker - 2017 - Notre Dame Journal of Formal Logic 58 (1):97-105.
Torsion-free abelian groups with optimal Scott families.Alexander G. Melnikov - 2018 - Journal of Mathematical Logic 18 (1):1850002.

View all 6 citations / Add more citations

References found in this work

Computable structures of rank.J. F. Knight & J. Millar - 2010 - Journal of Mathematical Logic 10 (1):31-43.
Model Theory: An Introduction.David Marker - 2003 - Bulletin of Symbolic Logic 9 (3):408-409.
Scott sentences and admissible sets.Mark Nadel - 1974 - Annals of Mathematical Logic 7 (2):267.

View all 8 references / Add more references