|
This article is cited in 4 scientific papers (total in 4 papers)
The Computable Dimension of $I$-Trees of Infinite Height
N. T. Kogabaeva, O. V. Kudinova, R. Millerb a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
b Cornell University
Abstract:
We study computable trees with distinguished initial subtree (briefly, $I$-trees). It is proved that all $I$-trees of infinite height are computably categorical, and moreover, they all have effectively infinite computable dimension.
Keywords:
computable tree with distinguished initial subtree, computable dimension, computably categorical model, branching model, effectively infinite computable dimension.
Received: 19.02.2003 Revised: 04.06.2004
Citation:
N. T. Kogabaev, O. V. Kudinov, R. Miller, “The Computable Dimension of $I$-Trees of Infinite Height”, Algebra Logika, 43:6 (2004), 702–729; Algebra and Logic, 43:6 (2004), 393–407
Linking options:
https://www.mathnet.ru/eng/al106 https://www.mathnet.ru/eng/al/v43/i6/p702
|
Statistics & downloads: |
Abstract page: | 344 | Full-text PDF : | 118 | References: | 57 | First page: | 1 |
|