Using partitions to characterize the minimum cardinality of an unbounded family in \(^{\omega}\omega\) (Q749538)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Using partitions to characterize the minimum cardinality of an unbounded family in \(^{\omega}\omega\) |
scientific article; zbMATH DE number 4172980
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using partitions to characterize the minimum cardinality of an unbounded family in \(^{\omega}\omega\) |
scientific article; zbMATH DE number 4172980 |
Statements
Using partitions to characterize the minimum cardinality of an unbounded family in \(^{\omega}\omega\) (English)
0 references
1990
0 references
Let b be the minimum cardinality of an unbounded family in \(\omega_{\omega}\) partially ordered by \(\leq^*\), where \(f\leq^*g\) if f(n)\(\leq g(n)\) for all but a finite n. The author generalizes \(\leq^*\) to \(\nu_{\omega}\) for each infinite cardinal \(\nu\) and proves that \(b>\nu\) iff every sequence in \(\nu_{\omega}\) has a \(\leq^*\)-upper bound. It is also shown that the existence of an upper bound depends only on the partition of \(\nu\) induced by the point-inverse sets of the individual functions.
0 references
minimum cardinality
0 references
partition
0 references
0.8030277490615845
0 references
0.7524053454399109
0 references
0.7433729767799377
0 references
0.7372305393218994
0 references