arXiv · math/9205208
Many simple cardinal invariants
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.
Explore related subjects
Keep this discovery
Martin Goldstern, Saharon Shelah. 1992-05-15. Many simple cardinal invariants. https://arxiv.org/abs/math/9205208
Cite the original work for its findings. Save a collection to share your selection of sources.