On cardinality of semilattices of enumerations of nondiscrete families (Q1335928)

The author proves the following theorem: Let a family \(\mathcal A\) of r.e. sets contain a pair of sets \(A \subset B\). Then the semilattice \(L({\mathcal A})\) of enumerations of \(\mathcal A\) is infinite if there exists a recursive set \(R\) such that \(A \subseteq R \subseteq B\). Two corollaries are also given.