Proof.
First claim: For any ,
there is
with
and for any
from
such that
there is some
with .
Proof of claim: Enumerate all
as . Now let
, and use transfinite
induction to form a chain .
-
is a limit ordinal: set
(then
as ).
-
Given
(not a limit ordinal), look at .
Assume
so
partial elementary. Then we apply Proposition 13.4 (Note the elementary super structure construnted
here is of size )
to find
with
with a
realising .
Then by construction, .
Now let . Note that we might have
introduced new elements. Note .
We build a new chain of
countably many steps with
and such that for any ,
if then
there is
such that .
We do this by iterating the claim.
FInally let .
Then:
□
Example 15.10.
Let .
We describe .
For ,
let
be the type containing “”
(exercise: why is this unique).
FOr set
|
is a -type
with respect to ,
not realised in ,
determines a complete -type,
as we have determined all atomic formula, by
determines a complete type.
So .
.
Note: in general .