This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
, . . < q,]: (u EV) & l (u ~z) & (v €z) ;
Z
• then k =ffJ :uEz}, i
Dom(f)
186
[97], 76
FOUNDATIONAL STUDIES
r"fjlf
t,
then k i = Str(z.kj.kt. Fr{fj).Fr(f.e))' ., if f f then k Qu{z. k P. Fr{fj)); i j• p) j i= Y is an element of the last term of k ;
r: (x
We proceed similarly in order to prove the positive part of VII. The negative part of theorem well known technique of Gl:ldel. formula n
in
S
for M
Frm with
VII is proved by using the
We assume that there exists a satisfaction
and denote by
s
a function such that for every
F'r'{n] = ~ O} the set
s{n) is the
resulting from the formula with the Gl::ldel set for its unique free variable. -,S(s(x o), 0, V) where
V
Let
n('
-,S{s(n o), 0 ,V) has
induction on the length of
the G
s
can be defined in
Gl::ldel set
that
if
G
xl •..•• x p and with the following equivalence is provable in M:
Using this equivalence for
M
n
M.
We prove by
Gl::ldel set
p
g, then the
== S{g, F i ~pxi' V).
the result that the equivalence and hence
s(n o)'
is a formula with
free variables
G(xl •.••• x p)
by substituting
be the Gl::ldel set of the formula
is the universal class; we rely here of
course on the fact that the function Then
n
Gl::ldel set of the formula
G= -'S{s(no\O, V)
..., G ;::: G
we obtain
would be provable in
M
would be incunsistent.
The detailed proof of theorem
VIII will be given later.
The main idea is this: we assume the existence of a predicative satisfaction formula for set which is a model for
GB ZF.
and prove in
GB
the existence of a
From this we derive (always in GB)
the existence of a set which is a model for
GB and
thus infer that
[97], 77
187
MODELS OF SET THEORY
GB is consistent.
Thus the consistency of
GB
would be provable in
GB which as is well known entails the inconsistency of GB. We conclude with a theorem which we shall need later and which can be proved by using the same technique as the one used in the proof of theorem VB.
IX.
T
For each predicative formula
following formulae is refutable in (x)(y)
(t")
[T(x, y)
the conjuction of the
ZF:
--4-
<: Frm
(x
pr
) & (y
sets) & (Dom(y) = Fr(x)) (i) c.> (u) [ T( 'Cl(x?,
(ii")
(ill<) (j).c.J
(u)(v)
J.
l < i, u::>}) == Cl(u~
[T( 'Xi E xj
,
== (iii!
f<
similarly as above with
"e "
(a)(b)(y) ((a EFrm
e: Frm pr ) - -
)& (b
t
Glldel set of the formula ,T(s(t), 0) is we
a predicative formula
H
induction
Hence the conjuctton of
that if
h
v{ <. i,u>})H
Fr(H). then
H " -'T(to·'O). we obtain (i") - (v")
~ '
-,T(s(xo)'O),
sIt) = to'
is the
whose free variables are
is a sequence with domain
It we take in particular
[T( '(xi) a' , y)
be the GlkIel set of the formula
(i") - (v")
infer by
"=";
! T('ii Iii. y) .=:
i ~ E Frmpr)&(i~ Fr(a))_ [T( 'Txi)a", YG T(a, yU
(a)(i)(,) (y)
(a)(i) w (y) {(a E Frmpr)&(i E Fr(a» -
Hence the
f
replaced by
(v")
Let
c j, v » 1)
pr [,T(a, y I Fr(a»v ,T(b, y I Fr(b)~}J)
(u) T(a,y
and if
i, u>,
(uSV)
(tv")
Proof.
is a sequence of
Using
Glldel set of Xij'lj = 0, 1"". k-d
T(h, f)
=
H(f
H '5 -,H,
leads to a contradiction,
io
.... , f
i k_ l),
188
[97], 78
FOUNDATIONAL STUDIES
Terminological remarks.
If
S
is a satisfaction formula
(or a predicative satisfaction formula), then we shall write instead of
SIx. y. z},
x
we shall replace
rF,
by
and not simply Let
F
x
If
F
F
is the
I-
z
GHdel sel of a formula
x
[y J
F. then
(although it would be more exact to write
in these formulae).
be a predicative formula with the free variables
xl' •••• x n and let Then the formula
F(z)
be its relatlvisation to the formula
(YI C:z)&. ••• &. (Yn E z) -
x E z;
[ ZFF[{<:l'Yl> •••••
= F(Z)(yl· .... Yn)}
n
is provable in each of the considered systems of set theory. Let
(y €
zl'z2
zir(x)) &. (zd= x
be classes.
[y]~
is an elementary subclass of
(z2
1=
z2
zl
~
z2'
If
(x)(y) [(xEFrm pr) &.
x (yJ)] • then we say that and write
zl -<prz2'
definition can be given for the notion of extension in case when ranges over arbitrary formulae not just the predicative ones. shall not use this notion however.
zl
A similar x We
[97], 79
189
MODELS OF SET THEORY
LECTURE
II
The backbone of the whole set theory is the stratification of the universe into levels (simple theory of types).
In discussing
this phenomenon we shall assume as known the notion of ordinals and the theorem on definitions by transfinite induction.
We denote by On
the class of all ordinals; in the case of the system
ZF
are no classes we think .of On as of a formula so· that the same as x
€
"x is an ordinal".
where there On{x)
means
Sometimes we shall use the expression
On even in ZF treating it as equivalent with Ontx), We define by transfinite induction sets R
= 0,
o
R1"+l = P{R-C).
Rr :
R.t=U{R1',:j"'e
:r-}{T
isa
limit number). Note: What we define is in GB (or any stronger system) a function which correlates with each ordinal case- of that
ZF we have a formula
t:
a set
R l'
In the
R(x, y) such that it is provable in ZF
(x] [On{x)_{E!y)R{x,y)]
This unique
y is denoted by
it satisfies the equations given above. I.
For every set
x
there is an ordinal a such that
R
x;
x gao
This theorem is provable In each of our thre-e systems. The proof is obtained easily from the axiom Fund. x So R a Is called the rank of x, We want to discuss the problem whether some of the Ra's The least ordinal a such that
are models of and prove in
ZF. M
In order to answer this question we shall formulate
the followmg theorem:
II (Scott-Scarpellini). Let each ordinal
't: 1
At
for each limit ordinal
is a set,
'1:
A= U Ar
{A -r : re: On J
~ A '1"+1 and
Under these assumptions:
where for Ar
=U!Ax-": 't~1
190
[97], 80
FOUNDAT10NAL STUDIES
(a),
For each
continuous mapping
f
F:
F in
On
~
then
AaF=: F[x]: A F= F'[x] ,
each
F
(b), in
(c)
such that
the mapping
pr
there is an increasing and
such that if
There is a function
Frm
formulated in
Frm pr
On
fF(a) = a and
x E A:r(F).
f: Frm a-
X On -On such that for pr f(F. a) satisfies the conditions
(a),
There is an increasing and continuous mapping
-<
If
t:On-On
t(a) = a. then A a prA, Proof,- (a), We use induction on the number of connectives
which occur in
F. If
the identity map: sition of
f
and
F F
If
has no connectives. then we take as is
f
If
'(G F
is
I H)7
then we take as
'(Xi)G'
and
f
f F the compo-
F i'i Fr(G). th,;n
H, G = f The only case which requires a more elaborate F G, proof is one in which F has the form r(xi)H' and i E: Fr(H). . Fr(F) We first define auxiliary funchons a:A _ On. and
we take
b:On _
f
On as follows: atx) = min { r E On:(Eu) [(UEA b(r) = sup
1a(x): x E A:r(F) 1
r)
& (AF'H [XU!
It follows from these definitions that if
x E AFr , then (l ~ r
(u)A [(AF H[x vt
(l)The subscripts after quantifiers denote their relativisation to the Cormula x E a.
Thus
(x)
a
means the same as
(x) [ (x E a)
~
••
~
[97], 81
191
MODELS OF SET THEORY
Now we define sup {c(r'):r' < r}
c(0) = 0, c(r+1) = maxtctr-), b(r+1)) and c(rl=
for limit numbers r.
Finally we put
This function is obviously increasing and continuous. then fH(r) = ctr-) = r
and for every
x in
A;r(FI
If
f = fHo c. F fF(xl = r,
we have
c(rl'i!:- b(r).
It follows
[x'1~ i, u>]J) .. (~l A
(A r \= H
=
A}=F
r
(At=H [ xv{d, u>}])
[x]
and similarly AI=F [x]S(u)A (AFH
[XU{}]I~ (ul A (At:sH[ XU{}] r
=' (bl.
(u)A (At=Hfxvf<.i,u>JJ)=.(ArF F [xJ). r
We define
f(F, x) = x
n'F I
(w ithout logical operators),
= f(H, x)
i
if
= f(H, c(x))
,i
where
Fr(H). c
I F~,
if
F is an atomic formula
xl = f(F l' f(F 2' xl)
i ~ Fr(H), then we put
If
and
f( f(x
i)Hl
f( '(xi)H', x) =
is defined similarly as in part (a).
The proof
is identical as in the case (a), (c). F€ Frmprl) If
We define
t(O) = 0, t(r+1) = max (t(r), sup { f(F, r+l):
, t(rl = sup ~ t(r'):r'< r~
t(rl = r , then f(F, r)= r
hence, in view of
(b),
Ar
if
r is a limit number.
for each predicative formula
<
F
and
prA.
Remarks on the Scott-ScarpelUni theorem.
We want to
discuss the question whether theorem II can be so reformulated as to become provable in ZF or in GB.
xl=
192
[97], 82
FOUNDATIONAL STUDIES
The case of the system ZF.
Since there are no proper
classes in ZF, we must replace the class
A
and the relation
x €A
r
If we do this, then we cannot use the satisfaction formula
by formulae.
since there is no formula describing the satisfaction of an arbitrary x
in
Frm in the domain of all sets satisfying a given formula A.
We come around this difficulty by remarking that the satisfiability of an explicitly given formula
in the indicated domain can be expr-e s (A) F. Thus we shall have not a single
F
sed by the relativised formula
theorem starting with the general quantifier "for each F in Frm" but a theorem schema which can be proved separately for each explicitely given formula F.
A final change in the wording of the theorem con-
cerns the function f : since there are no mappings of On into On in F the system ZF we must replace the mapping f by a formula which F describes it The Scott-Sc arpellini theorem takes thus in ZF the following form: Let x and
x, y
A(x)
and
B(x, y) be two formulae with the free variables
respectively; let
formulae: (x)
{A(x)
C
be the conjunction of the following
= (Ey) [ Only) &
B(x, y8
(y) {On(y) __ (Ez)(x) [ (x E z)
is
f' B(x, y8
t.
(y)(y') lOn(y) & On(y') & (y':y+l)_(x) [B(x,y)_B(x,y'Dl, (x)(y)
(Lim(y)"_
For any formula D
F
f B(x, y) ==
F
with two free variables
be the conjunction of the formulae: (x]
[On(x)
(Ez) [ (z E y)& B(x,
---7' (E! y) F(x, y)]
x, y
zilD let
[97], 83
193
MODELS OF SET THEORY
(x) (y) [ F(x. y)~On(x) & On(y)] (x)(y)(zHt)
[F(x, y) & F(z, t) & (x E z) ~ (y E t)]
(x)(y) (Lim(x) & F(x, y)......,)o. (u) {(u E y)
==
(Et) [
(t Ex)
&F(t, u)]] With these notations the following holds: formulae
A(x). B(x.y)
and
For arbitrary
H(x! ••.•• xn) there is a formula F(x.y)
such that the implications C ~DF'
r (A(') ;: F (B( •• rll]
C&F(r. r)&B(x l• r) &••• &B(x n, r ) --. LF are provable in ZF. Notice that the formula x's satisfying over
C
A is the union of sets
says that the domain of all
f x:B(x. r)}
with
I'
ranging
ordinals and that these sets form an increasing and continuous
family while
D
says that F defines an increasing and continuous F mapping of ordinals into ordinals. A similar reformulation of the Scott - Scarpellini theorem
Is also possible in the case of the system GB.
Again we must express
the theorem as a scheme because there is no satisfaction formula for
GB. However the assumptions of the theorem and the statement
concerning the existence of a mapping can be expressed as in system
M.
Finally we notice that a theorem similar to the Scott-Scarpellint theorem can be proved of the form
UI
AI' :
I'
-c
(in any of our three systems) for unions s
J
where
s
is an inaccessible cardinal.
Applications of the Scott-Scarpellini theorem. The following theorem is proved in from
M; it can also be proved in any system obtained
GB by adding to it new axioms which secure the existence of a
194
(97], 84
FOUNDATIONAL STUDIES
a predicativE' satisfaction formula: III.
There is an increasing and continuous function f: On _On
such that whenever a model of
f'(r-) = r , then
R
r
-<
pr
V; in particular, R
ZF'.
1
r
is
1
ProoC. The decomposition V = U R r : r E' On satisfies the assumptions of the Scott. Scarpellini theorem. Since all axiom of ZF are equivalent to predicative sentences and are valid in V, we infe.r that if R
r
is an elementary subset of V, then R is a model of ZF r
'
We can now supply proofs of two theorems which we announced in Lecture I: IV.
There is no predicative satisfaction formula for GB
provided that GB is consistent. Otherwise we could repeat in GB the proof of theorem III and infer that there is a set a which is a model of ZF.
Hence by
adding to a its definable subsets we would obtain a model for GB. Since this proof would be formalizable in GB we would have a proof in GB that GB is constatent which would entail
the inconsistency of
GB. V.
M is essentially stronger than GB, provided that GB is
consistent. Prooc'
There is a predicative satisfaction formula for
M but none for GB. VI.
ZF is not finitely axiomatisable. provided that it is
consistent. Proof. We denote by of axioms of
K
the conjunction of any finite number
ZF and show using the version of the Scott - Scarpellini
theorem which is provable in
ZF
that there is an ordinal r such that
[97),85
195
MODELS OF SET THEORY
R 1= K. Hence the consistency of K is provable in r consistency of the whole ZF is not so provable. VII.
ZF whilt' the
GB. is finitely axiomatisable.
We merely sketch the proof of this theorem. Call
F" the
particular instance of the axiom (scheme) to the for-mula
Subst which corresponds GB It can then be shown that all the particular instances
F.
can be derived from the axioms F;, ••. F; where F} ... F 9 are the GB formulae: (Eu l )(Eu2l f(u = <: u I ' u2> l&(u l € u2'] , (Eu} )(u= < u}' u} > l, l(u,"yl, (uEyl&(uEZ), (Et)«u,t>4iiy),(EU )( E u l 2l[ ) & ( .(u ' u} ";> E yl, ( Eu} )(Eu 2 )( E u 3l 2 l 2 Du = <"i- c u 2 ' U3 l lIt( C::: u 2 ' c "s- u l » IS- yl ,(Eu} )(Eu 2)(Eu 3l of Subst
»
f,u =
"s >
l &«u
2,
u
3»<=yl]
These axioms state the existence of the following classes: E = [~u,v): u EVE V
1
Dom (Y), Y X V,
Cnvl(Y), Cnv
Y,
, I = {
> :
2(Yl
u EV1, V - Y, Y () Z,
and our theorem reduces to
the statement that for every predicative formula Y constructed from
E
and
above and consisting of all can be found
there is a class
u
for which
Htu).
~numerated
Details of this proof
in Gl:ldel's monograph.
Natural models. of
H
by means of the operations
ZF, GB, or
If
r
is an ordinal and
R
r
is a model
M, then we "all it a natural model of the corresponding system
In theorem III we established (in M) the existence of a "tower" of natural
-<
models for ZF which is ordered by the relation We now show pr that the existence even of a single pair R • R such that R R r 8 F prs cannot be establ1sht'd in ZF provided that ZF is consistent. We do thb by proving in ZF the following:
-<
196
[97], 86
FOUNDATIONAL STUDIES
VIII. (Montague - Vaught). a model of
If
Prool. We first show that Since the formula
0 r"'" there is an x hence
R
r
-<
R
R; then pr s
ZF.
R
(Ex)(x=x)
and
r.:;i=0.
R
it is true in R
s' t E r , then
If
.::i:
is a limit number
r
is true in
r
is
O. and
r R Eo R and hence t r Thus the formula
in R s such that R E:: x, t and hence it must also (Exl)(x E xl) is satisfied by R in R t s o be satisfied in R. Thus there is an x in R such that R E x r r t and therefore t +l=lr. Using the fact that check that all axioms of
r
ZF
is a positive limit number we easily
are valid in
R. r
The verification is
evident in all cases with the exception of the axiom scheme SUbst
ZF
which requires a separate treatement. Let
F be a formula with
k+2 free variable and let
P E RFr(F) - [L J]
be such that
Rrl= (xi)E!x
in R
be the unique
y
r
r
let
fIx) Let
x
p
and
x
q
and let a be an element of
R
and satisfies the condition
Rs
r•
in
R
r be variables The set
j
F[il]
such that
For
x
RrF= F[iiv{d.x,>.
which do not occur in 1m(f, a) = b
~ H[pv~
belongs to
b>l] where
F
R
H
is the formula
It follows that there is a set
R)= H
[pv l
Thus axiom
SUbst
be also proved in
ZF M.
is valid
in
bl
in
R
r
such that
we easily prove that R
r•
b'
=
1mlf. a).
Theorem VIII can obviously
s
[97], 87
197
MODELS OF SET THEORY
In order to obtain more information about the relation ..( in the class
of all
Rr's
we introduce the following definition:
We call an ordinal there is a sequence
-<
and
R fit)
that
t
f
pr R f(t
r
extendable if for any ordinal
of order type ')
From part
s
such
for
(c) of the Scott-Scarpellini
that there are extendable ordinals. Rr
On
IX.
(Ryll Nardzewski).
Let
R
R
~
R
>
R
R
r
>
Rm(f) and R r ~prRm(fr
So such
-< . pr
r
-<
r R
pr s
hold. (least) extendable
r
with the properties: whenever
< pr R t for some t> s .
We notice
there are arbitrarily high
be extended to an
For arbitrary finite se ouence
follows:
such that
and our assumption says that each such
r-"""pr s from a certain soon can further
m(f) the least ordinal
r
<
so> r
s > sand R ~ R then R o r " " " " " pr s s that because of the extendability of such that
s
such
which
M.
s pr t us assume that there is a
such that there exists an ordinal
r
Rx's
For each extendable ordinal
does the relation
Proof.
theorem it follows
and well ordered by the relation
arhitrarily high ordinals
but for no t >s
r such
consisting of
The next theorem is provable in
there are
t. t'
s
Moreover there are ordinals
that there is a sequence of order type are elementary extensions of
rto) =
that
each pair
pr
f
R t• of sets we denote
that all terms of
by
belong to
Consider the formula T(x, f) defined as
s s
198
[97],88
FOUNDATIONAL STUDIES
W e shall show that this formula has the charater-Iatfc properties (i")-(v") of the truth predicate (cf. Lecture I, theorem IX). Since we know that we can refute the conjunction of (I"] - (v") we shall have the proof that our assumption leads to a contradiction as soon ss we veri: fy that
or
has the properties
Of these, (I"), (It") and (tv") are obvious.
(t") - (v''),
In order to verify the remaining two we prove a lemma: If s
o
c s
and R..L R I'
pI' S.
R..( I'
R
pI' t,
then R ~ S
pI'
R
t•
Proof of the lemma. For each s>s such that R is an eleo s we denote by s' the least ordinal >s such that r R s l is an elementary extension of R The existence of s' follows from s' our as surnptfons .Now we start from given ordinals s , t and construct two mentary extension of R
sequence rand g satisfying the inductive equations f(O)=s. f(n+1)=
" (f(n))'. f(u)= sup ff(n): n
U!
R
gIn)
n
4i On} • Let x
-<
e
Frm
U pI'
I Rf(n)
: n Eo on}
and y ~ RFr(x). s
Since R s pr- V we infer that R 1= x [ y] e V F= x s we prove simUary that R V and therefore t pe Rtl=X [y]
<
==
V/=x [y]
[y]
whence (Rst=x [y])=.(Rtl=x [yJ)
The lemma is thus proved. Verification ot condition (iii"). Let us assume that
(97),89
199
MODELS OF SET THEORY
This assumption is equivalent to the statement that either Rm(f)
1== '.:;x?
[f
the lemma Rm(f)
IFr(x l)]
-<
or Rm(f) 1= '=.x 2'
pr Rm(f
I Fr(x
i)
[r J Fr(x 2 l] .
Since by
for i= 1,2 we infer that the
previous statement is equivalent to the disjunction of the statements
I
» r;
I
Rm(f Fr(x t= x;7 [f Fr(X )] for i = I, 2 i i is precisely the right hand side of (iii").
and this disjunction
Verification of condition (v''), We assume that x '6 Frm and i E F'r-Ix), Let us consider the statement T( r(x
pr
x'" , f):
i) this statement says that f is a sequence with domain F'r-Ix] and that Rm(f) F= x
[f V {
< i,
u>]]
for every u in Rm(f)" We have to
prove that this statement is equivalent to the following: for every u,Rm(f
v! < i, . u >} ) 1&
1]
x [f V £
Obviously the first statement is implied by the second because m(f V{
1 )=
(!) . Now we m assume the !irst statement and choose an arbitrary u. By the lemma
Rm(f)
<
m(f) whenever u i!' in R
J I and hence the first statement implies [ifwhence we infer that the second statement is
prRm(fV( (1, u)
Rm(fv {c 1, u)}} F(x,lx
valid. Theorem IX is thus proved A theorem similar to IX can also be proved for other transfinite sequences of sets, for instance for sets L shall discuss later.
r
which we
200
[97),90
FOUNDATIONAL STUDIES
In connection with theorem IX we discuss brieny the ordinals which are not extendable. Let us call a
function f whose do=
main is an ordinal r and which satisfies the condition
-<
R
R for arbitrary mEn E r a chain of length r star= f(n) pr f(ml ting in flO). An ordinal s is not extendable if and only if there is an ordinal r such that there is no chain of length r starting at s.
The least
such r is called the height of s , The height of an extendable ordinal could additionally be defined as On. We don't have an exact
characterisation of ordinals
which are heights of non extendable ordinals. However we can exhibit a rather large number of examples of such ordinals.
>
We call an ordinal r is a predicative formula F with s E: On and r E R
t=
F
R
[f <:0,
s' x;:.
0 an
Fr(F)
R - definable ordinal if there tOt
such that whenever
then r is the unique element of R
1]
s while 0 is a unique such x if r
s We call F a definition of r , We now prove in M:
such that
~
R
s
X. (Wilmers). For every R -definable ordinal r there Is an ordinal whose height is r-t-L, Proof. Using part (c) of the Scott - Scarpellini theorem we easily prove that there are ordinals x such that R
contains as x element a chain of length r + 1. Let a be a smallest such ordinal
and Ie f be a chain of length r + I which belongs to R
a
. We put
b = flO) and claim that the height of b is r + 1 • Since f is a chain of length r + I starting at b. it Is obvious that the height of b is is a chain
g
?::-
r + 1. Now we assume that there
of length r + 2 starting at b and derive from this assum=
pUon a contradiction. There exists a predicative formula H with
[97),91
MODELS OF SET THEORY
{O, I}'
Fr(H) =
p and arbitrary u, (1)
R
p
1=
v in R
such that for an arbitrary ordinal
p
[f <: 0,
H
201
u>
<
I,
v>}]= (v
€
On)&(u
is a chain of length v). We shall indicate below how to construct such a formula. As'summg that we carried out the construction we proceed as fo1=
lows. We easily show that n E R n+ 1) S; n in r + 1; since gIn) R
g(r + 1).
Now
g
G
I( r+
R
g(r+1)
Rg(n+l) for arbitrary (r+l) E
we see that g
1 ) is a chain of length
r + 1 and hence
by (1) Rg(r + 1)
F= H [{ <: 0, g( r + 1
Denoting by F a definition of
». <
1,
r + I>}]
r we obtain from the last
formula R
& (Xl
x
2
g(r + 1)
+ 1) & H
J:=
( Ex ) (Ex 1) (Ex [F(x & ( x :f:. 0) 2) 2) 2 O
J
Since Rg(O) is an elementary subset of can replace in this formula g(r + 1) by infer that there are elements c , d of R
F
[f<2,
c>J]
~
and R
b
g(O), I, e. b
R
by b.
such that c ; 0,
loa H [{
<
we
g(r + 1)
We thus R
b
F=
I, c + I>}]'
202
[97],92
FOUNDATIONAL STUDIES
The first
of these formulae proves that
c
r
and the
second that d is a chain of length r+l. Since d Eo R b and
<
b
a.
we obtain a contradiction with the definition of It remains to construct the formula
RI
(
X
(~ [(x ft
and let Fr
19
Frmprl & (f E
-+(t
1=
2
G (
a
Let
y I be a formula which defines the relation
•
(cr. p
R (f)
H
x =
t I be the formula
2.
(x l l & (
2
F=
xfr] I
~
x[f]l).
The required formula is On( xl
6
i
I
& Fn ( X
oI
"o
E: j I & ( j Eo -+-G( 2.
& ( Dom ( X
oI
=
Xl
)
& ( i ) ( j
I (
2
)
t I
(
&
il
t
Natural models of GB and of M. These models are si= tuated much less densely than the natural models of ZF: we shall ZF + AC
prove the following result in the system ZF
resulting from
by adjunction of the axiom of choice:
XI. (Shepherdsonl • anly if
r
is of the form
R
r
s +
is a natural model of and
s
is a
is a successor.
class of the model. follows that if
R
r
M
Proof. If r
if and
strongly inaccessible
cardinal; this condition is also necessary and sufficient for be a model of
GB
t
R
r
hI a
r = s + I
model of
GB
or of
M
• then
because there exists a universal
From the satisfiabUity of the axiom Subst it
is an ordinal
c::
s
and
a mapping
of
to
[97],93 into s t'
<s
203
MODELS OF SET THEOR Y
.
Im ( t, t ) €
then
such that
R
r, t 1 E
1m
s
and hence there is an ordinal tI
This proves that
•
is
s
weakly inaccessible. In order to show that s is strongly inaccessible we have to show that if less than
<
t
s, then the cardinal number of
s. By our- assumption
Since we assume that
R
+ 1
t
s
GB
is smaller than If
is
E
p( t)
and since there
R s and has the same power
P ( t ) , we infer that there exists an ordinal number in
which has the same power as
all
P ( t)
and hence
is a model of
s is a well ordered set which belongs to
as
R
€
Rs
P ( t ) . Thua this cardinal number
s
s is strongly inaccessible, then we easily check that
the axiom of
M are true in
axiom Subst is satisfied because if
Rs + l' f
In particular the
is ant mapping of
Rs
into R s and a belogs to R then Im(f, a) belogs to R s' s' A comparison with theorem
problem: how to characterize ordinals sfying the relation
R
r + 1
<, pr
suggests the following
VIII
s ( r <: s)
r
Rs +
?
sati=
It is easy to see
that this problem is wrongly expressed because the relation
in
is the largest element of R + but not of R + )' s l r r l Therefore we modify the problem and discuss not the relation of question never holds (R
elementary extension but a closely connected relation of elementary embeddability. Definition. there is a function
R
r
is elementarily embeddable in
whith maps
R
r
isomorphically
R
s (with
if
R. s
204
[97], 94
FOUNDATIONAL STUDIES
respect to the relation
E ) onto an elementary subset of
XII. (Reinhardt). If and
R
>
r'
r
+ 1
r
is measurable. be a function which embeds R
Proof. Let R
true of
r' + p R r' + p
Since
R
R
r
R
onto
R
( 1. e. f( R
s
+ land
R
R
s
r hand the range of f
r
) = R
S
, where
+
R
I:
p
i.
s
f( r ) = s
r
is
the largest ordinal
R
+ 1
I (r
since
On the other s is strictly contained in s +
+ l)
Rg ( f
I (r
+ 1 )).
Rg ( f)
f( x 1"'\ Y ) = f( x ) r'\
f
Rg ( f ) f
for an
argu=
it easily follows that
f
y ) = f( x ) V
f( y ) ,f( x V
for arbitrary
x,
f( Y ) y
in
For instance the first equation is established by no"
tieing that
x /"\ y
together with (t
PEs
P
must be the value of
f( x - y ) = f( x ) - f ( Y )
Rr + 1
(t)
Obvious.ly
r + 1 From the properties of
and
R r +l
the largest ordinal of
because an ordinal in ment in
is
maps
it follow that
s + 1
for reason of cardinality. Hence there is an ordinal such that
s
is the largest element of
r
the largest element of
s
Similary of
r' + p
r + 1
GB, the same is
is a model of
r + 1
and hence
strongly inaccessible. Since and
where
is elementarily embeddable into
r , then
into
R s is a strongly inaccessible ordinal
r
E
"o )
together with Rs + 1 •
is characterised as the unique element
x and y satisfies in
== [(
t
E xl ) &
f ( x ) and f ( y )
z
which
R r + 1 the formula f ( z x )] Hence 2 satisfies the same formula in f:
[97],95 Now claim that
F
we put
F
S.
Y
<:
y E
x,
r
~
and hence
rEF
r,
F
then
x
E F.
= s
f (r
p '" f ( x)
r - x
c
and hence
F
f ( x ).
x) V
p t
or
F
g 6
Since
f ( g)
R
r
1"\
and
g
R + I r the formula
"o ) == and
fly)
r
it follows that
both these formulae 0
• Hence either
F
is t-multip1i=
prime.
r
,then
consisting of elements
g
satisfies in
R
r
+
is a function with domain Rs + I
a we
the formula saying that
f ( t )
n
Rg ( g)
can be characterised as the
which together with
(w ) ( v
) [(
< w,
v
g
»E
Hence the same formula is satisfied in ( () Rg ( g)
~
pEs = f ( r )
PEs
is
c
t
satisfies in
unique element of
( t E
fIx) f'\ fly)
r - x)
F
+
The intersection
+ I r
~
From
x)
n
and
it is a function with domain
R
fIx
Y )
and we infer f ( r )
be a sequence of type
formula which says that infer that
t (
is not void.
Since f (r
f ( x )
belongs to F
g
F.
( r - x )
Now we show that if cative. Let
flx l
then
is a filter of subsets of
cannot be true because
of
and
which is prime and
p E f ( x ) ()
y
r = x V
either
x or
then
f ( Y ) ,i.e..
p €
Hence x S
r
1
r
F.
and
it follows that
If
r : p E. f ( x )
x () y c!: F
hence x
S
x
is a filter of subsets of
If
If
f
%
t-multiplicative for each
and
205
MODELS OF SET THEORY
f ( g »
satisfies in
xl)
-+ (
R
+ 1
s
t
E v )] by
y)
206
[971.96
FOUNDATIONAL STUDIES
Now we notice
sfted in R
S+ 1
by
n Rg(f(g)) and
Since Rg(g)S F, we see that
that the same formula is also sati=
f(g) and hence
n
Rg(f(g)) =
Un Rg(g)).
pE fIx) for every x in Rg(g).
Now no=
tice that x E Rg(g) is equivalent to Rr+lt="(Ey)«y,XO>E Rs+II= (Ey)(
I)
XI)[{
({
fIx»~
(I,g>}] and hence to
,
fIg»~}]; i.e•• to
fIx) E R (f(g)). Thus p is an element of every member of Rg(f(g)). g I, e., pE nRg(f(g)) = f( Rg(gll. Hence Rg(g) EO F.
n
n
This proves theorem XII. Notice that this proof like the proof of theorem XI was carried out in the system ZF + AC.
(971.97
207
MODELS OF SET THEORY
Lecture III In this lecture we shall apply' the Scott - Scarpellini theorem to obtain various famUies of Bets which form models of We call a set In f
A
predicatlvely closed if for every a
oe
A. every F e Frm pr with
in aFr(FI-{olthe set SF ( a, r ) =
belongs to
A. The
of a determined by
{x
and
~F[
a : a
~
Fr (F
set SF ( a, f I F and f.
f
for
every
{< 0, x>]J1
U
will be called the section
We shall show that all sections of
eremenre
a
of
A
can be obtained by iterating finitely many oper-attons Let us con" sider the following operations:
I x, y}
A I ( x, Y ) = = x - y ,
A ( x, 5
f A
A
B(
I O(
ll
6:
1
A ( u, 2
y ) =
x
v ):
u,
x, y I =
E:
u E- x }
<
u >
I,
v>} :
(
U
E:
x )}
(x , y ) •
A12( x,
[f <: 0,
y ) =
{{ <0, u> ,
f
u:
v <S x
~
x, y ) = U x,
( u, v A
v I : u, v
A 4( u,
ZF.
< I,
f< 0 . u > ~
U
>1 U
:
u
f:
y EX}
x}
vI
&
1
208
[97], 98
FOUNDATIONAL STUDIES
I. If rations
0 t: A
and A is closed with respect to the ope> A
Al - A 12 , then
is predicatively closed.
We shall only indicate the essential steps of the proof. First we notice that an arbitrary finite sequence whose terms are integers belongsto
A. Hence if a set
ce s with a common finite domain
does the set of all sequences
d
fox
~
where
x
of finite sequens
fx Z
A, then so
ranges over
f is a fixed one one mapping of a set d' onto d. L. a F r( F ) : a Hence if the set { X -= belongs to A, then so does the set
s
W belongs to
1= a F r(
l=
[x]J
F
a~
F' )
sand
F'
[x
J1
where F' arises from F by a permutation of variables. By iterating suitably the operations prove that if a
d
IE A.
A 1 - A 12
d ~ CV is a finite set of integers and
From this we
easily infer that if
a 6i
sEA
a set of finite sequences with a common finite domain ranges contained te set
d'
in
a
where
d ~
such that
a
dIe w
is in
and d
we A, then s
is
and with
A, then for every fini=
~ f €
the set
a d' : r
Id
G s}
belongs to A. Finally we show that if integers and
rj
n
EO ad: (Eu) s
d
J
s
[f U {
a E: A,
d
is
a finite set of
S- ad U {n I, then the set
-c n, u>JE-S]~
belongs to
A along with
. We show this by noticing that in order to obtain
this set from
s
it is sufficient to' subtract from every member
[97],99 s
of
MODELS OF SET THEOR Y
the set of all sets of the form Let us now
[
f
aFr(F) : a
€
consider the set
~ F [ f
one of the formulae
D
F
( a ) belongs to
A
1}
A D
3 F( i
F
a
€: A
and
F is , then
A
7
we extend this result to the
has arbitrary variables. Using the operations
A
A
2,.
established above we show that if
; I, 2, then the same result is true for the
for
rFI
F
i
cases when
F;
we use
in order to construct
A
( a )
F
If
a.
E:
as we easily see inspecting the operations
as well as the remarks a ) €
D
1 where
t;>
'c 1(x O~
Using the operation case when
t <: n,
209
and
F ; r( \
) F;'
from
Finally
a ) . 12 F( The main result of the present lecture is as follows: II. Let
SF( a, f)
D
be a family of sets (indexed by ordinals) r which satisfies the assumptions of the Scott - Scarpellini theorem. If in addition
A
ArE: a =
U {
As:
and predicatively closed for every
s € r
On}
and
in On, then A
A
r
is transitive
is a model of
ZF. Proof.
'The verification of most of the axiom is immediate
We discuss only the axioms Inf,
Pot and Subst which are slightly mo=
re difficult to verify. Axiom of infinity r n of ordinals: r 0 = 0,
We define by induction a sequence
r + 1 = min { s n
and put
r
sup r n'
then A
satisfies the conditions stated in the axiom Inf,
r
a E
Axiom of power set, For let
s ( x
: x E
f
min
n
P( a
& ( x E: At)'
J
A
As ~ , t
s: x €
E
This section is equal to tively closed,
a sequence
F= ( X o
< 1, s »
I
f
p( a )
At €
u such that
"o ) -+
(v E. x I)
n
A
A
of
Pta)
s ( x ) :
==
(x ~ a) &
Au
and
where
u
A
t'"\
F
is
]
and since
Au
is predica=
it belongs to Au and hence to A,
Fr( F ) .2 { 0, in A F r( F) - {
I ( E
f( x ) = min
in
max (r , sup
Axiom of substitution, Let formula with
and x
r
I < 1. a > })
SF( At'
the formula ( v ) [ ( v
A
x E A --'>- (x E P( a )
Then
Now take an ordinal
determine the section
A
[97). 100
FOUNDA T10NAL STUDIES
210
1s
V
Xl I F :
pJ)J
(
1
Ey
I] 0,
[
( Y E-A B
and put
=
E A r and let Furthermore let
1} such that
For
(pJ
a
x
A
in
be a
p
be
let
r
) & ( A 1= F
f
max( r , sup
F
[{
<
Usin~
the Scott - Scarpellini theorem we determine an ordinal
such
that
u>
and
for arbitrary
x,
y in
0, x> A
f( x ) : ( x E
A
u
u
the following
equivalence holds
(AIcF[{
=(A)=F[{
Finally we choose an ordinal and determine the section an integer such that
(Xl)
i
( Xl €
X
o
Sa( Au,
-
( Ex
O
I
v such that
~ < i, a>
is not free in
x. J
x~,<:'I, y>}Vp]I,
[(
F
X
o
U
and
EO
A
u
E: A
p I where a
v is
is the formula
x. ) & F ] J
I
r
)]),
(97). 101
MODELS OF SET THEOR Y
This section which we denote by
b
belongs to
l=
F
211 A
v
and satisfies the
condl.tion y
= == b
(Ex)
(x €
[
a) & ( A
[~ «
0, x
> , «:
I, Y
>j U
p])]
Remark. Theorem II was proved above on the basis of the system
M. There is a version of this theorem which can be
established in
ZF. Similary as on p. 82
we consider a formula
with two free variables and define a formula (Er)
.
)J
[on( r ) & B( x, r
Let
4 fQrmulae listed on p, 82
and of the following formulae:
(x) (y) (r-)
[On(r) & B ( x, r) & (y G x) {On(r) & B(x, r) & B(y,
Ix
(The
A by
C"" be the conjunction of the
(x] (y) (r)
the set
B
~ B(y, r)]
rl~ ~2
(Ez) [B(Z,r)&(z=At(x,y)ll]
first of the above formulae expresses the fact that
: B(x, r-)
1 is
transitive and the second that this
set
is closed with respect tQ the operations Al - A ; obviously the l2 second formula should be expressed in the language of ZF which can easily be done by writing down the definitions 'lf
Ai(x, y)
as
set theoretic formulae). Imitating the proof of theorem II we can derive from C* in ZF all formulae obtained from the axiom of ZF by relativising all quantifiers to the formula A. In other words the formula A defines an interpretation of
ZF
ZF +
in
C'* •
ExampleI' of classes which determine models of Example
1. V =
Example 2:
R : r E On r constructible sets. We define for an arbitrary
set a a' =
1
U[
ZF.
(sF(a, f): (FE Frm
pr)
& (0
~
Fr(F)
&
tr s aFr(F) -
JoJ)}
212
FOUNDA T10NAL STUDIES
[97], 102
a' is the family of all sections of a determined by an arbitrary formula in a. L
F
L
O·
O
in
Frm
and an arbitrary sequence
pr
w ith terms
We now. put
The union
r + 1 L
~
L' r:
L
U{ L r
e-
r
U{ L r
s
r E is
E on}
s1 (s is a limit number)
called the class of con-
structible sets. It is easy to construct a relation which well orders the
class L. X
~
X
r + every of Fr-m
u{
UI Xl'
: r
where
On}
E
X X if s is a limit number and where r <:. s} s r is obtained from X r by the following construction. For
0,
o
We define it as the union
u
L
in
pr
L
r +
we denote by
r
such that for some
in
F
u
LFr(F) -
the earliest
element
{O}
r
The term "earliest" refers to a fixed well ordering of the denumerable set
Frm
pr
which we think
If there are many sequences
of as fixed in advance. for which the above
equation is true
then we denote by f the earliest of them in the u lexicographical ordering C:::::<.: of finite sequences induced by the r e> lation
X
r Now we define
~.(
u, v>
pairs
< u,
X
: (u E Lrl & (v
v>
where
u
as the union of
r + 1
E L and
r + 1
v
- L l} r
X
r'
of the set
and of the set of
both belong to
L
r + 1
L
r
[97], 103 and either or
F
213
MODELS OF SET THEOR Y
F u precedes
F v in the well ordering
W
u In order to prove that
L
is a model of
ZF
we esta=
bllsh four simple lemmas: L
1.
Proof.
rx
r
its own section. 2.
for each
L r E r + 1 L = S
(i) Each
L
0
x' 0
r (L
r'
in
is transitive; (il)
r
On
0) and hence
If
L
is
r
s E r , then
Ls.s;. L r· We prove both parts simultaneously by induction on For r = 0 the lemma is trivial; if it holds for 'all r < rand r
o 0 limit number, then it is obvious that the lemma is also true L
r
C
L
r
aELr;hence Transitivity of
+ 1
and
£
L
+
r
is transitive. Thus assume
SrXo€X;'
a=af)L r
(Lr,~l)~Lr+l.
L r + 1 follows now from the remark that if
element of L r + I' then x
for
r 0 = r + 1. It will be sufficient to show
r O. Now assume that that
r-,
is a
x
is a section of
Lr
and thus
3. If k is a set
of ordinals and
r
sup k,
x
is an
Lr.s L r + 1 •
Lr=UtLs:SE
then
k}
Proof. If r E k, tonicity of the sequence inductive equation for the 4. If aE L
L
then the lemma results from the mono= if r ¢ k, then it results from the last r: L 's and the lemma 2(10. x
then each section of a belongs to L r + l·
r, Proof. We use the following simple fact which can easily
214
FOUNDA T10NAL STUDIES
(97), 104
be established by induction on the number oC connectives in a Cormula: Let
c
CIf
and let F pr relatlvising all quantifiers to the formula x , does not 1
F
Frm
occur in
F.
X
If
be obtained Crom
F
by
x E Xi where the variable
is a transitive set,
a
cX
and
f E aFr(F). then
X = L
We take now
re
aFr(F)
-101
where
SF(a. f) = SF"'" & (x
o
E Xi)
r
r,
Proof. Ci).
In view of r
r :
numbers. Lemmas
c
fvf"' i, ao> L
III. I. is a model of
U{ I.
0 € Fr(F)
that
and
a E I. . We obtain then (I.
) belongs to
the union
and assume
r,
r
1 ) which
proves that the
+ 1
ZF.
lemma 2(ii)
we can represent
I. as
On] where the indices range over limit
1 - 4
show that all assumptions of theorem
II are satisfied by the family closure of of
L
(.V.
I.
(.J.
r
L .... \ • in particular th'e pr-edic atfve ..... ·r results from lemma 4 because each element
r belongs to some Lx with
x
<.:.> . r and c:..u • r
hence its sections
are elements of I. x+ 1 which is contained in L Example 3.
Relatively constructible sets. We start
a transitive set a and put Lo(a) = a. Ls(a) =
U
Ui Lr(a)
[I. r (a)
: r is On
L + (a) = r l
: r<:s} (s is a limit number). The
1 = L(a)
with
L~(a),
union
is called the class of sets constructible
in a. We can show similary as in theorem III that
.
L(a) is a model
(97), 105
215
MODELS OF SET THEOR Y
of ZF. More general notions of relative constructibility are pos s sible. We shall sketch a definition due to
Solovay.
We consider a wider class of formulae. We adjoin to the x. which were used thus far J still one type of atomic formulae U(xil. We call the smallest class of formulae which contain all atomic formulae (including the new ones) and is closed with respect to the operations
FIG and (xilF. the class
of generalised formulae. The notion of satisfaction can be defined in a similar way as for the class of ordinary formulae.
Whereas
for:
merly we defined the notion of satisfaction of a formula F in a set, we must now use a more general relational system. Let x, y be sets such that x 2 y. The atomic formula U(x
is satisfied in this system i) sequence f if and only if f €: y; other atomic formulae are sa: i tisfied in the system (x, y> just in case they are satisfied in x, The by a
inductive clauses of the definition of satisfaction r ema ln the same as before. The notion of section in a relational system <x. as follows: SF«
s>
is defined
x, y>, f) is the set consisting of all a in x such
that the sequence fV{
satisfies F in
be the set of all sections of <x. y).
<x. Y>
Let
<x.
in the generalised sense thus
explained. For an arbitrary transitive class A we put now LO(A) : :0,
L r +1
=
Lrr'l A>' and L
s
=U{L r
: r~s} if s is a
limit number. It can be shown similary as in the proof of theorem III
that
L(A) is a model of ZF.
y>'
216
[97), 106
FOUNDA T10NAL STUDIES
Example 4.
Var-Ious generalis ations of cons tructible s et s ,
The clasa L can be defined in still another way which i s sometime s technically more convenient and moreover su s ceptible to var-ious
ge=
neralisations. Let n be an integer~ 12. We define by trans finite induction a mapping d On- On in such a way that dn(O) = n type of the set Z (x): S rE 011 : d (x)<:,r
limit numbers x we require that d (x) = sup n
Let In' K
L
n,
n,
x~(In(x), Kn(x),
of the ..et
0 and the order be n, (d (x»3. n
r dn (1')
I
I'
<
X }
M
be function....uch that the correspondence n Ln(x), Mn(x)) determine s a one - one mapping
Zn(x) onto nxdn(x)Xdn(x)Xdn(x). For y
I(y) = K(y) = L(y)
:
=
M(y)
=
=
dn(x) we put
O.
We now define a trans finite sequence C : On -+V by induction:
('\ C
M
n
(x) provided that x doe s not have the form d (t) and In (x) n
if In(x)~12, thenC
x
= B
<
12;
I (x)+1(C 1x). n
In the last part of the inductive definition B
13
' ••.• B
n
are operations on sequences of sets which satisfy the condition B(f)S Rg(f) u
U Rg(f)
for each transfinite sequence f. ¥.
The sequence Cd (1') = C I' is increasing and satisfies the conditionsC If-€ C1t" and C" I' 1'+1 s
~ U 5 C.....
L r' r<::s
1 where
I'
,
s EOn and B
iB a limit number. We eaBly s how by induction that each CriB a transitive
Bet
[97), 107
MODELS OF SET THEOR Y
(the factors
eM (x)
217
were added in the third inductive equa=
n
tion for
e
* then e s is
just in order to achieve the transitivity of the sets r
Finally it can be shown that if s is a limit number, sed with respect to the operation" Al - A
and hence 12 catively closed, From theorem II we thus obtain IV. The class
e
=U{Cr: rEOn}
e~
e ), r
clo=
is predi=
is a model of ZF,
Remarks, It should be stressed that the class C is a moo del of ZF in
independently of how we choose the operations B
the last inductive e quatfon,
This shows that we m3.Y
1 3'
... B
n
construct
many different models of ZF using the above method. In case when we do not have any additional operations (I. e., when n : 12) the resulting class is identical with L; the proof of this is rather
complicated (see Linden, Sets models and recur=
sion theory, North Holland 1967), We shall use the symbol C
m in
for the x -th term of the se> m in quence C in case when n : 12; the union of all e will be denoted x
x
by C
m i n;
by the result quoted above,
e m in
= L,
We now give an example where we use additional operations, Let n = 15, and let a be a fixed transfinite sequence of type r 0 sao tisfying the condition
as C- {a r : r< s}
for each
s,,- r 0'
We define the additional operations B
13,
B
14
and B 1 5 as follows:
if f is not a function or Dom(f) ~ On, then we take Bi(f) = 0 for
i : 13, 14, 15. B
1 3(f)
Otherwise we denote Dom(f) by r and put = a
r
if r
O
and B
13(f)
: 0 if r~rO'
218
(97]. 108
FOUNDA T10NAL STUDIES
f
fX
(f
:
(x
I K 1 S(r») "
14>}
fMlS(r)
The class C obtained in this case depends on a and will be Z denoted by C (a), The effect of the operation B is that all terms 13 Z of a will eventually appear in the sequence C (a). They occupy pIa= ces x for which IIS(x) = 13,
In view of the definition of B the I4 Z ter-ms Cx(a) where IIS(x) = 14 are consecutive ordinals. Finally
Z
.
Z
terms C (a) with J IS(x) = IS are equal to the common part of CMIS(X) x and a segment of the sequence
<;;:Z (a)
consisting of terms with
indices "K
1S(x). The effect of the operation B IS is this: Lemma,
is
FO~
each ordinal r the sequence {
<:: x,
c;(a)
>: x
E
r}
an element of C (a). Proof, Let s be a limit number> r and let t be an ordinal
such that
1 = IS, KlS(t) = rand MlS(t) = dIS(S)' In view of the 1S(t)
inductive definition of the sequence CZ(a) we have. x Z\ c~a) (C r) ('\C~IS(S)(a) (x, c~(a)~: xE. r} (\
=
=t
C~15(S)(a)
Z All ordinals x(r are elements of CdlS(S)(a); this follows from the remark that there is a sequence of type s of ordinal satisfying the equation 115(x) = 14 Since
Z
Cd
I 5(s)(a)
C~ (a)
<::
dlS(S)
is an element of
Z
for every x < r, we infer that the pairs (x. Cx(a»
with
(97), 109
219
MODELS OF SET THEOR Y
,,(r. belong to C
sequence [ <x.
Z d 15(S)(a)
c~(a) > :
for each x
XE r
Hence C
Z t
(a) is equal to 'the
J.
As an application of the above remark we prove the fo11o= wing theorem: V.
The axiom of choice is consistent with ZF.
Proof. Since C Z (0) is a model of ZF. it will be sufficient to show that the axiom of choice
is true in this class. Now it is easy
to show that If a transitive class is a model of ZF, then the axiom of choice is true in this class if and only
if
this class contains with
every element x a function which maps ordinals onto a set y 2 x, Z In view of the lemma the model C (0) has this property which proves -the theorem. m in Definable well orderings of the universe. For x in C m in we define Od(x) = min [ r : x = c min { ofin min The relation R = <x.y;,EC )(C : Od(x) Od(y) } is min obviously a well ordering of C . m i n• m in It can be shown that the relation R is defillable in C
1.
c
Even a stronger theorem is true: VI. There are finitely many sentences K •.•. , K which l n belong to the set of axioms of ZF and formulae F, G in Frm with pr Fr(F) = Fr(G) = {O. l} such that whenever m is a transitive class in which the axioms K
1,
•..• K
n
are valid, then
[97], 110
FOUNDA T10NAL STUDIES
220
(xEOn(hnl-+(m\=(E!xIlF[ {{O, x>l]), (xEOnf\m 1
&
(yEm}_(mI=F[
(yEml~[(mI=G[
(xEm) &
t
<0, x:>'
L{O,
x>,
(I, y>'}])=(y;c:;,inl, l : ( x , Y)f RminiJ
{I, y>}]
The formula G is defined from F as follows: (Ex (x
2)(Ex 3)
4)
{on(x
[(x € 4
given here.
21
& On(x
31
& (x
2E
x
3)
& F(x
2,
x
o)
& F(x
3,
Xl) &
x2)~' F(x 4, x o}] & (x~) [(x 5 E x31~ , F(x 5; Xl)]} The construction of F is much more complicated and cannot be However it does not require any new idea: we
in the formal
simply write down
language of ZF the inductive definition of the set
C~in
A theorem similar to VI can also be proved for sets L
r. We shall use this fact later. The formula F can be called and absolute m in definition of C (or of L l. r
r
m in It follows from theorem VI that the class e possesses a m in well ordering which is definable in C Hence the existence of a de; finable well ordering of the universe is consistent with ZF. These ideas were further exploited by Godel , Kuratowski, Addison and others who discussed the well ordering of
e min"
P(w)
induced by the relation R min and proved that it is pr oject ive of the class PCA f\ CPCA. This result has numerous applications in proofs that various hypotheses of the descriptive set theory are consistent with ZF. Example5. Ordinal definable sets. This class was first di
s
scovered by Codel who did not publish his results and then r-edts cove s red by Scott and Myhill and some years afterwards, independently, by Vopenka and Hajek. We call a set x E R in Frm
pr
r
definable in R
r
if there is a formula F
with exactly one free variable X such that for every t in R r o
(97), 111
MODELS OF SET THEOR Y
the conditions t f x and R r
1= F[{
( O. t ')}]
221
are equivalent.
A set x is
ordinal definable if there is an ordinal r such that x is definable in A set x is hereditarily ordinal definable if for every finite sequen= r ce s such that s E- s IE. .. s IE s = x all the set s s . are ordinal n n0 J definable.
R .
We put D
Ds =
definable}
o
= 0, D
r+
E R r : x is hereditarily ordinal (s is a limit number).
I = {x
U{ Dr: r( s}
C D for r r s for limit numbers s.
It is obvious that D
°s
;U{ Or:
r<s}
<s ,
D is transitive and r Since the operations Al - A
lead from ordinal definable sets again to such
I2
sets, we easily infer,
using theorem I that every set Dr is predicatively closed. Le rnrna
There are arbitrarily great
ordinals such that
It is clear that each OrE R +
Proof.
and that each element r 1 Thus it remains to show that
of Dr is hereditarily ordinal definable.
there are arbitrarily great ordinals such that Dr" is definable in R r+ I' To achieve this we first construct a formula which "says" that x is definable in R • Y
"z:
Let B
B (x
Ord(x
Fnc(x ) , Dom(x ) = 2 2
o'
x ,) 3
be the conjunction of the following
formulae:
(t)
o),
[(tE:
(t) [(tE
x ) -+ (u] o X
o
+ 1) & Lim(t) -
( <. s , v » Let C
{«t + I,
E: x2 )
&
X
o
+ I,
u> E x (u)
l
2
(0,
o>E x 2 '
<::X
) = (v) ((vE u)~«
(<. t , u> E x
(u Evl]}]
2)
==
&(x 5Ex".l]
It is not hard to show that if r
E:
On, r
f
H <. 0,
'
X
"7 E-
3
v , t> Eo x
(Es)(Ev) 8s
be the formula (with the free variables xI'
& (Fr(x ={o})& (x [(X Eo XI) =(x 1=x (x ~ Frm 5) 4) 5 3 4 4 p r)
o
x
5
"a: x 4)
>}j ) &
0 and r is a limit
~ t)
X
2
2
,
D1] &
222
[97), 112
FOUNDA T10NAL STUDIES
number, then for arbitrary x,
y,
Z,
valence are true Rrl= B
H~
0, x>"
"<. 2,
<. 3,
y),
with domain x + 1) & (s) (s
~
Z
t, F in R
r
the following equi z
>}] _ (x EOn) & (y is
x) _(y(s) = R
s)
a function
& (y(x) = z)
c r, then R r ~(E! x 2)(E! x 3)B[ {<. 0, s > ~J ' R l= C l t <. I, t>, (3, Z), (4, F> )] ;: (F E Frm & pr) r to}) & (t ={ uE:z: z\:=Flt c 0, u ~}1)
If s
It follows that if we put A for arbitrary
(Ex/Ex
3)(Ex 4
)
lB & C1 '
positive limit number r and arbitrary x, t in R
equivalence RrFA [{ <,0, X),
t>}] :: (x (;On)
& (H R & x) definable in R ) • x For each ordinal r we denote by f(r) the supremum
sup
(I,
(Fr(F) =
r
then
the
(t
is
(g(x) : x ERr} where g(x) is the least ordinal such that x is
definable in R or 0 if such an ordinal does not exist. It is obvious x that the function f is continuous and non decreasing. It is even strictly increasing because each ordinal r is definable in R + but does not r 1 even belong to R Hence there are arbitrarily great critical numbers of r. f, I, e., ordinals r which satisfy the equation fIr) = r, We claim that if r is such a number. then Dr is definable in R
r+1' First of all, Dr E R + because Dr ~ R this is proved by r l r: remarking that D + ~ R by the definition of D + and then summing X 1 x X 1 over x ~ r-, We have still to exhibit a formula 0 such that. for every
x, (xE: Dr) :R r +1 "'0 [t < 0, x>}]
To establish the existence of this formula we noUce that r and
R r are obviously definable in R r+1' Ftlrthermore from the definition of Dr we obtain the equivalences
(97), 113 (xE Dr)
223
MODELS OF SET THEOR Y
-= (Es) [.(s ~r) &. (xE. DS+1'] (Es) [(s ~ r) &. (x E: RR) & (x is hereditarily ordinal definableTI IEsl [IR
~ r'
&. .I x
~ Rsl & (u)(ml (Fn(u\ &
l (i <
m + 1) &. (u(O) , x) &. (I)
(ulm) is ordinal definable)}
(rn e W
) &. (Dornf u) ,
m) ~ (uU+l) E u(i)] ~ .
We now notice that the quantifier (u) in the part of the equi> valence can obviously be limited to R r ' because a finite sequence whose terms belong
is itself an element of Rr(the terms of u belong r to the "transitive closure" of x and hence to R since we assume that
utml
~ utrn-T)
to R
r It follows that we can replace in the
l: " • Eo ulO) = x),
least part of the equivalence the expression
.
(utm) i 9 ordinal definable)
by (u(m)E R ) & (u(m) is ordinal definable). r
As we know 'ordinal definable' means (Et)
l (t E: On) &. (utm)
is defina=
ble in R )] , However, since u(m) E- R and r is a critical number of r t f we see that the expression 'u(m) is definable in R ' can be replaced r by '(t l: r) &. (ulm) is definable in Rt" and thus by (Hr)&(Rr\=:ALt<..o. t:>,
(l.u(m»}]).
Thus we finally obtain (x € D ) ::: (Esl (s € r) & (x (, R ) & (ultm) [(u E R ) & (m € w) & r s r Fn(u) &. (Domtu) = m+l) & «,0, x> Eo u) &. (1) (i~ m)_ (v)(w) [(v
_(wE:
ER )
V)]}]
r
&.
(wE R ) & (<'i, r
v» E u)
& (y)(y€ R ) &. (<.m, r
L(t f R r )&
AU
s» ~
t
&. « u)
1+1,
w:>E.
~
On(t) & (R r,," <.0. t:>, O. y >}] This formula obviously entaUs the definabllity of Dr in R r+ l, The lemma is thus proved,
(Et)
u)
J)1
As a corollary to the above lemma we obtain VU. (Scott - Myhill). The class D =U
t
Dr : rE-on}
is a model of ZF.
224
[97], 114
FOUNDA T10NAL STUDIES
Proof. In view of the lemma we can represent D as a union of sets D~ = Dh(r) which satisfy the condition D~ E D~+l'
As we re=
marked above, the sets D , and hence the sets D~, are predicatively x closed, transitive and form an inc reasing sequence. The condition
D~
=U {
~
: r( s}
is satisfied if s is a limit number since the su=
premum of an increasing sequence of critical numbers for the function f is itself a critical number for f.
Thus all assumption of theorem II
are satisfied in this case. If x € D,
then there is a smallest ordinal r = r
x
such that x
is definable in R , Among formulae which define x in R there is one, r r call it F , which occurs earliest in a standard enumeration of the x
set F'r m
which we must think of as fixed at the beginning of the pr whole proof, Thus we have a one-one mapping x ~ (r-x ' F xl of D into On x F'r-m a set
, It is not difficult to show that this mapping restricted to pr a E D is itself and element of D. From this we infer VIII. Axiom of choice is valid in D, It is obvious that L~' D
D
c;,
V; none of the equation L
V can be proved or disproved in ZF,
D,
[97], 115 Lecture
225
MODELS OF SET THEOR Y
IV
-------~--
This lecture will be based on axioms
of M but will be devoted
to models of ZF. We shall introduce the notion of height and width of a model and shall compare various models
as to their height and width.
By a model of ZF we mean in this lecture a transitive set of sets in which all axiom of ZF are true. It is obvious that the class of models of ZF can be defined by a predicative formula. Instead of transitive
families of
sets we could equally well
use arbitrary well founded relations. This results from the following lemma provable in ZF. I ("contraction lemma"). If R is a well founded relation which satisfies the condition (u = v)
:=. (t}«tRu,):=(tRv))
for arbitrary u, relation €
v in. the field of R, then R is isomorphic with the
in a transitive family of sets. The proof of this lemma is easy and will not be given here. The existence of models follows from the Scott - Scarpellini
theorem; this theorem shows for instance that there are ordinals r , s such that L;< L, Ds-
-<
and R R. Hence there are models of ZF t D R t• r, s' The question arises: are there models of ZF of any given car=
of the form L
dinality? The answer results easily from the downwar-d Skolem - Lo= wenheim theorem: II.
For every ordinal r?cu there is a model of power Ir}
elementarily equivalent with L. Proof. We start with a set of power ) r
I'
e. g., with r
226
(971. 116
FOUNDATIONAL STUDIES
itself and consider an ordinal s (of any power) such that r C L For each F in Frm sequence f in a
pr Fr(F) -
with 0 c: Fr(Fl. each infinite set a EL
lo}
x in L s such that L s Po F
we denote by eF(f) the earliest element
[I <:'0, x> }v r]
or 0 if there is no "such
element. Furthermore we put a' : {eF(f) : (F€Frm (f
e aFr(F) - L OJ
s
-<
L. s and each
pr
) & (OEFr(F)) &
)}.
It is· obvious that a ~a' (consider the formula
that a and a' have the same power (Frm
X
o:
xl!)
and
is denumerable and fran:
pr ges over the set of all finite sequences with terms in a ). Now we form
where a = rand a + : a~; it is obvious that the O n n l power of a is ,r I and that a-< L. Finally we apply the contraction lem=
the union a : Ua
ma 1 to obtain the desired transitive set. A theorem simOar to II can be proved for the class
D and
generally for every class which can be proved to be well orderable. There are other proofs of the Skolem-LCSwenheim theorem which allow us to prove the" existence of denumerable models which are ele= mentarily equivalent wfth any given model whether well orderable or not.
In.
For any model of ZF there exists an elementarily equtva>
lent denumerable model. Proof. Let m be the given model. We shall say that a for= mula
FE Frm
nal if the set
with exactly one free variable X describes an ordi= pr o SF(m,[
property we consider a costant OF; moreover we consider denumerably many constants c ' j = 0, I, 2, ••• These constants are added to the j
language of ZF; the formulas of the extended language are obtained from the formulae of the old language (i. e, , essentially from the elements of Frm
pr
) by substituting constants for some or all free variables of
(97). 117
MODELS OF SET THEOR Y
227
the formulae. Let T be the set fFEFrm : (Fr(F) 0) & (mFF)}; We may pr call T "the theory of m", Now we denote by T* the set of aentencea 0
of the extended language which can be derived from T and the following sentences:
t
-,(c, c where j k) 1 which describes an ordinal. 0
k,
(x
o)
[(XO'"0F)~FJ
where F is a formula
We claim that if F is a formula (of the extended language) with Fr(F)
0
(* *): (x
lo~, then (_): (XO)F(Xo)ET*:(j)w(F(C [ On(Xo)_F(Xol] E
o) In the formula
(lI' *)
T*:=(G)~(oG)
GT;lf.l. j) ,,-T'''];
the letter 'G' ranges over formulae (of the primitive
language) which describe ordinals. The implications from left to right in both (.,.:.) and ,*.,11.) are obvious. The converse implication in the case (*) can be proved by not!cing that all the steps in a deduction of F(ci) from T can be repeated when c is replaced by a variable not occurring in the given deduction. j The implication fr-om right to left in l.>l*) can be proved as Iol> lows. Write F(OG) as F'(OG, c
.. , c where F' is a formula of the n) l' primitive language. The constants Ox different from 0G can obviously be eliminated by replacing then by terms
1x: XJ which
in turn can be
eliminated because of their deflnability in the primitive language. For simplicity we assume that the variables \ . i = I, in F'. We denote by F" the formula F'(X conjunction of formulae ,(x
p
0
O
'
2, ... , n do not appear
x:" .. , x
x ) where l:!i p < q ~ n.
n)
and ':>y K the
q
Using the deduction theor-em we can show that from a proof of the formula F'(OG' c 1'···, c n' from the assumption T we can obtain a pr ocr of (i)
(x )(x
o
I)
... (x )
n
L'~x 0 =
. F oo] °G ) & K -..,..
228
(97), 118
FOUNDA T10NAL STUDIES
from the same assumption. To see this it is sufficient to replace in the given proof all the constants Co by new variables and prefix J each formula which appears in the proof with the conjunction of ine= = x ) where p f q and x and x range over the varia= p q p q bles which were used to replace the constants Co, J It follows now that for each formula G which describes an
qualities, (x
ordinal the formula (of the primitive language)
r
•• (x ((t) (t e xo)=:: Gltl] & l)· n) is true in m and hence belongs to T. (xO)(x
We choose for G the formula GO which describes the follo= wing ordinal r: if there is an ordinal s such that ml-(Exl)•.• (Exn)K
&"F"[{
then r = sO+1 where
So
is the
least such ordinal; otherwise r = O. The formula GO can be written expliciteIy: (Ey) {(EX
O)
[ton(x
o)
& K & IF" & (v)I (VE: xo) -+ (xO)(x
I)
••• (x
n)
[
& K-+-F"JD & (YExO+li] & (y = x
o)}. (The formula Ins ide square brackets has the free variable 'y'; since we must insist that the free variable should be 'x we had to add the O' outer quantifier (Ey) and the equation (y = xo) at the end in order to have the free variable xO). The formula (i) with G replaced by GO is thus provable. Since this formula implies the formula (x
O)
[on(x
o)
~
(xl)' •• (xn)(K ......
F"il . we
obtain the left hand side of
(-if* ).
In the further course of the proof we use ideas which lie the proof of the completeness theorem. We
under=
consider the Boolean
229
MODELS OF SET THEOR Y
(97), 119
algebra of formulae of the extended language and denote by B the quotient algebra obtained by the division by the filter T"'*. The for= -It
mulae ("*) and (ll".) prove that the element (Exo)F IT
is the Boolean
join of the element F(c.) IT*' and the element (Ex [on(x & F] is o) O) J ~ the Boolean join of the element F(OG)/T By the Rasiowa - Sikorski lemma there is a maximal filter
T*.j!o::> T"" ~c,
which preserves these joins. We define a relational system
R> where C is the set of all the constants
tion which holds between c
and c
c. and R is the rela=
J if and only if the formula cjE c
k j k is an element of T"*"*. It is well known that all sentences of T*'" and hence those of T are true in this relational system. We now prove that the relation R is well founded. Let us denote by H the formula which defines the relation "r is the rank of x~ Formally we (Ex
2)(Ex 3
-
)
f B(x O' x 2 ' x 3 )
express H as follows:
& (Xl S; x ) & (y)(z)(t) [(YE x
3
o)
& B(y, z , t)
-; (Xl S t)]}
where B is the formula defined on p. H(v, x)-.+ On(v).
The formulae
111
(x)(E! v) Htv, x) ,
(x e-y) & H(v,x)& H(w,y)-+(v €ow) are provable in ZF. It follows that for every
the formula
(Ev) [Hlv,c ) & Only)] j
belongs to T**" and hence there is a formula G. which describes an J
ordinal and which has the properties that the formulae H(OG ,c.) and j J
belong to T-II-'! Let r
j
be the ordinal described by G
j
and let j, k be such
[97], 120
FOUNDA T10NAL STUDIES
230 that cjRc
k• In order to prove that R is well founded it will be sufficient to pro· m ~x:ek~fx:e
ve that r j < r k' Assume the contrary. It follows that and hence the formula
0e
sible because the formula
"c.
ill in T
f~44i") J
clearly
~
oJ#.
l
• This however is impas=
impl~es
that ,lOe
k
~
0e ) j
belongs to T"** The well use theorem
foundedneSIl of the relation R being established we may and obtain the desired model.
The above proof does not work in the non denumerable case because no analogue of the Rasiowa - Sikorski lemma is then available. Definition. We call a height of a model m the least ordinal not in m; we say that a model m
l
is broader than m
2
at the level r
::> m 2 f'\ R r t r Example. The natural models have the largest possible breadth
where r is an ordinal if m AR
The first remark is obvious and the second follows from the existence of the formula F alluded to in theorem VI of lecture ilL It follows from the properties of this formula that whenever m is a ....min model and r E. Onl) m, then (.,; € m, Hence if h is the height of m, ....min r min then (.,;h ~ m; it can be shown that C • L h h• IV (Cohen - Shepherdson). There is a minimal model (1. e .• one which is contained in any model). Thill follows from the example above. The minimal model is equal to the first L r which is a model of ZF. V. If m is a model, then so is m t'\L. We omit the detailed proof of this theorem. Essentially it can be established as follows: The proof that L is a model of ZF
is based
MODELS OF SET THEOR Y
[97),121
231
on the fact that all axiom of ZF are valid in the universe. Relativi s sing this proof to m we obtain that all these axioms are valid in the domain of constructibfe elements of m, In view of the example above this domain is m ()L. Theorem V shows that the height of an arbitrary model is at the sam" time the height of
a constructible model. The converse is
not true. E. g.• the height of a natural model is always non - denumerable because every such model contains non denumerable well orde= rings and each such ordering is similar to an ordinal which belongs to the model. On the other hand there are denumerable constructible models. In lectureVII we shall construct examples of denumerable models of equal heights but of different breadths. Such models are of paras mount importance for various Independence proofs. Their existence can best be established by means of the notion of forcing introduced by Cohen. However we shall not deal with this notion here. Instead we shall discuss another problem which is rrarch more special but interesting and, as we shall see, far from trivial.
I'
" ...
We put L'* = LrAR + w l' It is obvious that L I' £L s for I' .. E>s € On and hence there is a smallest ordinal c such that L is I'
constant from c on. We want estimate the size of c. We note in passing that the same problem can also be for s mulated for the families L I'' " R k are not interesting because L I'
= G) on
if
k
r
where "
R
n
k >VJ+I. Smaller values of
is certainly constant from
n ~"".
Estimates of c from below. Let us call a model m ecnstr-uctt> ble if there is an ordinal
I'
such that L
r
= m; the ordinal
I'
is called
232
[97J, 122
FOUNDA T10NAL STUDIES
the index of m, It can be shown that the index of a constructible m o> del is equal to its height. VI.
e is grea.ter than the index of the minimal model.
Proof. Let the index of the minimal model be i and the index of the next model in the sequence Lx be j. Then the sentence 'there is a constructible
model of ZF'
is true in L .• Since the Skolem-Lowenheim theorem is provable in J ZF (cr. the proof of theorem III above) we infer that the sentence 'there is a denumerable constructible model of ZF' is true in L.. Hence there is a set x in L. which satisfies in L. the J J J formula 'x is a denumerable model of ZF'. Such a set must be a mo del of ZF because the relation of satisfaction and the class of axioms of ZF are absolutely definable. Since L
contain just one model of ZF, j to this unique model 1. e., to L Hence Lj contains
x must be equal
r
onto eo> and is one-one. Since each ordinal i < i is an element of L. we infer that i is denumerable in L. and 1 J hence there is a set X of integers such that X E L and the relation j <: m , n;> : 2 m(2n - I) Eo X is of the order type I. It follows that a function which maps L
I
X E L~ J
but
X
tf.
1
L* because otherwise i would be an element of i, i In order to obtain a stronger estimate for c we introduce
the Definition. A positive ordinal r is called L-definable if there is a predicative formula F with Fr(F) ; to} such that whenever r € L s and L
is a model of ZF, then r is the unique element of L such s s that L while 0 is a unique such element if r Ls sI=F[{c:::.o.x>l] and L
ri
s
is a model
bility which we
of ZF (compare a similar notion of R - derma>
introduced in lecture II).
[97], 123
233
MODELS OF SET THEOR Y
VII. Uris L - definable and L
s quence of the constructible models, then
is the r-th term of the se= c:7 a,
Proof. Let F be a formula which L - defines r and let L and i L. be the r + 1st and r+2 nd terms of the transfinite sequence which J contains all constructible models. We consider the following sentence H: (ExO)(Ez)(x
O
t-
0) & On(x
o)
o">1J>
& (XOE xl) &. (z Eo xl) & (XIF= F [{ < 0, X
l
& Fn(z) & (Dom(z) = x &. (t)(u) «t, u > E z) + (u is a constructi= O) ble model of ZF) & (v)(w) [Jkv,w>€z) & (t e v) ~ (WE:ul}t) •
II "says" that xl contains a sequence of constructible mo= dels of ZF ordered in type r by t he relation E. Of course the for= malization of H given above is not complete: expre ssions 'is a con= struetible model', 'Fn(z)' etc. have to be written exclusively in terms of the primitive notions of ZF. Such a complete formalization of H is easily
obtainable.
Since reL E:-L and the sequence~<x,L? : xE r} be-longs i j we easily see that L (Ex [(xl is a model of ZF) & HJ l) j i We now use the Skolem-Lowenheim theorem which as we know is
1==
to L
provable in ZF and hence valid in L.. We obtain the result that L. J J contains an element y which is denumerable in L. (t, e; , a mapping J of y onto integers exists in L.l and which has the property that the J formula 'Xl is a constructible model of ZF' & H is satisfied in L by j
y (more exactly: by the sequence ~<1, y >}). It follows tha t y is a con= structible model of ZF, Y = L for some t, Hence j >t. Since L sa= t t tisfies H in L. we infer using the definition of L - definability that J L contains as element a sequence of type r of constructible models t of ZF. Hence t~i. From the
inequalities j
>t~..i
it
obviously follows that
234
(97), 124
FOUNDA T10NAL STUDIES
t = i.
Hence L
is denumerable in L and therefore the same is i j true of r , Now the proof can be brought to an end in the same way
as in VI. The notion of L - definabUity
is closely connected with the
notion of strong definability which was discussed in a paper by the present writer. It follows from the result of this papej- that L - de= finable or6inals are
<: WI' Thus
not strongly definable, then tions of c from
c~
r,
if r is the first ordinal which is Most probably still stronger evalua=
below are possible,
Estimate of c from above. We shalt show that c ~ WI' The proof is based on a device invented by
Godel in his proof that the
continuum hypothesis is valid in the model L, VIII. (Godel's lemma). If xs;.R~ and xE,L. then xE-L WI' Proal. Let r be such that x E' L rand L r is a model of ZF. We consider the relational system the Skolem-Lowenheim that m is
€>,
By an
application of
theorem we obtain a structure <m,
6>
such
denumerable, x and RGo) belong to m and <m,6>«L
r.
E> •
From theorem VI of lecture III we know that there exists a formula
e Frm pr with two free variables x o• Xl such that for an arbitrary model N of ZF and every ordinal s in On('\N, and every u E N
F
N
1= (E!xI)F H
s>1] .
N!=F[i
r,
e>:
y
is evidently true in the structure
(x [Ord(x ) & (Ex I ) F & (x E: Xl) (i) 2)(Ex O) o 2 Hence this sentence is true in the structu re
infer that for every y in m there is an
5'
and an x' such that s' and
MODELS OF SET THEOR Y
(97], 125 x ' belong to m mFOrd
235
and
[{~o,sl.>l] ;mt= F
n
x',
The element s I is not necessarily an ordinal since m is not necessarily transitive; similary x' need not be equal to an Lv' transitive set m II- we obtain a model of ZF;
Contracting m to a the element s' and
X'
are contracted to elements s* and x ~ which sa:
tisfy formulae similar to those above but with m It follows that s
replaced by m ~ •
-+ ' Hence YE:Ls* and thes = Lt' The ordinal t is denumerable
is an ordinal and x It: L
On}
refore m