# Sh:860

- Rosłanowski, A., & Shelah, S. (2006).
*Reasonably complete forcing notions*. In Set theory: recent trends and applications, Vol. 17, Dept. Math., Seconda Univ. Napoli, Caserta, pp. 195–239. arXiv: math/0508272 MR: 2374767 -
Abstract:

We introduce more properties of forcing notions which imply that their \lambda–support iterations are \lambda–proper, where \lambda is an inaccessible cardinal. This paper is a direct continuation of Rosłanowski and Shelah [RoSh:777, §A.2]. As an application of our iteration result we show that it is consistent that dominating numbers associated with two normal filters on \lambda are distinct. - Version 2006-09-13_11 (27p)

Bib entry

@incollection{Sh:860, author = {Ros{\l}anowski, Andrzej and Shelah, Saharon}, title = {{Reasonably complete forcing notions}}, booktitle = {{Set theory: recent trends and applications}}, series = {Quad. Mat.}, volume = {17}, year = {2006}, pages = {195--239}, publisher = {Dept. Math., Seconda Univ. Napoli, Caserta}, mrnumber = {2374767}, mrclass = {03E40 (03E17 03E35)}, note = {\href{https://arxiv.org/abs/math/0508272}{arXiv: math/0508272}}, arxiv_number = {math/0508272} }