The pcf-theorem revisited

Details The pcf-theorem revisited The pcf-theorem revisited

1995-02-15

arxiv.org/abs/math/9502233v1

Algorithms Combin. 14 (1997), 420-459

Mathematics

Logic

Scientific paper

The pcf theorem (of the possible cofinality theory) was proved for reduced products prod_{i< kappa} lambda_i/I, where kappa < min_{i< kappa} lambda_i. Here we prove this theorem under weaker assumptions such as wsat(I)< min_{i< kappa} lambda_i, where wsat(I) is the minimal theta such that kappa cannot be delivered to theta sets notin I (or even slightly weaker condition). We also look at the existence of exact upper bounds relative to <_I (<_I-eub) as well as cardinalities of reduced products and the cardinals T_D(lambda). Finally we apply this to the problem of the depth of ultraproducts (and reduced products) of Boolean algebras

Affiliated with

Also associated with

No associations

Rating

The pcf-theorem revisited 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 The pcf-theorem revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The pcf-theorem revisited will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-343418