More on Cardinal Arithmetic
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.