Many simple cardinal invariants

Details Many simple cardinal invariants Many simple cardinal invariants

1992-05-15

arxiv.org/abs/math/9205208v1

Arch. Math. Logic 32 (1993), 203--221

Mathematics

Logic

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Many simple cardinal invariants does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Many simple cardinal invariants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Many simple cardinal invariants will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-674471