Many simple cardinal invariants
Abstract
For g < f in omegaomega 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 aleph1 many different values for different functions (f,g). In the language of Blass: There may be aleph1 many distinct uniform Pi01 characteristics.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.