Cohen forcing consists of finite partial approximations to a new subset or function, ordered by reverse inclusion. Meeting the ground-model dense sets makes the union a total generic object.
Over a model of Generalized continuum hypothesis, add Cohen reals with finite binary partial functions. The Delta-system lemma proves the countable chain condition for forcing. The generic reals give the continuum lower bound , while nice forcing names for subsets of number at most in the ground model. Cardinal preservation then gives .
Articles by others on the same topic
There are currently no matching articles.