RUS  ENG
Full version
JOURNALS // Sibirskii Matematicheskii Zhurnal // Archive
Sibirsk. Mat. Zh., 1993 Volume 34, Number 5, Pages 3–10 (Mi smj827)
This article is cited in 3 papers

On cardinality of semilattices of enumerations of nondiscrete families

S. A. Badaev


Abstract: Simple stuctural conditions are obtained which are sufficient for a semilattice of computable enumerations of families containing pairs of nested recursively enumerable sets to be infinite.

UDC: 510.51

Received: 04.01.1993


 English version: Siberian Mathematical Journal, 1993, 34:5, 795–800

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024