Summary
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 uniformII 11 characteristics.
Similar content being viewed by others
References
[Bl] Blass, A.: Simple cardinal invariants. (preprint)
[v Do] van Douwen, E.K.: The integers and topology. In: Kunen, K., Vaughan, J.E. (eds.) Handbook of Set-Theoretic Topology. North-Holland: Amsterdam New York Oxford 1984
[CN] Comfort, W.W., Negrepontis, S.: Theory of ultrafilters. Berlin Heidelberg New York: Springer 1974
[Mi] Miller, A.: Some properties of measure and category. Trans. Am. Math. Soc.266, 93–114 (1981)
[Sh 470] Shelah, S.: Vive la difference! In: Judah, H., Just, W., Woodin, W.H. (eds.) Proceedings of the MSRI Logic Year 1989/90
[Sh 448a] Shelah, S.: Notes on many cardinal invariants. May 1991, (unpublished)
[Va] Vaughan, J.E.: Small uncountable cardinals and topology. In: van Mill, J., Reeds, G. (eds.) Open problems in topology, pp. 195–218. Amsterdam New York Oxford Tokyo: North-Holland 1990
Author information
Authors and Affiliations
Corresponding author
Additional information
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)
Rights and permissions
About this article
Cite this article
Goldstern, M., Shelah, S. Many simple cardinal invariants. Arch Math Logic 32, 203–221 (1993). https://doi.org/10.1007/BF01375552
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01375552