PCF theory: applications
Logic
2016-09-07 v1
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) .
Cite
@article{arxiv.math/9804155,
title = {PCF theory: applications},
author = {Saharon Shelah},
journal= {arXiv preprint arXiv:math/9804155},
year = {2016}
}