|
This article is cited in 3 scientific papers (total 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.
Received: 04.01.1993
Citation:
S. A. Badaev, “On cardinality of semilattices of enumerations of nondiscrete families”, Sibirsk. Mat. Zh., 34:5 (1993), 3–10; Siberian Math. J., 34:5 (1993), 795–800
Linking options:
https://www.mathnet.ru/eng/smj827 https://www.mathnet.ru/eng/smj/v34/i5/p3
|
Statistics & downloads: |
Abstract page: | 172 | Full-text PDF : | 70 |
|