Computable categoricity of trees of finite height
Steffen Lempp, Charles McCoy, Russell Miller, and Reed Solomon
Source: J. Symbolic Logic Volume 70, Issue 1 (2005), 151-215.
Abstract
We characterize the structure of computably categorical trees of finite height, and prove that our criterion is both necessary and sufficient. Intuitively, the characterization is easiest to express in terms of isomorphisms of (possibly infinite) trees, but in fact it is equivalent to a Σ03-condition. We show that all trees which are not computably categorical have computable dimension ω. Finally, we prove that for every n≥ 1 in ω, there exists a computable tree of finite height which is δ0n+1-categorical but not δ0n-categorical.
Full-text: Access denied (no subscription detected)
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.jsl/1107298515
Digital Object Identifier: doi:10.2178/jsl/1107298515
Mathematical Reviews number (MathSciNet):
MR2119128
Zentralblatt MATH identifier:
05004793
References
C. J. Ash Categoricity in hyperarithmetical degrees, Annals of Pure and Applied Logic, vol. 34 (1987), pp. 1--14.
Mathematical Reviews (MathSciNet):
MR887551
Digital Object Identifier: doi:10.1016/0168-0072(87)90038-8
C. J. Ash and J. F. Knight Computable structures and the hyperarithmetic hierarchy, Elsivier Science, Amsterdam ,2000.
Mathematical Reviews (MathSciNet):
MR1767842
Zentralblatt MATH:
0960.03001
C. J. Ash, J. F. Knight, M. Mannasse, and T. Slaman Generic copies of countable structures, Annals of Pure and Applied Logic, vol. 42 (1989), pp. 195--205.
Mathematical Reviews (MathSciNet):
MR998606
Digital Object Identifier: doi:10.1016/0168-0072(89)90015-8
J. Chisholm On intrisically $1$-computable trees, unpublished manuscript.
J. N. Crossley, A. B. Manaster, and M. F. Moses Recursive categoricity and recursive stability, Annals of Pure and Applied Logic, vol. 31 (1986), pp. 191--204.
Mathematical Reviews (MathSciNet):
MR854293
Digital Object Identifier: doi:10.1016/0168-0072(86)90070-9
R. G. Downey On presentations of algebraic structures, Complexity, logic, and recursion theory (A. Sorbi, editor), Dekker, New York ,1997, pp. 157--205.
Mathematical Reviews (MathSciNet):
MR1455136
Zentralblatt MATH:
0915.03039
R. G. Downey and C. G. Jockusch Every low Boolean algebra is isomorphic to a recursive one, Proceedings of the American Mathematical Society, vol. 122 (1994), pp. 871--880.
Mathematical Reviews (MathSciNet):
MR1203984
S. S. Goncharov Autostability and computable families of constructivizations, Algebra and Logic, vol. 14 (1975), pp. 647--680 (Russian), 392--409 (English translation).
Mathematical Reviews (MathSciNet):
MR437335
S. S. Goncharov and V. D. Dzgoev Autostability of models, Algebra and Logic, vol. 19 (1980), pp. 45--58 (Russian), 28--37 (English translation).
Mathematical Reviews (MathSciNet):
MR604657
S. S. Goncharov, S. Lempp, and R. Solomon The computable dimension of ordered abelian groups, Advances in Mathematics, vol. 175 (2003), pp. 102--143.
Mathematical Reviews (MathSciNet):
MR1970243
Digital Object Identifier: doi:10.1016/S0001-8708(02)00042-7
S. S. Goncharov, A. V. Molokov, and N. S. Romanovskii Nilpotent groups of finite algorithmic dimension, Siberian Mathematics Journal, vol. 30 (1989), pp. 63--68.
Mathematical Reviews (MathSciNet):
MR995021
D. R. Hirschfeldt, B. Khoussainov, R. A. Shore, and A. M. Slinko Degree spectra and computable dimension in algebraic structures, Annals of Pure and Applied Logic, vol. 115 (2002), pp. 71--113.
Mathematical Reviews (MathSciNet):
MR1897023
Digital Object Identifier: doi:10.1016/S0168-0072(01)00087-2
B. Khoussainov and R. A. Shore Computable isomorphisms, degree spectra of relations, and Scott families, Annals of Pure and Applied Logic, vol. 93 (1998), pp. 153--193.
Mathematical Reviews (MathSciNet):
MR1635605
Digital Object Identifier: doi:10.1016/S0168-0072(97)00059-6
J. B. Kruskal Well quasi-ordering, the tree theorem, and Vázsonyi's conjecture, Transactions of the American Mathematical Society, vol. 95 (1960), pp. 210--225.
Mathematical Reviews (MathSciNet):
MR111704
O. V. Kudinov An integral domain with finite algorithmic dimension, unpublished manuscript.
P. LaRoche Recursively presented Boolean algebras, Notices of the American Mathematical Society, vol. 24 (1977), pp. A--552, research announcement.
G. Metakides and A. Nerode Effective content of field theory, Annals of Mathematical Logic, vol. 17 (1979), pp. 289--320.
Mathematical Reviews (MathSciNet):
MR556895
Digital Object Identifier: doi:10.1016/0003-4843(79)90011-1
R. G. Miller The $\Delta^0_2$ spectrum of a linear order, Journal of Symbolic Logic, vol. 66 (2001), pp. 470--486.
Mathematical Reviews (MathSciNet):
MR1833459
C. St. J. A. Nash-Williams On well-quasi-ordering finite trees, Proceedings of the Cambridge Philosophical Society, vol. 59 (1963), pp. 833--835.
Mathematical Reviews (MathSciNet):
MR153601
A. T. Nurtazin Strong and weak constructivizations and enumerable families, Algebra and Logic, vol. 13 (1974), pp. 177--184.
Mathematical Reviews (MathSciNet):
MR381962
J. B. Remmel Recursive isomorphism types of recursive Boolean algebras, Journal of Symbolic Logic, vol. 46 (1981), pp. 572--594.
Mathematical Reviews (MathSciNet):
MR627907
JSTOR: links.jstor.org
S. G. Simpson Nonprovability of certain combinatorial properties of finite trees, Harvey Friedman's research on the foundations of mathematics (L. A. Harrington, M. D. Morley, A. Scedrov, and S. G. Simpson, editors), North-Holland, Amsterdam ,1985, pp. 87--117.
Mathematical Reviews (MathSciNet):
MR835255
T. A. Slaman Relative to any nonrecursive set, Proceedings of the American Mathematical Society, vol. 126 (1998), pp. 2117--2122.
Mathematical Reviews (MathSciNet):
MR1443408
Digital Object Identifier: doi:10.1090/S0002-9939-98-04307-X
R. I. Soare Recursively enumerable sets and degrees, Springer-Verlag, New York ,1987.
Mathematical Reviews (MathSciNet):
MR882921
S. Wehner Enumerations, countable structures, and Turing degrees, Proceedings of the American Mathematical Society, vol. 126 (1998), pp. 2131--2139.
Mathematical Reviews (MathSciNet):
MR1443415
Digital Object Identifier: doi:10.1090/S0002-9939-98-04314-7
W. White On the complexity of categoricity in computable structures, Mathematical Logic Quarterly, vol. 49 (2003), no. 6, pp. 603--614.
Mathematical Reviews (MathSciNet):
MR2013721
Digital Object Identifier: doi:10.1002/malq.200310066
