2004/06/27 by Saharon Shelah
Mathematics · #math.LO
published as Archive for Mathematical Logic, 32:399-428, 1993
arxiv created 2004/06/27 · arxiv updated 2009/12/01
This paper deals with variety of problems in pcf theory and infinitary combinatorics. We look at normal filters and prc, measures of the size of [lambda]<kappa, pcf-inaccessibility, entangled orders (and narrow Boolean Algebras), measuring prodi<kappaf(i) by a family of ideals and a family of sequences <Bi:i<kappa> with |Bi|<mui, and finally we deal with the existence of strongly almost disjoint families.