On cardinality of semilattices of enumerations of nondiscrete families (Q1335928)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 652192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On cardinality of semilattices of enumerations of nondiscrete families |
scientific article; zbMATH DE number 652192 |
Statements
On cardinality of semilattices of enumerations of nondiscrete families (English)
0 references
8 November 1994
0 references
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.
0 references
semilattices of enumerations
0 references
infinity
0 references
0.7846679091453552
0 references
