Many simple cardinal invariants
- Cite this article as:
- Goldstern, M. & Shelah, S. Arch Math Logic (1993) 32: 203. doi:10.1007/BF01375552
Forg<f in ωω we definec(f,g) be the least number of uniform trees withg-splitting needed to cover a uniform tree withf-splitting. We show that we can simultaneously force ℵ1 many different values for different functions (f,g). In the language of [B1]: There may be ℵ1 many distinct uniformII11 characteristics.