More on Cardinal Arithmetic

dc.creatorShelah, Saharon
dc.date2004-06-27
dc.date.accessioned2026-07-07T05:09:43Z
dc.date.available2026-07-07T05:09:43Z
dc.descriptionThis 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 prod_{i<kappa}f(i) by a family of ideals and a family of sequences <B_i:i<kappa> with |B_i|<mu_i, and finally we deal with the existence of strongly almost disjoint families.
dc.identifierhttps://arxiv.org/abs/math/0406550
dc.identifierhttp://arxiv.org/abs/math/0406550
dc.identifierArchive for Mathematical Logic, 32:399-428, 1993
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/71689
dc.subjectLogic
dc.titleMore on Cardinal Arithmetic
dc.typetext

Files

Collections