On cardinality of semilattices of enumerations of nondiscrete families (Q1335928): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:31, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On cardinality of semilattices of enumerations of nondiscrete families |
scientific article |
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
