Many simple cardinal invariants
From MaRDI portal
Abstract: For g < f in omega^omega we define c(f,g) be the least number of uniform trees with g-splitting needed to cover a uniform tree with f-splitting. We show that we can simultaneously force aleph_1 many different values for different functions (f,g). In the language of Blass: There may be aleph_1 many distinct uniform Pi^0_1 characteristics.
Recommendations
Cites work
Cited in
(21)- Convexity numbers of closed sets in ℝⁿ
- Some Cardinal Equivalences with Explicit Formulas
- Convex decompositions in the plane and continuous pair colorings of the irrationals
- Generic constructions of small sets of reals
- Many different uniformity numbers of Yorioka ideals
- Cichoń's diagram and localisation cardinals
- Many different covering numbers of Yorioka's ideals
- Logical dreams
- Comparing the uniformity invariants of null sets for different measures
- Decisive creatures and large continuum
- Controlling cardinal characteristics without adding reals
- Cofinalities of Borel ideals
- CONTINUOUS RAMSEY THEORY ON POLISH SPACES AND COVERING THE PLANE BY FUNCTIONS
- Non-trivial automorphisms of \({\mathcal {P}}({\mathbb {N}})/[{\mathbb {N}}]^{<\aleph _0}\) from variants of small dominating number
- Creature forcing and large continuum: the joy of halving
- On cardinal characteristics of Yorioka ideals
- The covering number of the strong measure zero ideal can be above almost everything else
- Even more simple cardinal invariants
- On \(\mathrm{CON}(\mathfrak{d}_\lambda > \mathrm{cov}_\lambda(\mathrm{meagre}))\)
- Covering numbers associated with trees branching into a countably generated set of possibilities
- The Keisler-Shelah isomorphism theorem and the continuum hypothesis. II
This page was built for publication: Many simple cardinal invariants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688855)