Abstract
We give some sufficient conditions for {a ⊆ אω: cf(sup(a∩אn)) = f(n) for n < ω} to be stationary. Thus we get consistency e.g. of cases where f has ≥ three values attained infinitely often. We use pcf, partition theorems on trees and games.
| Original language | English |
|---|---|
| Pages (from-to) | 189-205 |
| Number of pages | 17 |
| Journal | Israel Journal of Mathematics |
| Volume | 99 |
| DOIs | |
| State | Published - 1997 |