On the bounding, splitting, and distributivity numbers

Abstract: The cardinal invariants

m a t h f r a k h, m a t h f r a k b, m a t h f r a k s

of

m a t h c a l P (o m e g a)

are known to satisfy that

o m e g a_{1} l e q m a t h f r a k h l e q m i n m a t h f r a k b, m a t h f r a k s

. We prove that all inequalities can be strict. We also introduce a new upper bound for

m a t h f r a k h

and show that it can be less than

m a t h f r a k s

. The key method is to utilize finite support matrix iterations of ccc posets following cite{BlassShelah}.

Recommendations

Cites work

Cited in

(1)

This page was built for publication: On the bounding, splitting, and distributivity numbers