Reasonably complete forcing notions
Andrzej Roslanowski, Saharon Shelah
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 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.
Create a lesson
Related papers
The Logic of Emergence
David H. Wolpert, David C. Krakauer
The group of strong automorphisms of the differential field of transseries
Matthias Aschenbrenner, Lou van den Dries, Joris van der Hoeven
Escaping and generics over ideals
Laurent Bienvenu, Noam Greenberg, Ludovic Patey et al.
Definably isometric cuboids over Hensel minimal fields
Marcelo Fortmann
A weak λ-set that is not a λ-set under p = c
Alexander V. Osipov, Anton E. Lipin
The Cone Fixing the Reals of $HODM2n(x)
Farmer Schlutzenberg, Connor Watson