N. T. Kogabaev, O. V. Kudinov, R. Miller, “The Computable Dimension of <nobr>$I$</nobr>-Trees of Infinite Height”, Algebra Logika, 2004, Volume 43, Number 6,Pages <nobr>702

This article is cited in 4 papers

The Computable Dimension of $I$-Trees of Infinite Height

N. T. Kogabaev^a, O. V. Kudinov^a, R. Miller^b

^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.

UDC: 510.53+512.562

Received: 19.02.2003
Revised: 04.06.2004