# Sh:388

• Goldstern, M., & Shelah, S. (1990). Ramsey ultrafilters and the reaping number—Con(\mathfrak r<\mathfrak u). Ann. Pure Appl. Logic, 49(2), 121–142.
• Abstract:
We show that the reaping number r is consistenly smaller than the smallest base of an ultrafilter. We use a forcing notion P_U that destroys a selected ultrafilter U and all ultrafilters below it, but preserves all Ramsey ultrafilters that are not below U in the Rudin-Keisler order.
• published version (22p)
Bib entry
@article{Sh:388,
author = {Goldstern, Martin and Shelah, Saharon},
title = {{Ramsey ultrafilters and the reaping number---Con($\mathfrak r<\mathfrak u$)}},
journal = {Ann. Pure Appl. Logic},
fjournal = {Annals of Pure and Applied Logic},
volume = {49},
number = {2},
year = {1990},
pages = {121--142},
issn = {0168-0072},
mrnumber = {1077075},
mrclass = {03E05 (03E35 04A20)},
doi = {10.1016/0168-0072(90)90063-8}
}