arXiv Analytics

Sign in

arXiv:1401.4649 [math.LO]AbstractReferencesReviewsResources

On reaping number having countable cofinality

Saharon Shelah

Published 2014-01-19Version 1

We prove that if the bounding number (d) is bigger than the reaping number (r), then the latter has uncountable cofinality.

Categories: math.LO
Subjects: 03E17
Related articles: Most relevant | Search more
arXiv:1602.07901 [math.LO] (Published 2016-02-25)
Suslin trees, the bounding number, and partition relations
arXiv:2307.16017 [math.LO] (Published 2023-07-29)
Yet another ideal version of the bounding number
arXiv:1211.5170 [math.LO] (Published 2012-11-21)
Bounding, splitting, and almost disjointness

Links

Toolbox