|
This article is cited in 1 scientific paper (total in 1 paper)
On recursively enumerable minimal btt-degrees
S. S. Marchenkov
Abstract:
It is proved that in the upper semilattice of recursively enumerable btt-degrees, every upper bound of the set of minimal elements coincides with the unit of the semilattice. In any recursively enumerable nonrecursive w-degree there exist sets having minimal m- and btt-degrees.
Bibliography: 8 titles.
Received: 06.07.1976
Citation:
S. S. Marchenkov, “On recursively enumerable minimal btt-degrees”, Math. USSR-Sb., 32:4 (1977), 477–487
Linking options:
https://www.mathnet.ru/eng/sm2927https://doi.org/10.1070/SM1977v032n04ABEH002400 https://www.mathnet.ru/eng/sm/v145/i4/p550
|
|