arXiv Open Access 2005

Reasonably complete forcing notions

Andrzej Roslanowski Saharon Shelah

Lihat Sumber

Abstrak

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 section A.2 of math.LO/0210205. 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.

Topik & Kata Kunci

math.LO

Penulis (2)

Andrzej Roslanowski

Saharon Shelah

Format Sitasi

APA MLA BibTeX

Roslanowski, A., Shelah, S. (2005). Reasonably complete forcing notions. https://arxiv.org/abs/math/0508272

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2005
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓