The pcf theorem (of the possible cofinability theory) was proved for reduced products ∏i < I (< I -eub) as well as cardinalities of reduced products and the cardinalsT D (λ).Finally we apply this to the problem of the depth of ultraproducts (and reduced products) of Boolean algebras.
CITATION STYLE
Shelah, S. (2013). The PCF theorem revisited. In The Mathematics of Paul Erdos II, Second Edition (pp. 441–488). Springer New York. https://doi.org/10.1007/978-1-4614-7254-4_26
Mendeley helps you to discover research relevant for your work.