arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/9205208math.LO
收藏

Many simple cardinal invariants

Martin Goldstern, Saharon Shelah

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑