Suppose we want to construct a ccc forcing ℙ of size ω1. Then we can proceed as follows:
Let < σαβ : ℙα → ℙβ | α < β < ω1 > be a continuous, commutative system of complete
embeddings between forcings.
Let ℙ be the direct limit of the system and assume that all ℙα are countable. Then every ℙα
satifies ccc. Hence by a well-known theorem about finite support iterations ℙ also satisfies ccc. Obviously, this only works for ℙ of size ω1 because we take a direct limit of countable
structures.
What do we have to change to construct a ccc forcing ℙ of size ω2 from countable
approximations?
1. We need some structure along which we index the approximations and which replaces the
ordinal ω1 with its natural order. An appropriate structure will be given by a simplified
(ω1,1)-morass. That is, we replace the linear system by a two-dimensional one.
2. We need a replacement for the continuous, commutative system of complete embeddings.
We will also construct a continuous, commutative system of embeddings. However, not all of
them will be complete.
We have to assume that there exists an (ω1,1)-morass to construct a ccc forcing ℙ of size ω2.
There exists already a very successful method to construct a ccc forcing of size ω2 assuming
only □ω1. This is Todorcevic’s method of ordinal walks. So, why is the new method
interesting?
1. There exists a variant of it which guarantees that ℙ densely embeds into a forcing of size ω1.
Hence ℙ preserves GCH.
2. It has a natural generalization which allows to construct ccc forcings of size ω3. Since very
little is known about possible structures on ω3, this might be interesting.
Two-dimensional applications
Three-dimensional application
Open Problems
Morasses / Example