Applications of PCF Theory
Shelah, Saharon
J. Symbolic Logic, Tome 65 (2000) no. 1, p. 1624-1674 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We deal with several pcf problems: we characterize another version of exponentiation: maximal number of $\kappa$-branches in a tree with $\lambda$ nodes, deal with existence of independent sets in stable theories, possible cardinalities of ultraproducts and the depth of ultraproducts of Boolean Algebras. Also we give cardinal invariants for each $\lambda$ with a pcf restriction and investigate further T$_D$(f). The sections can be read independently, although there are some minor dependencies.
Publié le : 2000-12-14
Classification:  
@article{1183746255,
     author = {Shelah, Saharon},
     title = {Applications of PCF Theory},
     journal = {J. Symbolic Logic},
     volume = {65},
     number = {1},
     year = {2000},
     pages = { 1624-1674},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183746255}
}

Shelah, Saharon. Applications of PCF Theory. J. Symbolic Logic, Tome 65 (2000) no. 1, pp.  1624-1674. http://gdmltest.u-ga.fr/item/1183746255/