Sh:589

• Shelah, S. (2000). Applications of PCF theory. J. Symbolic Logic, 65(4), 1624–1674. arXiv: math/9804155 DOI: 10.2307/2695067 MR: 1812172
• Abstract:
  We deal with several pcf problems; we characterize another version of exponentiation: number of \kappa-branches in a tree with \lambda nodes, deal with existence of independent sets in stable theories, possible cardinality of ultraproduct, the depth of ultraproducts of Boolean Algebras. Also we give cardinal invariant for each \lambda with pcf restriction and investigate further T_D(f).
• Version 2005-07-05_10 (76p) published version (52p)

@article{Sh:589,
 author = {Shelah, Saharon},
 title = {{Applications of PCF theory}},
 journal = {J. Symbolic Logic},
 fjournal = {The Journal of Symbolic Logic},
 volume = {65},
 number = {4},
 year = {2000},
 pages = {1624--1674},
 issn = {0022-4812},
 mrnumber = {1812172},
 mrclass = {03E04},
 doi = {10.2307/2695067},
 note = {\href{https://arxiv.org/abs/math/9804155}{arXiv: math/9804155}},
 arxiv_number = {math/9804155}
}