This article is cited 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.

UDC: 517.11

MSC: Primary 02F30, 02F25, 06A20; Secondary 02F40, 02F99

Received: 06.07.1976

 English version: Mathematics of the USSR-Sbornik, 1977, 32:4, 477–487

Bibliographic databases:

• 
• 
•