4 7 1 r e v i s i o n : 1 9 9 3 0 8 2 3 m o d i f i e d : 1 9 9 3 - 0 8 2 3 PEANO ARITHMETIC MA Y NOT BE INTERPRETABLE IN THE MONADIC THEORY OF ORDER BY SHMUEL LIFSCHES and SAHARON SHELAH* Institute of Mathematics, The Hebrew University of Jerusalem, Jerusalem, IsraelABSTRACT Gurevich and Shelah have shown that Peano Arithmetic cannot be interpreted in the monadic sec ond -or der theo ry of short chains (he nce, in the monadic sec ond - order theory of the real line). We will show here that it is consistent that there is no interpretation even in the monadic second-order theory of all chains. 0. Introduction A reduction of a theory Tto a theory T∗ is an algorithm, associating a sentence ϕ ∗ in the language ofT∗ , to each sentence ϕ in the language ofT, in such a way that: Tϕ ifand only ifT∗ ϕ ∗ . Although reduction is a pow erf ul method of pro ving undecidability results, it lacks in establishing any semantic relation between the theories. A (semantic) interpretation of a theory Tin a theory Tis a special case of reduction in which models ofTare defined inside models ofT. It is known (via reduction) that the monadic theory of order and the monadic theory of the real line are complicated at least as Peano Arithmetic, (In [Sh] this was proven from ZFC+MA and in [GuSh1] from ZFC), and even as second order logic ([GuSh2], [Sh1 ], for the monadi c the ory of order). Mor eo ve r, second order logic was sho wn to be interpretable in the monadic theory of order ([GuSh3]) but this was done by using a wea ker, non–sta ndard form of interpret ation: into a Boolean valued model. Using standa rd * The second author would like to thank the U.S.–Israel Binatio nal Science F oundati on for partially supporting this research. Publ. 471 1
29
Embed
Shmuel Lifsches and Saharon Shelah- Peano Arithmetic May Not Be Interpretable In The Monadic Theory of Order
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
8/3/2019 Shmuel Lifsches and Saharon Shelah- Peano Arithmetic May Not Be Interpretable In The Monadic Theory of Order
Institute of Mathematics, The Hebrew University of Jerusalem, Jerusalem, Israel
ABSTRACT
Gurevich and Shelah have shown that Peano Arithmetic cannot be interpreted in
the monadic second-order theory of short chains (hence, in the monadic second-
order theory of the real line). We will show here that it is consistent that there is no
interpretation even in the monadic second-order theory of all chains.
0. Introduction
A reduction of a theory T to a theory T ∗ is an algorithm, associating a sentence ϕ∗ in
the language of T ∗, to each sentence ϕ in the language of T , in such a way that: T ϕ if
and only if T ∗ ϕ∗.
Although reduction is a powerful method of proving undecidability results, it lacks in
establishing any semantic relation between the theories.
A (semantic) interpretation of a theory T in a theory T is a special case of reduction in
which models of T are defined inside models of T .
It is known (via reduction) that the monadic theory of order and the monadic theory
of the real line are complicated at least as Peano Arithmetic, (In [Sh] this was provenfrom ZFC+MA and in [GuSh1] from ZFC), and even as second order logic ([GuSh2],
[Sh1], for the monadic theory of order). Moreover, second order logic was shown to be
interpretable in the monadic theory of order ([GuSh3]) but this was done by using a
weaker, non–standard form of interpretation: into a Boolean valued model. Using standard
* The second author would like to thank the U.S.–Israel Binational Science Foundation
for partially supporting this research. Publ. 471
1
8/3/2019 Shmuel Lifsches and Saharon Shelah- Peano Arithmetic May Not Be Interpretable In The Monadic Theory of Order
nonequivalent subsets. We fix a partition of C and after some manipulations we are left
with 3 ordered pairs of nonequivalent subsets of C . We shuffle each pair U, V with respect
to a generic semi–club a, added by the forcing, and get a new subset which is equivalent to
U . (This uses the preservation of partial theories undershufflings). But a condition p ∈ P
that forces these equivalences determines only a bounded subset of a. We show that wecould have got the same results if we had shuffled the pairs with respect to the complement
of a. Thus for each pair U, V , p forces that the ‘inverse’ shuffling is also equivalent to U .
We conclude by showing that one of the shufflings is equivalent to V as well, and get a
contradiction since U and V were not equivalent.
1. The notion of interpretation
The notion of semantic interpretation of a theory T in a theory T
is not uniform.Usually it means that models of T are defined inside models of T but the definitions vary
with context. Here we will define the notion of interpretation of one first order theory in
another following the definitions and notatins of [GuSh].
Remark. The idea of our definition is that in every model of T (or maybe of some
extension T if T is not complete) we can define a model of T . An alternative definition
could demand that every model of T is interpretable in a model of T (As in [BaSh]).
Actually we need a weaker notion than the one we define and this seems to follow from
every reasonable definition of semantic interpretation. We will show that it is consistentthat no chain C interprets Peano arithmetic. We even allow parameters from C in the
interpreting formulas. Thus, our notion is: “A model of T defines (with parameters) a
model of T ”. We call this notion “Weak Interpretation”
Definition 1.1. Let σ be a signature P1, P2, . . . where each Pi is a predicate symbol of
some arity ri, in the language L = L(σ). An interpretation of σ in a first order language
L is a sequence
I = d, U (v1, u), E (v1, v2, u), P 1(v1, . . . vr1 , u), P 2(v1, . . . vr2 , u), . . . where:
(a) d is a positive integer (the dimension);
(b) U (v1, u) and E (v1, v2, u) are L-formulas (the universe and the equality formulas );
(c) each P i (v1, . . . vri , u) is an L-formula (the interpretation of P i);
(d) v1, v2 . . . are disjoint d-tuples of distinct variables of L;
(e) u is a finite sequence (standing for the parameters of the interpretation).
Definition 1.2. Let σ, L and I be as in 1.1. Fix a function that associates each L
variable v with a d-tuple v of distinct L variables in such a way that if u and v are
different L-variables then the tuples u and v are disjoint.
3
8/3/2019 Shmuel Lifsches and Saharon Shelah- Peano Arithmetic May Not Be Interpretable In The Monadic Theory of Order
Remark. We could have chosen J to be all λ. The definitions and the results do not
depend on the particular choice of J .
♥Definition 2.11*. AT hn(β i, (C, A)) for β i ∈ J ∗ is: T hn(C, A)|[βi,γ)) for every γ ∈ J ∗∗
γ > β i, cf (γ ) = ω; Where J ∗∗ is from Lemma 2.10*. (Actually this is si from notation
2.17).
Remark. Again, fixing J ∗ and h it is easily seen that the definition does not depend on
the choice of J ∗∗.
Definition 2.13*. Let cf (C ) > ω, M = (C, A) and we define the model gn(M ) =
C, gn(A).
Let:
gn(A)s = {αi < λ : s = AT hn(β i, (C, A)), β i ∈ J ∗, h(β i) = αi} (so this is a subset
of λ).
let d = l(A) and T (n, d) := the set of formally possible T hn(M, B), where l(B) = d.
We define a finite sequence of subsets of λ:
gn(A) := . . . ,
gn(A)s
, . . .s∈T (n,d)
Lemma 2.14*. The analogs of lemma 2.14 hold for gn(C, A)
Theorem 2.15*. If cf (C ) > ω, then for each n there is an m = m(n) such that if:
t0 = T hm(C, A)|β0 , t1 = W T hmC, gm(C, A), t2 = AT hmβ 0, (C, A)then we can effectively compute T hn(C, A) from t0, t1, t2. (If C has a first element
δ, set β 0 = δ and we don’t need t0).
Remark. Following our notations, T hn(C, A) is equal to t0 +
i<λ si. By 2.10* we get
for example (if J ∗ = J ∗∗ from 2.10):
i≤k<j si = si for cf ( j) ≤ ω .
What we say in 2.13* is that if we know t0 and s0 and we know, roughly speaking, ‘how
many’ theories of every kind appear in the sum (this information is given by t1), then we
can compute the sum of the theories exactly as in the case of well ordered chains.
10
8/3/2019 Shmuel Lifsches and Saharon Shelah- Peano Arithmetic May Not Be Interpretable In The Monadic Theory of Order
Proof. By Prop. 3.3. (and note that T has only infinite models so C has an infinite
number of E -equivalence classes).
♥
Definition 3.6. An initial (final) segment D is called a minimal major segment if D is
major and for every initial (final) segment D ⊂ D, D is minor.
Lemma 3.7. There is a chain C ∗ that interprets T and an initial segment D ⊆ C ∗
(possibly D = C ∗) such that D is a minimal major segment.
Proof. (By [GuSh] lemma 8.2). Let L be the union of all the minor initial segments
(note that if L is minor and L ⊆ L then L is minor). If L is major then set L = D and we
are done. Otherwise, let D = C − L, and by conclusion 3.5 D is major. If there is a final
segment D ⊆ D which is major then C − D is minor. But, C − D ⊃ L, a contradiction.
So D is a minimal major (final) segment. Now take C INV to be the inverse chain of C . By
virtue of symmetry C INV interprets T and D is a minimal major initial segment of C INV.
♥
Notation. Let D ⊆ C be the minimal major initial segment we found in the previous
lemma.
Discussion. It is clear that D is definable in C . (It’s the shortest initial segment such
that there at most N 1 nonequivalent elements coinciding outside it). What about cf (D)?
It’s easy to see that D does not have a last point. On the other hand, it was proven in
[GuSh] that T is not interpretable in the monadic theory of short chains (where a chainC is short if every well ordered subchain of C or C INV is countable). But we don’t need
to assume that the interpreting chain is short in order to apply [GuSh]’s argument. All
we have to assume, to get a contradiction is that cf (D) = ω (which is of course the only
possible case when C is short). So, if C interprets T and cf (D) = ω, we can repeat the
argument from [GuSh] to get a contradiction. Therefore, we can conclude:
Proposition 3.9. cf (D) > ω
♥
Notation 3.10. T k will denote the theory of a family of k sets and the codings of everysubfamily.
Discussion (continued). Now, fix an element R ⊆ (C − D) witnessing the fact that D
is major, and define:
S = { A ⊆ C : A ∩ (C − D) = R }
So S/∼ is infinite by the choice of R (and of course definable in C with an additional
parameter R). For the moment let k = 2 and fix a finite subset of 6 nonequivalent
13
8/3/2019 Shmuel Lifsches and Saharon Shelah- Peano Arithmetic May Not Be Interpretable In The Monadic Theory of Order
elements in S , A1, A1 . . . A6. We want to define in D a structure that contains 2 ‘atoms’
and 4 codings by using the Ai’s.
Since M |= T we have an element W ⊆ C (not necessarily in S ) which can be identified
with the set:{A1}, {A2}, {{A3}}, {{A4, A1}}, {{A5, A2}}, {{A6, A1}{A6, A2}}
.
Look at the following formulas:
Atom(X, W ) := P ({X }, W )
Set(Y , W ) := ¬Atom(Y , W ) & ∃Z ∃V (P (Z, W )&P (V , Z )&(P (Y , V ))
Code(X, Y , W ) := Atom(X, W ) & Set(Y , W ) & (∃Z (P (Z, W )&P ({X, Y }, Z ))
Using these formulas we can easily define in C a structure which satisfies T 2, where A1
and A2 are the atoms A3 codes the empty subfamily, A4 codes A1 etc. But for every
natural number k we can define a structure for T k by picking k + 2k elements from S and
a suitable W , and note that the above formulas do not depend on k.
Now we claim that we can interpret T k even in D and not in all C . To see that,
look at the formula Code(X, Y , W ). There is an n < ω such that we can decide from
T hn(C, X, Y , W , R) if Code(X, Y , W ) holds. By the composition theorem it suffices to
look at T hn(D, X ∩ D, Y ∩ D, W ∩ D, R ∩ D) and T hn(C − D, X ∩ (C − D), Y ∩ (C −
D), W ∩ (C − D), R ∩ (C − D)). But, since we restrict ourselves only to elements in S , the
second theory is constant for every X, Y in S . It is: T hn(C − D, R, R, W ∩ (C − D), R).
So it suffices to know only T hn(D, X ∩ D, Y ∩ D, W ∩ D), (R ∩ D = ∅). Now use Lemma
2.4 to get a formula Code*(X, Y , W ∩ D) that implies Code(X ∪ R, Y ∪ R, W ), and the
same holds for the other formulas (including the equality formula for members of S ).We get an interpretation of T k on D with an additional parameter W . Remember
that we allowed parameters V in the original interpretation of T in C and we can assume
that W is a sequence that contains the coding set and the old parameters (all intersected
with D).
The universe formula of the interpretation is Atom*(X, W ) ∨ Set*(X, Y , W ), the coding
formula is Code*(X, Y , W ) and the equality formula is E ∗(X, Y , W ). And for different k’s
and even different choices of members of S , the formulas (and their quantifier depth) are
unchanged except for the parameters W .
It is easy to see that, since D is minimal major, for every proper initial segment D ⊂ D
there are no more then N 1 (from definition 3.4) E ∗ nonequivalent members of S coinciding
outside D. We will say, by abuse of definition, that D is still a minimal major initial
segment with respect to E ∗. To sum up, we have proven:
Theorem 3.11. If there is an interpretation of T in the monadic theory of a chain C
then, there is a chain D such that cf (D) > ω, and such that for every k < ω there is
an interpretation of T k in the monadic theory of D such that the interpretation does not
14
8/3/2019 Shmuel Lifsches and Saharon Shelah- Peano Arithmetic May Not Be Interpretable In The Monadic Theory of Order
Definition 4.3. Let P 0, P 1 ⊆ δ be of the same length and J ⊆ δ be a club. We will say
that J is n-suitable for P 0, P 1 if the following hold:
a) J witnesses AT h(δ, P l) for l = 0, 1.
b) J = {αi : i < λ}, α0 = 0 and cf (αi+1) = ω.
c) J ∩ gn(P l)s ∩ S δ0 is either a stationary subset of δ or is empty.When n ≥ 1 and W An(δ, P 0) = W An(δ, P 1) (see notation 2.15) we require also that:
d) If αj ∈ J cf (αj) ≤ ω and sl(αj) = s then there are k1, k2 < ω such that sl(αj+k1) =
s, and s1−l(αj+k2) = s.
Remark. It is easy to see that for every finite sequence
P 0, P 1, . . . , P n ⊆ δ with equal lengths, there is a club J ⊆ δ which is n-suitable for
every pair of the P i’s.
We will show now that AT h is preserved under ‘suitable’ shufflings.
Theorem 4.5. Suppose that P 0, P 1 ⊆ δ are of the same length, n ≥ 1 and W An(δ, P 0) =
W An(δ, P 1). (In particular, AT hn(0, (δ, P 0)) = AT hn(0, (δ, P 1)) := t). Let J ⊂ δ be n-
suitable for P 0, P 1 of order type λ and a ⊆ λ a semi–club. Then, AT hn(0, (δ, [P 0, P 1]J a )) = t
Proof. Denote X := [P 0, P 1]J a .
We will prove the following facts by induction on 0 < j < λ:
(∗) For every i < j < λ with cf ( j) ≤ ω:
i ∈ a ⇒ T hn([αi, αj), X ) = T hn([αi, αj), P 0) = s0(αi).
i ∈ a ⇒ T hn([αi, αj), X ) = T hn([αi, αj), P 1) = s1(αi).
(∗∗) For every i < j < λ with cf ( j) > ω:
i, j ∈ a ⇒ T hn([αi, αj), X ) = T hn([αi, αj), P 0).
i, j ∈ a ⇒ T hn([αi, αj), X ) = T hn([αi, αj), P 1).
In particular, by choosing i = 0 we get (remember α0 = 0), T hn([0, αj), X ) = t whenever
cf (αj) = ω.
j = 1 (so i = 0): Let l = 0 if i ∈ a and l = 1 if i ∈ a. So X ∩ [0, αj) = P l ∩ [0, αj) and so
T hn([0, αj), X ) = T hn([0, αj), P l) = t
j = k + 1 < ω: There are 4 cases. Let us check for example the case i ∈ a, j − 1 = k ∈ a.
By the composition theorem (2.7) and the induction hypothesis we have:T hn([αi, αj), X ) = T hn([αi, αk), X ) + T hn([αk, αk+1), X ) = s0(αi) + T hn([αk, αj), P 1)
= s0(αi) + s1(αk). So we have to prove s0(αi) + s1(αk) = s0(αi).
Since J is n-suitable there is an m < ω such that s0(αi+m) = s1(αk) and so,
s0(αi) = T hn([αi, αi+m+1), P 0) = T hn([αi, αi+m), P 0) + T hn([αi+m, αi+m+1), P 0) =
s0(αi) + s0(αi+m) = s0(αi) + s1(αk).
So s0(αi) + s1(αk) = s0(αi) as required.
The other cases are proven similarilly.
16
8/3/2019 Shmuel Lifsches and Saharon Shelah- Peano Arithmetic May Not Be Interpretable In The Monadic Theory of Order
Proof. The first statement follows directly from 4.5 and 4.10.
For the second, by the definition of a − W A, and by 4.8(0), 4.9, equality of a − W Am(n)
implies equality of W Am(n) from definition 2.16. But by 2.15 this implies the equality of
T hn.
♥
5. Formal shufflings
In the previous section we showed how to shuffle subsets of well ordered chains and
preserve their theories. Here we present the notion of formal shufflings in order to overcome
two difficulties:
1. It could happen that the interpreting chain is of cofinality λ but of a larger cardinality.Still, we want to shuffle objects of cardinality ≤ λ. The reason for that is that the con-
tradiction we want to reach depends on shufflings of elements along a generic semi–club
added by the forcing, and a semi–club of cardinality λ will be generic only with respect to
objects of cardinality ≤ λ. So we want to show now that we can shuffle theories, rather
than subsets of our given chain.
2. We want to generalize the previous results, which were proven for well ordered chains,
to the case of a general chain.
Discussion. Suppose we are given a chain C and a finite sequence of subsets¯
A ⊆ C and we want to compute T hn(C, A). As before we can choose an n-suitable club J = αi :
i < λ witnessing AT hn(C, A) and letting si := T hn(C, A)|[αi,αi+1) we have: T hn(C, A) =i<λ si. Theorem 2.15 says that (for a large enough m = m(n) ) W Am(C, A) which is
s0 and W T hm(λ, gn(C, A)), determines T hn(C, A). ( gn(C, A) is a sequence of subsets of
λ of the form gs = {i : si = s} ).
Moreover, since we have only finitely many possibilities for W Am(C, A), we can decide
whether
i<λ si = t inside H (λ+) := {x : x is hereditarilly of cardinality smaller than
λ+} even if the si’s are theories of objects of cardinality greater than λ. This motivates
our next definitions:
Definition 5.1. fix an l < ω
1) S = si : i < λ is an n-formally possible set of theories if each si is a formally possible
member of {T hn(D, B) : D is a chain, B ⊆ D, lg(B) = l}, and for every i < j < λ
with cf ( j) ≤ ω we have si =i≤k<j sk.
2) The n-formally possible set of theories S is realized in a model N if there are J,C, A
as usual in N , and si := T hn(C, A)|[αi,αi+1).
20
8/3/2019 Shmuel Lifsches and Saharon Shelah- Peano Arithmetic May Not Be Interpretable In The Monadic Theory of Order
a subset of α (or λ), is a semi–club. The order is inclusion. (So SC λ adds a generic
semi–club to λ).
2) Qλ will be an iteration of the forcing SC λ with length λ+ and with support ≤ λ.3) P := P µ, Q
∼µ: µ a cardinal > ℵ0 where Q∼µ is forced to be Qµ if µ is regular, other-
wise it is ∅. The support of P is sets: each condition in P is a function from the class
of cardinals to names of conditions where the names are non-trivial only for a set of
cardinals.
4) P <λ, P >λ, P ≤λ are defined naturally. For example P <λ is P µ, Q∼µ: ℵ0 < µ < λ.
Remark 6.2. Note that (if G.C.H holds) Qλ and P ≥λ do not add subsets of λ with
cardinality < λ. Hence, P does not collapse cardinals and does not change cofinalities, so
V and V P have the same regular cardinals. Moreover, for a regular λ > ℵ0 we can splitthe forcing into 3 parts, P = P 0 ∗ P 1 ∗ P 2 where P 0 is P <λ, P 1 is a P 0-name of the forcing
Qλ and P 2 is a P 0 ∗ P 1-name of the forcing P >λ such that V P and V P 0∗P 1 have the same
H (λ+).
In the next section, when we restrict ourselves to H (λ+) it will suffice to look only in
V P 0∗P 1 .
7. The contradiction
Collecting the results from the previous sections we will reach a contradiction from
the assumption that there is, in V P , an interpretation of T in the monadic theory of a
chain C . For the moment we will assume that the minimal major initial segment D is
regular (i.e. isomorphic to a regular cardinal), later we will dispose of this by using formal
shufflings. So we may assume the following:
Assumptions.
1. C ∈ V P interprets T by d, U C (X, V ), E C (X, Y , V ), P (X, Y , V ).
2. D = λ is a minimal major initial segment of C , cf (λ) = λ > ω.3. R ⊆ (C − D) and S := {A ⊆ C : A ∩ (C − D) = R} contains an infinite number of
nonequivalent representatives of E C -equivalence classes.
4. There are formulas U (X, Z ), E (X, Y , Z ), Atom(X, Z ),Set(Y , Z ) and Code(X, Y , Z ) in
the language of the monadic theory of order such that for every k < ω there is a sequence
W ⊆ D such that
I = d, U (X, W ), E (X, Y , W ), Atom(X, W ),Set(Y , W ),Code(X, Y , W )
22
8/3/2019 Shmuel Lifsches and Saharon Shelah- Peano Arithmetic May Not Be Interpretable In The Monadic Theory of Order
5. There is an n < ω such that for every k and W as above, T hn(D, U i1 , U i2 , U i3 , W )
determines the truth value of all the interpreting formulas when we replace the variables
with elements from {U i1 , U i2 , U i3}.
6. m is such that for every U i1 , U i2 , U i3 , from W Am(D, U i1 , U i2 , U i3 , W ) we can computeT hn+d(D, U i1 , U i2 , U i3 , W ) and in particular, the truth value of the interpreting formulas.
7. Let N 1 :={T hn(C, X, Y , Z ) : C is a chain, X, Y , Z ⊆ C }
. Then (by proposition 3.3
and theorem 3.11), for every proper initial segment D ⊂ D there are less than N 1 E C
-nonequivalent (hence E -nonequivalent) elements, coinciding outside D.
Definition 7.1. The vicinity [X ] of an element X is the collection {Y : some element
Z ∼ Y coincides with X outside some proper (hence minor) initial segment of D }.
Lemma 7.2. Every vicinity [¯
X ] is the union of at most N 1 different equivalence classes.
Proof. See [GuSh] lemma 9.1.
♥
Next we use Ramsey theorem for definining the following functions.
Notation 7.3.
1. Given k < ω, let t(k) be such that for every sequence W ⊆ D of a prefixed length and
a ⊆ λ and for every sequences of elements Bi : i < t(k) and Bs : s ⊆ t(k) there are
subsequences s, s ⊆ t(k) with |s| ≥ k and s ⊆ s such that a−W Am(D, Bi, Bj , Bs, W )is constant for every i < j ∈ s.
2. Given k < ω, let h(k) be such that for every coloring of
(i,j,l) : i < j < l < h(k)
into 32 colors, there is a subset I of {0, 1, . . . , h(k) − 1} such that |I | > k and all the
triplets
(i,j,l) : i < j < l, i, j, l ∈ I
have the same color.
We are ready now to prove the main theorem:
Theorem 7.4. Assuming the above assumptions we reach a contradiction
Proof. The proof will be splitted into several steps.
STEP 1: Let K 1 := h(t(3N 1)) and K := h(t(2K 1 + 2N 1)). Let R ⊆ (C − D) be such
that S := {A ⊆ C : A ∩ (C − D) = R} contains an infinite number of nonequivalent
representatives. Choose sequences of nonequivalent elements from S , B := U i : i < K ,
and B1 := V s : s ⊆ {0, 1, . . . , K − 1} and an appropriate W ⊆ D and interpret T K on D
such that B is the family of “atoms” of the interpretation and B1 the family of “sets” of
the interpretation.
23
8/3/2019 Shmuel Lifsches and Saharon Shelah- Peano Arithmetic May Not Be Interpretable In The Monadic Theory of Order
STEP 2: Choose J := {αj : j < λ} ⊆ λ an (n + d)-suitable club witnessing AT hn+d for
every combination you can think of from the U i’s, the V s’s and W .
Now, everything mentioned happens in H (λ+)V P
and, using a previous remark and nota-
tions, it is the same thing as H (λ+)V P 0∗P 1
. P 1 is an iteration of length λ+ and it follows
that all the mentioned subsets of λ are added to H (λ+)V P 0∗P 1
after a proper initial seg-ment of the forcing which we denote by P 0 ∗ (P 1|β). So there is a semi–club a ⊆ λ in
H (λ+)V P 0∗P 1
which is added after all the mentioned sets, say at stage β of P 1.
STEP 3: We will begin now to shuffle the elements with respect to a and J . Let, for
i < j < K , k(i, j) := Min{k : [U i, U j]J a ∼ U k, or k = K }. By the definitions of h and K
there is a subset s ⊆ {0, 1, . . . , K − 1} of cardinality at least K 2 := t(2K 1 + 2N 1) such that
for every U i, U j, U l with i < j < l, i, j, l ∈ s the following five statements have the same
truth value:
k( j,k) = i, k(i, k) = j, k(i, j) = i, k(i, j) = j, k(i, j) = k. Moreover, by [GuSh] lemma10.2, if there is a pair i < j in s such that k(i, j) ∈ s then, either for every pair i < j in s,
k(i, j) = i or for every i < j in s, k(i, j) = j.
STEP 4: Let V s be the set that codes U i : i ∈ s. By the definitions of t and K 2, there
is a set s ⊆ s with at least K 3 := 2K 1 + 2N 1 elements and a sequence U i : i ∈ s such
that for every r < l in s, a − W Am(D, U r, U l, V s, W ) is constant.
It follows that for every r < l in s, a − W Am(D, U r, V s, W ) = a − W Am(D, U l, V s, W ),
and by the preservation theorem 4.12 they are equal to a −W Am(D, [U r, U l]J a , V s, W ). But
V s codes s so D |= Code(U r, V s, W ), and since we can decide from a − W Am
if Code holds,the equality of the theories implies that D |= Code([U r, U l]
J a , V s, W ). But by the definition
of Code there is k ∈ s such that [U r, U l]J a ∼ U k. So there are r, l in s with k(r, l) ∈ s and by
step 3 we can conclude that, without loss of generality, for every i < j in s, [U i, U j ]J a ∼ U i.
STEP 5: Note that if a is a semi–club then λ \ a is also a semi–club. We will use the
fact that a is generic with respect to the other sets for finding a pair i < j ∈ s such that
[U i, U j ]J λ\a ∼ U i holds as well. Let p ∈ P 0 ∗ P 1 be a condition that forces the value of all the
theories a − W Am(D, U r, U l, V s, W ) for r < l ∈ s. The condition p is a pair (q, r) where
q ∈ P 0 and r is a P 0-name of a function from λ
+
to conditions in the forcing SC λ. r(β ) isforced by p to be an initial segment of a of height γ < λ and w.l.o.g. we can assume that
γ = αj+1 ∈ J . (So cf (γ ) = ω). As γ < λ = D, γ is a minor segment. Remember that
|s| ≥ K 3 = 2K 1 + 2N 1 and define s ⊆ s to be
i ∈ s : |{ j ∈ s : j < i}| > N 1, and
|{ j ∈ s : j > i}| > N 1
. So |s| > K 1. Denote by AB the element (A∩γ )∪(B∩(D−γ )).
We claim that for every i,j,k in s, U k ∼ [U i, U j ]a U k.
To see that note that by the definition of s and the preservation theorem for AT h, p
forces: “T hn+d(D, [U i, U j ]a U k, V S, W ) =
24
8/3/2019 Shmuel Lifsches and Saharon Shelah- Peano Arithmetic May Not Be Interpretable In The Monadic Theory of Order
T hn+d(D, [U i, U j ]a, V S, W )|γ + T hn+d(D, U k, V S, W )|[γ,λ) =
(by γ ∈ J and the equality of the a-WA’s and the preservation theorem)
T hn+d(D, U i, V S, W )|γ + T hn+d(D, U k, V S, W )|[γ,λ) =
(by γ ∈ J and the equality of the ATh’s)
T hn+d(D, U i, V S, W )”.
Hence, since V s codes s, [U i, U j ]a U k ∼ U l for some l ∈ s. If l = k we are done so assume
w.l.o.g that l < k. Now U l ∈ [U k] and we will show that for every m < k, in s, U m ∈ [U k].
Contradiction follows from the choice of s and lemma 7.2 (1).
Now T hn+d(D, U m, [U i, U j ]a U k, W ) =
T hn+d(D, U m, [U i, U j ]a, W )|γ + T hn+d(D, U m, U k, W )|[γ,λ).
But AT hn+d(D, U m, W ) = AT hn+d(D, U l, W ). So there is Y ⊆ D such that
T hn(D, U m, Y , W )|γ = T hn(D, U l, [U i, U j ]a, W )|γ.
We get T hn(D, U m, Y U k, W ) = T hn(D, U l, [U i, U j]a U k, W ), and since [U i, U j ]a U k ∼
U l the equality of the theories implies: Y U k ∼ U m, so U m ∈ [U k].
But by 7.2 (1), |[U k]| ≤ N 1 and by the choice of s there are more than N 1 nonequivalent
U m’s with the same property and this is a contradiction.
So we have proven that it is possible to replace an initial segment of an element with
a shuffling of two other elements without changing it’s equivalence class. (Actually there
are |s| elements like that).
STEP 6: We are ready to prove that for every i < j in s, [U i, U j]a ∼ [U i, U j]λ\a
.
By step 4 p ||− [U i, U j]a ∼ U i (because it forces equality of theories for a large number of
elements). Remember that p ‘knows’ only an initial segment of a, namely only a ∩ ( j + 1)
where γ = αj+1. Since our forcing is homogeneous b :=
a ∩ [0, j + 1)
∪
(λ \ a) ∩ [ j + 1, λ)
is also generic for all the mentioned sets and parameters, and everything p forces for a it
forces for b. So p ||− “[U i, U j ]b ∼ U i .
Note that by the preservation theorem T hn(D, [U i, U j]λ\a, W )|γ = T hn(D, [U j, U i]a, W )|γ= T hn(D, [U i, U j]a, W )|γ = T hn(D, U i, W )|γ = T hn(D, U j, W )|γ.
It follows that T hn(D, [U i, U j]a, [U i, U j ]a, W )|γ = T hn(D, [U i, U j]λ\a, [U i, U j]λ\a, W )|γ.
By step 5 (Where we used only the fact that i, j ∈ s), [U i, U j]λ\aU i ∼ U i ∼ [U i, U j ]b. But
T hn(D, [U i, U j]λ\aU i, [U i, U j ]λ\a, W ) =
T hn(D, [U i, U j]λ\a, [U i, U j)]λ\a, W )|γ + T hn(D, U i, [U i, U j]λ\a, W )|[γ,λ) =
T hn(D, [U i, U j]a, [U i, U j)]a, W )|γ + T hn(D, U i, [U i, U j]λ\a, W )|[γ,λ) =
T hn(D, [U i, U j]a U i, [U i, U j]b, W ).
But [U i, U j ]a U i ∼ U i ∼ [U i, U j]b. So it follows by the equality of the theories that
[U i, U j ]λ\a ∼ [U i, U j]a ∼ U i as required.
25
8/3/2019 Shmuel Lifsches and Saharon Shelah- Peano Arithmetic May Not Be Interpretable In The Monadic Theory of Order