, Volume 32, Issue 3, pp 203-221

Many simple cardinal invariants

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Summary

Forg 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 uniformII 1 1 characteristics.

Supported by Israeli Academy of Sciences, Basic Research Fund
Publication 448. Supported partially by Israeli Academy of Sciences, Basic Research Fund and by the Edmund Landau Center for research in Mathematical Analysis (supported by the Minerva Foundation, Germany)