Notre Dame Journal of Formal Logic

Self-Embeddings of Computable Trees

Abstract

We divide the class of infinite computable trees into three types. For the first and second types, 0' computes a nontrivial self-embedding while for the third type 0'' computes a nontrivial self-embedding. These results are optimal and we obtain partial results concerning the complexity of nontrivial self-embeddings of infinite computable trees considered up to isomorphism. We show that every infinite computable tree must have either an infinite computable chain or an infinite Π01 antichain. This result is optimal and has connections to the program of reverse mathematics.

Article information

Source
Notre Dame J. Formal Logic, Volume 49, Number 1 (2008), 1-37.

Dates
First available in Project Euclid: 6 January 2008

https://projecteuclid.org/euclid.ndjfl/1199649898

Digital Object Identifier
doi:10.1215/00294527-2007-003

Mathematical Reviews number (MathSciNet)
MR2376778

Zentralblatt MATH identifier
1204.03044

Citation

Binns, Stephen; Kjos-Hanssen, Bjørn; Lerman, Manuel; Schmerl, James H.; Solomon, Reed. Self-Embeddings of Computable Trees. Notre Dame J. Formal Logic 49 (2008), no. 1, 1--37. doi:10.1215/00294527-2007-003. https://projecteuclid.org/euclid.ndjfl/1199649898

References

• [1] Cenzer, D., "$\pi^0_1$ classes in recursion theory", pp. 37--88 in Handbook of Computability Theory, edited by E. R. Griffor, vol. 140 of Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Co., Amsterdam, 1999.
• [2] Cenzer, D., and J. B. Remmel, "$\Pi\sp 0\sb 1$" classes in mathematics", pp. 623--821 in Handbook of Recursive Mathematics, Vol. 2, edited by Yu. L. Ershov, S. S. Goncharov, A. Nerode, and J. B. Remmel, vol. 139 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1998.
• [3] Corominas, E., "On better quasi-ordering countable trees", Discrete Mathematics, vol. 53 (1985), pp. 35--53. Special volume on ordered sets and their applications (L'Arbresle, 1982).
• [4] Downey, R. G., C. Jockusch, and J. S. Miller, "On self-embeddings of computable linear orderings", Annals of Pure and Applied Logic, vol. 138 (2006), pp. 52--76.
• [5] Downey, R. G., and S. Lempp, "The proof-theoretic strength of the Dushnik-Miller theorem for countable linear orders", pp. 55--57 in Recursion Theory and Complexity (Kazan, 1997), edited by M. Arslanov and S. Lempp, vol. 2 of de Gruyter Series in Logic and its Applications, Walter de Gruyter & Co, Berlin, 1999.
• [6] Dushnik, B., and E. W. Miller, "Concerning similarity transformations of linearly ordered sets", Bulletin of the American Mathematical Society, vol. 46 (1940), pp. 322--26.
• [7] Herrmann, E., "Infinite chains and antichains in computable partial orderings", The Journal of Symbolic Logic, vol. 66 (2001), pp. 923--34.
• [8] Jockusch, C. G., Jr., and R. I. Soare, "$\Pi \sp0\sb1$" classes and degrees of theories", Transactions of the American Mathematical Society, vol. 173 (1972), pp. 33--56.
• [9] Kruskal, J. B., "Well-quasi-ordering, the Tree Theorem, and Vazsonyi's conjecture", Transactions of the American Mathematical Society, vol. 95 (1960), pp. 210--25.
• [10] Lempp, S., C. McCoy, R. Miller, and R. Solomon, "Computable categoricity of trees of finite height", The Journal of Symbolic Logic, vol. 70 (2005), pp. 151--215.
• [11] Miller, R., "The computable dimension of trees of infinite height", The Journal of Symbolic Logic, vol. 70 (2005), pp. 111--41.
• [12] Richter, L. J., "Degrees of structures", The Journal of Symbolic Logic, vol. 46 (1981), pp. 723--31.
• [13] Ross, D., "Tree self-embeddings", Canadian Mathematical Bulletin, vol. 32 (1989), pp. 30--33.
• [14] Simpson, S. G., Subsystems of Second Order Arithmetic, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1999.
• [15] Soare, R. I., Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1987.