Next Article in Journal
Stability Analysis of Delayed Neural Networks via Composite-Matrix-Based Integral Inequality
Previous Article in Journal
Harnack Estimation for Nonlinear, Weighted, Heat-Type Equation along Geometric Flow and Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Model in Which Well-Orderings of the Reals First Appear at a Given Projective Level, Part II

by
Vladimir Kanovei
*,† and
Vassily Lyubetsky
*,†
Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), 127051 Moscow, Russia
*
Authors to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2023, 11(11), 2517; https://doi.org/10.3390/math11112517
Submission received: 3 April 2023 / Revised: 18 May 2023 / Accepted: 23 May 2023 / Published: 30 May 2023
(This article belongs to the Section Mathematics and Computer Science)

Abstract

:
We consider the problem of the existence of well-orderings of the reals, definable at a certain level of the projective hierarchy. This research is motivated by the modern development of descriptive set theory. Given n 3 , a finite support product of forcing notions similar to Jensen’s minimal- Δ 3 1 -real forcing is applied to define a model of set theory in which there exists a good Δ n 1 well-ordering of the reals, but there are no Δ n 1 1 well-orderings of the reals (not necessarily good). We conclude that the existence of a good well-ordering of the reals at a certain level n 3 of the projective hierarchy is strictly weaker than the existence of a such well-ordering at the previous level n 1 . This is our first main result. We also demonstrate that this independence theorem can be obtained on the basis of the consistency of ZFC (that is, a version of ZFC without the Power Set axiom) plus ‘there exists the power set of ω ’, which is a much weaker assumption than the consistency of ZFC usually assumed in such independence results obtained by the forcing method. This is our second main result. Further reduction to the consistency of second-order Peano arithmetic PA 2 is discussed. These are new results in such a generality (with n 3 arbitrary), and valuable improvements upon earlier results. We expect that these results will lead to further advances in descriptive set theory of projective classes.

1. Introduction

This paper is written as a continuation of our earlier paper [1] under the same title, which thereby has to be viewed as Part I of this paper.
Problems related to the well-orderability of the real line R emerged in the early years of set theory. The axiom of choice AC implies that every set can be well-ordered, yet AC does not yield a concrete construction of any particular well-ordering of R . The famous discussion between Baire, Borel, Hadamard, and Lebesgue in [2] presents related issues widely discussed by mathematicians early in the 20th century.
Then, studies in descriptive set theory demonstrate that no well-ordering of R belongs (as a set of pairs) to the first-level projective classes Σ 1 1 , Π 1 1 , see e.g., Sierpinski [3]. This was a consequence of Luzin’s theorem [4] saying that sets in Σ 1 1 Π 1 1 are Lebesgue measurable. (We refer to Moschovakis’ monograph [5] in matters of both modern and early notation systems and early history of descriptive set theory. Yet, we may recall that Σ 1 1 consists of all continuous images of Borel sets in Polish spaces, Π n 1 consists of all complements of Σ n 1 sets, Σ n + 1 1 consists of continuous images of Π n 1 sets, and Δ n 1 = Σ n 1 Π n 1 , for all n 1 ).
For the sake of brevity, we let WO ( Γ ) be the hypothesis saying:
There is a well-ordering of the real numbers which belongs to Γ as a set of pairs.”
Here, Γ is a given class of subsets of Polish spaces. Typical examples include projective classes Σ n 1 , Π n 1 , Δ n 1 defined as above, and their effective subclasses resp. Σ n 1 , Π n 1 , Δ n 1 , defined the same way but beginning with effective Borel sets, i.e., those that admit a Borel construction from an effectively (that is, computably) defined sequence of rational cubes.
Here, we can limit ourselves to classes Δ n 1 and Δ n 1 . Indeed,
WO ( Σ n 1 ) WO ( Π n 1 ) WO ( Δ n 1 ) and WO ( Σ n 1 ) WO ( Π n 1 ) WO ( Δ n 1 )
because if a well-ordering ≼ of the reals is say Σ n 1 then it is Π n 1 as well since x y is equivalent to x = y y x . Therefore, the result above can be summarized as ¬ WO ( Δ 1 1 ) .
At the next projective level, Gödel [6] proved that WO ( Δ 2 1 ) is consistent with the axioms of the Zermelo–Fraenkel set theory ZFC. This was established by a concrete definition of a Δ 2 1 well-ordering L of the reals in the constructible universe L . Then, Addison [7] distinguished a crucial property of L now known as goodness. Namely, a Δ n 1 -good well-ordering is defined to be any Δ n 1 well-ordering ≼ such that the class Δ n 1 is closed under ≼-bounded quantification. In other words, it is required that if P ( y , x ) is a binary Δ n 1 relation on the reals, then the following relations
Q ( z , x ) : = y x P ( z , y ) and R ( z , x ) : = y x P ( z , y )
belong to Δ n 1 as well. The result by Gödel–Addison then claims that, in L , L is a Δ 2 1 -good well-ordering of the reals. It follows that the existence of such a well-ordering is a consequence of the axiom of constructibility V = L , and hence it is consistent with ZFC. The Δ 2 1 -goodness of L is behind many key results on sets of the second projective level, see for instance ([5], Section 5A).
As for the opposite direction, studies in the early years of modern set theory (see, e.g., Levy [8] and Solovay [9]) demonstrated that the non-existence statement, saying that there is no well-ordering of R definable by any set-theoretic formula with ordinal and real parameters (this includes Σ 1 = n Σ n 1 as a small part), is consistent as well.
Modern research in connection with projective well-orderings touches on such issues as connections with forcing axioms [10,11], connections with large cardinals [12,13], connections with cardinal characteristics of the continuum [14,15], connections with the structure and properties of projective sets [16,17,18,19], and others. The following theorem contributes to this research field. The theorem is the first principal result of this paper.
Theorem 1.
Let n 3 . Then, there exists a generic extension of L , in which:
(i)
WO ( Δ n 1 ) is true, and moreover, there is a ω 1 -long Δ n 1 -good well-ordering of the reals;
(ii)
WO ( Δ n 1 1 ) is false, that is, there are no Δ n 1 1 well-orderings of the reals, of any kind, i.e., not necessarily good.
Therefore, it is consistent that “ WO ( Δ n 1 ) holds, even by means of a Δ n 1 -good well-ordering, and in the same time the stronger statement WO ( Δ n 1 1 ) fails”.
As an immediate corollary of Theorem 1, we conclude that, for any n 3 , the hypothesis WO ( Δ n 1 1 ) is strictly stronger than WO ( Δ n 1 ) because there exists a model in which the latter holds whereas the former fails. Thus, the strict ascending condition Δ n 1 1 Δ n 1 of the classes Δ n 1 is adequately reflected in the property of the existence of a well-ordering of the reals in a given class.
Theorem 1 significantly strengthens a theorem in our previous paper [1], where we defined a generic extension of L in which there is a Δ n 1 -good well-ordering but there do not exist Δ n 1 1 -good well-orderings of the reals. Thus, Theorem 1 improves the result in [1] by eliminating the goodness property in part (ii). This improvement required some crucial modifications in the proof of the theorem in part (ii) in this paper. Indeed in [1] we were able to use some well-known consequences of the Δ n 1 1 -goodness, in particular, the basis theorem saying that all non-empty Σ n 1 1 sets of reals contain Δ n 1 1 elements. This consequence is not available in the context of claim (ii) of the theorem since the Δ n 1 1 -goodness is not assumed. To circumvent this difficulty, this paper introduces an entirely new technique of working with the auxiliary forcing relation forc , developed in Section 23, Section 24, Section 25, Section 26, Section 27, Section 28, Section 29 and Section 30 of this paper.
The other direction of the paper belongs to the context of the second-order Peano arithmetic PA 2 and related set and class theories. Theory PA 2 governs the interrelations between the natural numbers and sets of natural numbers, and is widely assumed to lay down working foundations for essential parts of modern mathematics including whatever is (or can be) developed by means of the theory of projective sets, see e.g., Simpson [20].
In particular, claims (i) and (ii) of Theorem 1 can be adequately presented by certain formulas of the language of PA 2 based on suitable universal formulas for classes Σ n 1 and Σ n 1 1 . Therefore, for any given n 3 , the statement (i) + (ii) of Theorem 1 is essentially a formula, say Φ n , of the language of PA 2 , whose consistency is established by the theorem. Thus, it becomes a natural problem to prove the consistency of Φ n as in Theorem 1 on the base of tools close to PA 2 , rather than (much stronger) ZFC tools. The next theorem, our second main result, solves this problem on the basis of ZFC (minus stands for the absence of the Power Set axiom), which is a theory equiconsistent with PA 2 and thereby a substantial approximation towards PA 2 .
Theorem 2
(in ZFC + ‘ P ( ω ) exists’). Let n 3 . Then, the conjunction of (i) and (ii) of Theorem 1 is consistent with PA 2 .
Further reduction to pure PA 2 will be the topic of our subsequent planned paper.

2. Outline of the Proof

Given n 3 as in Theorem 1, a generic extension of L , the constructible universe, was defined in [1], in which there exist Δ n 1 -good well-orderings of the reals, but no Δ n 1 1 -good well-orderings. Here, to prove our main results, Theorems 1 and 2, we make use of a modified model. This model involves a product forcing construction in L , earlier applied in [18,21] for models with various effects related to the property of separation in the projective hierarchy, and also in [17] for a model in which the full basis theorem holds in the effective projective hierarchy (all non-empty Σ 1 sets of reals contain Σ 1 elements), in the absence of a Σ 1 well-ordering of the reals, for generic models with counterexamples to the countable axiom of choice AC ω and dependent choices DC in [22], to name a few examples.
Following the earlier papers [1,17,18], we make use of a sequence of forcings P ( ξ ) , ξ < ω 1 , defined in L such that the product forcing P = ξ P ( ξ ) adds a sequence of generic reals to L , uniformly Π n 1 1 -definable in two arguments. Each forcing notion P ( ξ ) in this construction is a set of perfect trees T 2 < ω , similarly to the Jensen minimal forcing defined in [23]. See more in ([24], 28A) on Jensen’s forcing. Infinite finite-support products of Jensen’s forcing were first considered by Enayat [25], as demonstrated in [1], following this modification of Jensen–Enayat construction results in the existence of Δ n 1 -good well-orderings in P -generic extensions, thus witnessing (i) of Theorem 1.
Yet, a substantial modification of the Jensen–Enayat forcing construction is maintained in this paper, in order to get rid of using countable models of ZFC (i.e., ZFC without the Power Set axiom). Different tools based on such models were used in earlier papers, e.g., in [1,18], in particular, for evaluating the complexity of various sets, leke e.g., the forcing notion itself. However, as one of our goals is to reduce the whole complexity of the construction of the models required, we have to remove models of ZFC from our instrumentarium. Getting rid of models of ZFC is thereby a principal technical achievement of this paper.
We begin in Section 3, Section 4, Section 5, Section 6 and Section 7 with a rather routine material related to arboreal forcings (those with perfect trees in 2 < ω as forcing conditions) and their countable finite-support products called multiforcings, as well as finite tuples of trees called multitrees. The principal refinement relation π ϙ between multiforcings π , ϙ is introduced in Section 7. Roughly speaking, its meaning consists in the requirement that every multitree in MT ( ϙ ) (all multitrees related to ϙ ) has to be meager in every multitree in MT ( π ) .
The second part of the paper (Section 8, Section 9, Section 10, Section 11, Section 12, Section 13, Section 14 and Section 15) develops the background for the above-mentioned technical achievement. It is based on the notion of sealing refinement  π D ϙ ( D being a dense subset of MT ( π ) ), which means that, besides π ϙ , every multitree p MT ( ϙ ) is covered by a finite collection of D -extendable multitrees in MT ( π ) (Definition 11). The following transitivity property takes place: if multiforcings π , ϙ , δ satisfy π D ϙ δ then ( π cw ϙ ) D δ , where cw is the component-wise union of multiforcings. We consider different types of dense sets to be sealed, including those which govern a kind of Cantor-Bendixson derivative procedure in Section 12 and Section 13.
Corollary 12 summarizes the transitivity property as above for different versions of D . Theorem 4 proves the existence of sealing refinements. Theorem 5 provides consequences for generic extensions.
The next part of the paper (Section 16, Section 17, Section 18, Section 19, Section 20, Section 21 and Section 22) presents the key constructions involved in the proof of Theorem 1. We fix a natural number n 3 as in Theorem 1, and consider the constructible universe L as the ground model. Theorem 6 in Section 19 introduces a ω 1 -long -increasing sequence L of countable multiforcings, whose properties include; first, sealing a sufficient amount of dense sets during the course of the construction; second, a sort of definable genericity in L ; and third, a definability requirement—as in Definition 23. The subsequent key forcing notion P L (which depends on ) is defined in Section 20. Its properties include CCC by Theorem 7. Then, we consider P -generic extensions of L , called key models. The main results regarding key models are: Theorem 8, which characterizes generic reals; and Theorem 9, which provides a Δ n 1 -good well-ordering in the generic model considered, with (i) of Theorem 1 as a consequence. Along with Theorem 7, these are the main results of this part of the paper.
Claim (ii) of Theorem 1 involves one more important technical tool related to the above-defined key forcing notion P . It turns out that the P -forcing relation of Σ n 1 1 formulas is equivalent (up to level n 1 of the projective hierarchy of formulas) to a certain auxiliary forcing relation forc defined and studied in the following part of the paper (Section 23, Section 24, Section 25, Section 26, Section 27, Section 28, Section 29 and Section 30). Theorem 11 proves the equivalence. This auxiliary forcing is invariant with respect to permutations of indices ξ < ω 1 (Theorem 12), whereas the forcing P itself is absolutely not invariant in that sense. Such a hidden invariance plays a crucial role in the construction. It was applied in [1] in the proof that P -generic extensions satisfy a weaker version of (ii) only for Δ n 1 1 -good well-orderings. Here, we make use of the invariance to prove, using Theorem 13, that the full version of (ii) also holds in the P -generic extensions. Theorems 11–13 are the main results related to forc , and the introduction and the whole treatment of the auxiliary forcing in a form compatible with the system of sealing relations without any reference to countable models of ZFC is our second principal technical achievement.
The final part of the paper contains Section 31 with a short proof of Theorem 2 and a brief discussion of its possible reduction to a theory weaker than ZFC + ω 1 exists’. We finish in Section 32 with conclusions and problems.
  • Part I: Basic Constructions
Here, we present a rather routine material on arboreal forcing notions, i.e., those with perfect trees in 2 < ω in the role of forcing conditions. Then, in Section 6, we consider countable finite-support products of arboreal forcing notions, called multiforcings, as well as finite tuples of trees called multitrees. We introduce and study a principal refinement relation between arboreal forcing notions in Section 4 and between multiforcings in Section 7.

3. Trees and Arboreal Forcing Notions

Recall that 2 < ω is the set of all tuples (i.e., finite sequences) of 0 , 1 . If t 2 < ω and i = 0 , 1 , then t i is the extension of t by i taking the rightmost position. If s , t 2 < ω , then
  • s t if and only if t extends s;
  • s t if and only if s t but s t .
Generally, ⊂ denotes a strict inclusion (the equality “=” not allowed) in all cases in this paper, i.e., the same as ⫋. The non-strict inclusion is ⊆. The length of t is denoted by lh ( t ) , and we put 2 n = { t 2 < ω : [ 0 ] lh ( t ) = n } , the set all tuples of length n.
Trees in 2 < ω are considered. Thus, T 2 < ω is a tree if t T s T holds for all tuples s t in 2 < ω . Then, the body
[ T ] = { a 2 ω : [ 0 ] n ( a n T ) } 2 ω
is a closed set in 2 ω . A tree T 2 < ω is:
-
Pruned, if T contains no ⊆-maximal tuples;
-
Perfect, if it is pruned and has no isolated branches;
-
We let PT contain all perfect trees T 2 < ω ;
-
If s T PT then we put T s = { t T : [ 0 ] s t t s } ; clearly T s PT as well.
If T PT then [ T ] is a perfect set in 2 ω .
Definition 1.
If S , T PT , then define S T ( S , T are incompatible) if [ S ] [ T ] = ; this is equivalent to S T being finite. Then, S T means the negation of S T .
A set A PT is an antichainif S T holds for all S T in A.
Definition 2
(arboreal forcing notions). A set P PT is an arboreal forcing if u T P implies T u P . We define AF to be the set of all arboreal forcings P.Any P AF is:
-
Regular, if, for all trees S , T P , the intersection [ S ] [ T ] is clopen in [ S ] or in [ T ] ;
-
Special, if P = { T s : [ 0 ] s T A } for some finite or countable antichain A P —note that in this case the antichain A is unique and the forcing P has to be countable.
Note that every special arboreal forcing is regular.
Example 1.
For any s 2 < ω , define T [ s ] = { t 2 < ω : [ 0 ] s t t s } .Then, T [ s ] PT and T [ s ] = ( 2 < ω ) s , s . Then, P coh = { T [ s ] : [ 0 ] s 2 < ω } is the Cohen forcing, a regular and special arboreal forcing. The set PT itself is a non-regular arboreal forcing.
Definition 3
(perfect kernels). The perfect kernel of a tree T ω < ω is the set
ker ( T ) = { s T : [ 0 ] there exists a perfect tree S with s S T s } .
This is the largest perfect tree K T .
Definition 4
(meet of perfect trees). If S , T PT then let S T = ker ( S T ) .
The intersection S T may not even be pruned, but S T is a perfect (or empty) tree, [ ker ( S T ) ] [ S ] [ T ] , and the difference ( [ S ] [ T ] ) [ ker ( S T ) ] is at most countable.
Lemma 1.
Let P be a regular arboreal forcing. Then,
(i)
If T 1 , , T n P and X = [ T 1 ] [ T n ] then X is a finite union of sets of the form [ S ] , S P , and then T = T 1 T n = ker ( T 1 T n ) is a perfect tree equal to a finite union of trees in P, and [ T 1 ] [ T n ] = [ T ] .
(ii)
Any trees S , T P are P -compatible (i.e., some tree R P satisfies R S T ) if and only if [ S ] [ T ] , equivalently, S T .
Proof. 
(i) Assume that n = 2 . By the regularity assumption, let X = [ T 1 ] [ T 2 ] be clopen in say [ T 1 ] . Then, there are tuples s 1 , , s k T 1 such that X = [ T ] , where T = ker ( T 1 T 2 ) = T 1 s 1 T 1 s k . However, T 1 s i P as P AF . As for n > 2 , proceed by induction.
(ii) is an easy corollary of (i). □
Lemma 2.
If T P AF and S PT , T S , then there exists a tree T P satisfying T T and [ T ] [ S ] = .
Proof. 
Let T = T s , where s T S . □

4. Refinements of Arboreal Forcings

In this section, we introduce the key notion of refinement of arboreal forcings.
We remind that if P = P ; is any poset then a set D P is:
-
Dense in P in case p P q D ( q p ) ;
-
Open dense in P if in addition p P q D ( p q p D ) ;
-
Pre-dense in P if the set D = { p P : [ 0 ] q D ( p q ) } is dense in P .
An arboreal forcing Q is a refinement of an arboreal forcing P,in symbol P Q , if:
(1)
Q is dense in P Q , so that for any T P there is Q Q with Q T ;
(2)
For any T Q we have T fin P , meaning thatthere exists a finite D P satisfying T D , or equivalently [ T ] S D [ S ] ;
(3)
If T Q and S P then the intersection [ S ] [ T ] is clopen in [ S ] , and S T —it follows that P Q = and the set [ S ] [ T ] is meager in [ S ] .
Thus, trees in the refinement Q define closed sets that are essentially smaller in the sense of category than the trees of the original arboreal forcing P do.
Lemma 3.
Assume that P Q are arbitrary regular arboreal forcings. Then:
(i)
The union P Q is regular, too, and Q is open dense in P Q ;
(ii)
If S P , T Q , and S T , then S T is a finite union of trees T s Q , s T ;
(iii)
If S , S P , T Q , and T S 1 S 2 , then there are trees R P and T Q satisfying T T and T R S 1 S 2 .
Proof. 
To prove the regularity of P Q in (i), make use of (3). To prove (ii) apply (3) once again. Finally prove (iii). By Lemma 1(i), there are trees R 1 , , R n P such that [ S 1 ] [ S 2 ] = [ R 1 ] [ R n ] . It follows by (ii) that there is a tuple s T such that T = T s R i . We observe that T Q as Q is an arboreal forcing. Put R = R i . □
Lemma 4.
If P Q R are arboreal forcings then P R , P ( Q R ) , ( P Q ) R .
Proof. 
Prove P R . Properties (1), (2) are rather obvious. To check (3), let T R and S P . By (2), there is a finite D Q with T D . If U D , then [ T ] [ U ] is clopen in [ U ] and [ U ] [ S ] is clopen in [ S ] . Thus, [ T ] [ S ] is clopen in [ S ] . To see that S T , assume otherwise. Then, S D , and hence there is a tree U D Q such that [ U ] [ S ] is not meager in [ S ] . On the other hand, [ U ] [ S ] is clopen in [ U ] by (3). It follows that there are tuples u , s 2 < ω satisfying U u = S s . However, U u Q and S s P . This contradicts (3).
The relations P ( Q R ) and ( P Q ) R are easy consequences. □
Lemma 5
(see Lemma 5.2 in [18]). Let P α α < γ be any -increasing sequence of special arboreal forcings. Then, P = α < γ P α is a regular arboreal forcing.
In addition, if 0 < μ < γ then α < μ P α = P < μ P μ = μ α < γ P α .
Moreover, if 0 < μ < γ then P μ is pre-dense in P and P μ is dense in P.
Proof. 
If S P α and T P β , α < β , then P α P β ; hence, [ S ] [ T ] is clopen in [ T ] by (3) above. This implies the regularity of P. The additional claims are elementary as well. □

5. Sealing Refinements: Arboreal Forcings

Assume that P Q . Then, a dense set D P is not dense in P Q any more. Generally speaking, it may not even be pre-dense in P Q . Yet, it happens that there is a special type of dense sets called sealed dense that preserves pre-density under refinements, and a special type of refinements that turns dense sets into sealed dense sets.
The case of arboreal forcings considered here is a simplified introduction into the more important case of multiforcings in the next section.
Definition 5.
Let P PT be an arboreal forcing. A set D P is sealed dense, if 1) it is open, i.e., S P T D ( S T S D ) , and 2) if S P then S fin D .
Lemma 6.
Assume that D is a sealed dense set in P AF . Then, D is open dense.
Proof. 
To prove the density, assume that S P . Then, S T 1 T n , where T i D for all i. At least one of the intersections [ S ] [ T i ] is not meager in [ S ] . Then, there is a tuple t S such that T = S t T i . Then, T P ; hence, T D by the openness. □
Lemma 7.
Assume that P Q are arboreal forcings, and D is a sealed dense set in P. Then, D Q = { U Q : [ 0 ] S D ( U S ) } is a sealed dense set in Q.
Proof. 
Let U Q . By (2), in Section 4, the tree U is covered by a finite set of trees in P, hence, by a finite set T 1 , , T n of trees T i D because D is sealed dense in P. Then, any intersection [ U ] [ T i ] is clopen in [ U ] by (3) in Section 4; hence, [ U ] [ T i ] is equal to a finite union of sets [ V ] , V Q . Thus, overall, [ U ] itself is equal to a finite union of sets [ V ] , where V Q is such that V T i for some T i D . It remains to note that each such V belongs to D Q . □
Thus, the sealed denseness is preserved by the refinement operation. The next lemma shows that dense sets give rise to a sealed dense set by a certain kind of refinement.
Definition 6.
If P Q are arboreal forcings and D P , then P D Q means that every tree T Q is covered by a finite union of trees in D.
Lemma 8
(see Lemma 5.4 in [18]). Assume that P , Q , R are arboreal forcings, D P , and P D Q R . Then, P D ( Q R ) and P Q D R .

6. Multiforcings and Multitrees

By a multiforcing, we understand any map π : | π | AF such that | π | = dom π ω 1 . The set of all multiforcings is denoted by MF . We can represent an arbitrary π MF in the form of an indexed set π = P ξ ξ | π | , with P ξ AF for each ξ | π | , where all components P ξ = P ξ π = π ( ξ ) , ξ | π | , are arboreal forcings. Say that π is:
-
Small, in case both | π | and eachset π ( ξ ) = P ξ π , ξ | π | , are countable;
-
special,in case each π ( ξ ) = P ξ π is special (then countable) as in Definition 2;
-
Regular,in case all π ( ξ ) = P ξ π are regular as in Definition 2.
Similarly, a multitree is any function p : | p | PT with a finite domain | p | = dom p ω 1 . Let MT be the set of all multitrees. Any multitree p MT can be represented in the form p = T ξ p ξ | p | , where T ξ p = p ( ξ ) PT for all ξ | p | . The set MT is ordered component-wise: q p ( q is stronger than p ) if | p | | q | and T ξ q T ξ p for all ξ | p | .
Let π = P ξ ξ | π | be a multiforcing. Any multitree p MT is called a π -multitree,if | p | | π | and for each ξ | p | the tree p ( ξ ) = T ξ p belongs to P ξ = π ( ξ ) . Clearly, the collection MT ( π ) of all π -multitreescan be identified with the finite support product ξ | π | P ξ of the arboreal forcings P ξ = π ( ξ ) involved.
Definition 7.
If p MT then define [ p ] = ξ | p | [ p ( ξ ) ] ,the finite Cartesian product of the perfect sets [ p ( ξ ) ] , ξ | p | . If | p | X ω 1 , then let [ p ] X = { x ( 2 ω ) X : [ 0 ] x | p | [ p ] } , this is a cylinder in ( 2 ω ) X based on [ p ] .
Definition 8
(extension). If D MT and ϙ is an arbitrary multiforcing then we define D ϙ = { q MT ( ϙ ) : [ 0 ] p D ( q p ) } .
Corollary 1
(of Lemma 1(i)). Let π be a regular multiforcing, p , q MT ( π ) , X = | p | | q | . Then, the intersection ( [ p ] X ) ( [ q ] X ) is equal to a finite (perhaps empty) union of sets [ w ] , where w MT ( π ) and | w | = X .
Definition 9.
Multitrees p , q are incompatible, in symbol p q , if p ( ξ ) q ( ξ ) , or equivalently, [ p ( ξ ) ] [ q ( ξ ) ] = , holds for some index ξ | p | | q | , and compatible otherwise. As usual, a set A MT of pairwise incompatible multitrees is called an antichain.
Given a multiforcing π, multitrees p , q are π -compatible, if there existsa multitree r MT ( π ) such that r p and r q , and otherwise are π -incompatible, in symbol p π q . Sets A MT of pairwise π -incompatible multitrees are π -antichains.
If multitrees are incompatible, then they are π -incompatible for any π . The next corollary shows that the inverse is true for regular multiforcings.
Corollary 2
(of Lemma 1(ii)). Let π be a regular multiforcing and p , q MT ( π ) . Then, p , q are π -compatible if p , q are compatible as in Definition 9.
It follows that being an antichain is equivalent to being a π -antichain.
Corollary 3
(of Lemma 2). Let π be a regular multiforcing and p MT ( π ) , r MT . If p ( ξ ) r ( ξ ) for at least one ξ | r | | π | , then there exists a multitree q MT ( π ) , q p , satisfying q r .
Let π , ϙ be multiforcings. Define a multiforcing σ = π cw ϙ (the component-wise union), so that | σ | = | π | | ϙ | and
σ ( ξ ) = π ( ξ ) iff ξ | π | | ϙ | , ϙ ( ξ ) iff ξ | ϙ | | π | , π ( ξ ) ϙ ( ξ ) iff ξ | ϙ | | π | .
If π = π α α < λ is a sequence of multiforcings, then the component-wise union π = cw π = α < λ cw π α MF is accordingly defined so that | π | = α < λ | π α | and π ( ξ ) = α < λ , ξ | π α | π α ( ξ ) for all ξ | π | . We observe that cw does not preserve regularity.
Definition 10
(component-wise meet of multitrees). Let π be a regular multiforcing. Say that a finite set of multitrees p 1 , , p n MT ( π ) is compatible as a whole if for any index ξ i | p i | , we have i [ p i ( ξ ) ] . (Here, and below, it is understood that p i ( ξ ) = 2 < ω whenever ξ | p i | ). In such a case, let us define a multitree
p = i cw p i = p 1 cw cw p n
so that | p | = i | p i | and p ( ξ ) = i p i ( ξ ) = ker ( i p i ( ξ ) ) for all ξ | p | .
Corollary 4
(of Lemma 1(i)). Suppose that π is a regular multiforcing, and a finite set of multitrees p 1 , , p n MT ( π ) is compatible as a whole. Then, p = i cw p i is a multitree, and [ p ] is a finite union of sets of the form [ q ] , where q MT ( π ) , | q | = | p | .
Remark 1
(forcing). Let P AF be an arboreal forcing. We may treat P as a forcing notion, so that if T T then T is a stronger condition. Clearly, P adjoins a real in 2 ω .
If π = P ξ ξ | π | MF is a multiforcing then the set MT ( π ) , ordered as above, is accordingly viewed as a forcing notion which adjoins a generic sequence x ξ ξ | π | , where every x ξ = x ξ [ G ] 2 ω is a P ξ -generic real. Reals of the form x ξ [ G ] will be called principal generic reals in the extension by a MT ( π ) -generic set G.

7. Refinements of Multiforcings

Here, we extend the notion of refinement to multiforcings in component-wise way.
Let π , ϙ be arbitrary multiforcings. Then, ϙ is said to be a refinement of π ,symbolically π ϙ , if | π | | ϙ | and we have π ( ξ ) ϙ ( ξ ) in AF for all ξ | π | .
Corollary 5
(of Lemma 4). If π ϙ σ are multiforcings then π σ , π ( ϙ cw σ ) , and ( π cw ϙ ) σ .
Corollary 6
(of Lemma 3). Let π ϙ be regular multiforcings. Then, so is π cw ϙ , and MT ( ϙ ) is an open dense set in MT ( π cw ϙ ) . Moreover, if p , p MT ( π ) , q MT ( ϙ ) , and q p , p , then there are multitrees r MT ( π ) , q MT ( ϙ ) satisfying q q and q r p , p .
Corollary 7
(of Lemma 1(i)). Let π ϙ be regular multiforcings, p MT ( π ) , q MT ( ϙ ) , X = | p | | q | . Then, the intersection ( [ p ] X ) ( [ q ] X ) is a finite (perhaps empty) union of sets of the form [ w ] , where w MT ( ϙ ) and | w | = X .
Remark 2.
It follows from the above that the relations , are strict partial orders on sets resp. AF , MF . In addition, if π , ϙ are multiforcings and | π | | ϙ | , then the relations π ϙ and π ϙ are equivalent, where ϙ = ϙ | π | .
  • Part II: Sealing Refinements
The first goal of this Part is to introduce a notion of sealing refinements for multiforcings, similar to the sealing refinements for arboreal forcings as in Section 5. This is a considerably more difficult case because obtaining adequate, working definitions both of the sealed density and the sealing refinements are somewhat less obvious. In particular, the notion of sealing refinement  π     D ϙ ( D being a dense subset of MT ( π ) ), stipulates, that, besides π ϙ , every multitree p MT ( ϙ ) is covered by a finite collection of D -extendable multitrees in MT ( π ) (Definition 11). We consider different types of dense sets to be sealed, including those that govern a kind of Cantor-Bendixon derivative procedure in Section 12 and Section 13.
Corollary 12 summarizes the transitivity property as above for different versions of D . Theorem 4 proves the existence of sealing refinements. Theorem 5 provides consequences for generic extensions. These are main results of Part II.

8. Sealing Refinements

Suppose that u is a multitree and D a set of multitrees. Define u fin D ,if there exists a finite subset D D such that 1) | v | = | u | for all v D , and 2) [ u ] v D [ v ] . (Regarding [ u ] we refer to Definition 7).
Definition 11.
Let π be a multiforcing and D MT .
  • A multitree p is D -extendable if there existsa multitree q D satisfying p = q | p | .
  • If X ω 1 is finite then let D ext X ( π ) = { p MT ( π ) : [ 0 ] | p | = X p is D - extendable } .
(1)
D is sealed dense in MT ( π ) if D isopen in MT ( π ) and u fin D ext | u | ( π ) holds for every u MT ( π ) .
(2)
A multiforcing ϙ seals D over π,symbolically π D ϙ ,if π ϙ and, for every u MT ( ϙ ) with | u | | π | , the relation u fin D ext | u | ( π ) holds.
(3)
A multiforcing ϙ seals D over π in the old sense, symbolically π D old ϙ , if π ϙ and the next condition is true:
  • if p MT ( π ) , u MT ( ϙ ) , | u | | π | , | u | | p | = , then there exists q MT ( π ) satisfying q p , also | q | | u | = , and finally u fin D q | u | , where
    D q | u | = { w MT ( π ) : [ 0 ] | w | = | u | w q D } .
The old definition (3) of sealing refinements was given in [18] on the basis of earlier studies [22,26]. We use here a more flexible definition by (2).
Lemma 9.
If π , ϙ are arbitrary multiforcings, D MT ( π ) , and π D old ϙ then π D ϙ .
Proof. 
Apply (3) with p = Λ (the empty multitree). □
We will use the notation D ϙ as in Definition 8 in the following lemmas.
Lemma 10.
Suppose that π , ϙ are regular multiforcings, and D MT ( π ) any set. Then:
(i)
If D is sealed dense in MT ( π ) then D is open dense, and moreover, if u MT ( π ) , X = | u | , then there is a D -extendable multitree v MT ( π ) with v u and v = X ;
(ii)
If D is sealed dense in MT ( π ) , then π ϙ implies π D ϙ ;
(iii)
If π D ϙ then D ϙ is sealed dense in MT ( ϙ ) whereas D itself is pre-dense in MT ( π ) and in MT ( ( π cw ϙ ) ) ;
(iv)
If π D ϙ , and u MT ( ϙ ) , X = | u | , then there exists a ( D ϙ ) -extendable multitree v MT ( ϙ ) with v u and v = X ;
(v)
If D is sealed dense in MT ( π ) , and π ϙ , then the set D ϙ is sealed dense in MT ( ϙ ) and open dense in both MT ( ϙ ) and MT ( π cw ϙ ) .
Proof. 
(i) As the openness of D is given, prove the ‘moreover’ claim. Let u MT ( π ) , X = | u | . Then, [ u ] [ p 1 ] [ p n ] , where the multitrees p i MT ( π ) satisfy | p i | = X and are D -extendable. Then, u is compatible with at least one p i , and hence π -compatible by Corollary 2, so that there is a multitree v MT ( π ) with v p i , v u , and still | v | = X . It remains to be shown that v is D -extendable.
By the choice of p i , there exists a multitree q D with X Y = | q | and q X = p i . Define a multitree w MT ( π ) so that | w | = Y , w X = v , and w ( Y X ) = q ( Y X ) . Then, clearly, w q , and hence w D by the openness of D .
(ii) Let u MT ( ϙ ) , | u | = X | π | . By π ϙ , there exists a finite collection F MT ( π ) of sets p MT ( π ) such that | p | = X and [ u ] p F [ p ] . However, each [ p ] , p F , is covered by a finite union of sets [ q ] , where q is D -extendable.
(iii) The openness of D ϙ in MT ( ϙ ) is obvious. To prove the sealed density, let u MT ( ϙ ) . Since MT ( π cw ϙ ) is a product, we can assume that X = | u | | π | . As π D ϙ , [ u ] [ p 1 ] [ p n ] holds, where the multitrees p i MT ( π ) satisfy | p i | = X and are D -extendable; hence, there are p i D such that X | p i | and p i = p i X .
For each p i , it follows by Corollary 7 that there exists a finite set V ( i ) of multitrees v MT ( ϙ ) satisfying still | v | = X and [ u ] [ p ] = v V ( i ) [ v ] . Let V = i n V ( i ) . Then, [ u ] = v V [ v ] , so it remains to show that each v V is ( D ϙ ) -extendable in MT ( ϙ ) .
Let v V ( i ) and q = p i , so that q D and p i = q X . As u p , there is a multitree w MT ( ϙ ) with w q and w X = v . Then, w D ϙ ; therefore, w witnesses that v is ( D ϙ ) -extendable. This completes the proof that D ϙ is sealed dense in MT ( ϙ ) .
To prove the pre-density of D in MT ( π ) , let p MT ( π ) . As π ϙ , there is u MT ( ϙ ) , u p . There exists v D ϙ , v u , by the above. Then, v some q D . Thus, v witnesses that p , q are compatible; therefore, p , q are π -compatible by Corollary 2.
To prove (iv) make use of (iii) and apply (i) for D ϙ .
Finally, (v) easily follows from (i) (to infer the open density in MT ( ϙ ) ), (ii), (iii), and Corollary 6 (to infer the open density in MT ( π cw ϙ ) ). □
Thus, in the case of multiforcings, the sealed density is preserved by the refinement operation, and just a dense set D converts to a sealed dense set by the refinement D .
Lemma 11.
Let π , ϙ be regular multiforcings and D 1 D 2 MT ( π ) . Then:
(i)
If D 1 , D 2 are sealed dense sets in MT ( π ) then D = D 1 D 2 is sealed dense as well;
(ii)
If D 1 , D 2 are open dense sets in MT ( π ) , π D 1 ϙ , and π D 2 ϙ , then we have π D ϙ .
Proof. 
(i) Both D 1 , D 2 are open dense in MT ( π ) , and hence, so is D . Now, let u MT ( π ) , X = | u | . As D 1 is sealed dense, we have [ u ] [ u 1 ] [ u n ] , where the multitrees u i MT ( π ) satisfy | u i | = X and are D 1 -extendable. In other words, for any u i there is a multitree p i D 1 such that X | p i | and u i = p i X . Let X i = | p i | . As D 2 is sealed dense, we have [ p i ] [ p 1 i ] [ p n ( i ) i ] , where the multitrees p k i MT ( π ) satisfy | p j i | = X i and are D 2 -extendable. Thus, for any p k i there is a multitree w k i D 2 such that X i | w k i | and p k i = w k i X i . Finally, each set u k i = w k i X i is D -extendable (to w k i ), and [ u ] i k u k i .
(ii) Let u MT ( ϙ ) , X = | u | | π | . The sets D 1 ϙ and D 2 ϙ are sealed dense in MT ( ϙ ) by Lemma 10(iii), hence so is D = ( D 1 ϙ ) ( D 2 ϙ ) by (i). It follows that we can w. l. o. g. assume that u is already D -extendable, so that there is multitrees v MT ( ϙ ) , p 1 D 1 , and p 2 D 2 such that X Y = | v | and v p 1 , p 2 , u = v X .
Then, [ v ] ( [ p 1 ] Y ) ( [ p 2 ] Y ) , and on the other hand we have ( [ p 1 ] Y ) ( [ p 2 ] Y ) = [ r 1 ] [ r 2 ] [ r m ] by Corollary 4, where r i MT ( π ) , | r i | = Y . Furthermore, r i D = D 1 D 2 by the open density assumption in (ii).
For each i, if [ v ] [ r i ] , then, by π ϙ , there are multitrees w 1 i , w 2 i , , w n ( i ) i MT ( ϙ ) such that | w j i | = Y for all i , j , and [ v ] [ r i ] = j n ( i ) [ w j i ] . We observe that w j i r i for all i , j by construction; hence, w j i ( D 1 D 2 ) ϙ .
Now, let u j i = w j i X . Then, u j i MT ( ϙ ) , | u j i | = X , [ u ] = i , j [ u j i ] , and each u j i is ( D 1 D 2 ) ϙ -extendable (to w j i ), as required. □
Lemma 12.
Let π D ϙ δ be regular multiforcings, D MT ( π ) . Then:
(i)
π D ( ϙ cw δ ) ;
(ii)
π D δ ;
(iii)
ϙ E δ , where E = D ϙ = { q MT ( ϙ ) : [ 0 ] p D ( q p ) } ;
(iv)
( π cw ϙ ) E δ and ( π cw ϙ ) D δ .
Proof. 
(i) Corollary 5 implies π ( ϙ cw δ ) . Let u MT ( ϙ cw δ ) , | u | = X | π | . As ϙ δ , there is a finite collection U MT ( ϙ ) satisfying | v | = X for all v U , and [ u ] v U [ v ] . As π D ϙ , we obtain v fin D ext X ( π ) for any v U , and hence u fin D ext X ( π ) .
(ii) The relation π D σ is an easy corollary.
(iii) Let u MT ( δ ) , | u | = X | π | . As ϙ δ , there exists a finite U MT ( ϙ ) satisfying | v | = X for each v U , and [ u ] v U [ v ] . Then, we have v fin D ext X ( π ) for every v U since π D ϙ . In other words, there exists a finite W D ext X ( π ) with [ u ] v U [ v ] w W [ w ] . The multitrees in U can be refined using Corollary 7, so that we obtain a finite collection U MT ( ϙ ) satisfying
(1) Still | v | = X for any v U ;
(2) v U [ v ] = v U [ v ] ;
(3) If v U then v w for some w W — and hence easily v E ext X ( ϙ ) .
It follows that [ u ] fin E ext X ( ϙ ) , as required.
(iv) The relation ( π cw ϙ ) E δ is an easy corollary of (3).
Finally, ( π cw ϙ ) D δ is established by the set W in the proof of (iii). □

9. Two Examples

Here, we consider two important types of dense sets that can be made sealed dense.
Example 2.
If π is a multiforcing and p 0 MT (not necessarily p 0 MT ( π ) ), then
(∗)
the set D p 0 ( π ) = { q MT ( π ) : [ 0 ] | p 0 | | q | ( q p 0 p 0 q ) } is open dense in
MT ( π ) by Corollary 3 in case | p 0 | | π | , whereas if | p 0 | | π | then D p 0 ( π ) = .
If ϙ is another multiforcing then we write π p 0 ϙ instead of π D p 0 ( π ) ϙ , and say that ϙ seals p 0 over π . Note that | p 0 | | π | in this case.
In addition, if D p 0 ( π ) is sealed dense in MT ( π ) then we say that p 0 is sealed by π .Still | p 0 | | π | in this case.
Corollary 8.
Assume that π ϙ δ are regular multiforcings, and p 0 MT . Then:
(i)
If p 0 is sealed by π then π p 0 ϙ ;
(ii)
If π p 0 ϙ then p 0 is sealed by ϙ , while D p 0 ( π ) is open dense in MT ( π ) .
Proof. 
We first recall (∗) in Example 2 and observe that ( D p 0 ( π ) ϙ ) D p 0 ( ϙ ) . Then, to prove (i), (ii) apply Lemma 10. □
If π is a multiforcing and p , q are π -incompatible multitrees in MT (not necessarily in MT ( π ) ), then it is well possible that p , q become ϙ -compatible for another multiforcing ϙ , even with π ϙ . To inhibit such a case, the following condition is introduced.
Example 3.
Let π be a multiforcing. If p , q MT (not necessarily MT ( π ) ), then let
N p q ( π ) = { r MT ( π ) : [ 0 ] r p r q } .
The set N p q ( π ) is open dense in MT ( π ) by Corollary 3, provided | p | | q | | π | and p , q are π -incompatible, but if p , q are π -compatible, then N p q ( π ) is not dense in MT ( π ) .
We define π p q ϙ to mean that | p | | q | | π | , p and q are π -incompatible, and π N p q ( π ) ϙ . In this case, we say that ϙ seals p π q over π .
If | p | | q | | π | , p and q are π -incompatible, and N p q ( π ) is sealed dense in MT ( π ) , then we say that p π q is sealed by π .
The following corollary reinterprets some key results above in terms of p q .
Corollary 9.
Let π ϙ and δ be regular multiforcings and p , q MT . Then:
(i)
If p π q is sealed by π then π p q ϙ ;
(ii)
If π p q ϙ then p ϙ q is sealed by ϙ , while N p q ( π ) is open dense in MT ( π ) ;
(iii)
If p π q is sealed by π, p , q MT , and p p , q q , | p | | q | | π | , then p π q is sealed by π as well.
Proof. 
The proof is similar to Corollary 8. We make use of Lemma 10 and Lemma 12(i),(iv), in view of the fact that ( N p q ( π ) ϙ ) N p q ( ϙ ) . As for the extra item (iii), we obviously have N p q ( π ) N p q ( π ) provided p p and q q . □

10. Real Names and Direct Forcing

In this section, a notational system for names of reals in 2 ω is introduced. It is appropriate for dealing with forcing notions MT ( π ) .
Definition 12.
We let a real name be any c MT × ( ω × 2 ) such that the sets K n i c = { p MT : [ 0 ] p , n , i c } satisfy the following condition: given n < ω , any p K n 0 c , q K n 1 c are incompatible, i.e., p q (Definition 9). Let K n c = K n 0 c K n 1 c ; K n c MT ( π ) .
A real name c is small if every set K n c is finite or countable — then both the set | c | = n p K n c | p | , and c itself, are countable as well.
Given a multiforcing π, a real name c is:
-
π -complete, whenever every collection K n c π = { p MT ( π ) : [ 0 ] q K n c ( p q ) } (the π -cone of K n c ) is pre-dense (and then clearly open dense) in MT ( π ) .
-
sealed π -complete, whenever each set K n c π is sealed dense in MT ( π ) .
It is not assumed here that c MT ( π ) × ( ω × 2 ) , or equivalently, K n c MT ( π ) , n .
Suppose that c is a real name. Say that a multitree p :
  • Directly forces c ( n ) = i , where n < ω and i = 0 , 1 —in case there is a multitree q K n i c such that p q ;
  • Directly forces s c , where s 2 < ω , —in case p directly forces c ( n ) = i for all n < lh ( s ) , where i = s ( n ) ;
  • Directly forces c [ T ] , where T PT —in case there is a tuple s 2 < ω T such that p directly forces s c .
Lemma 13.
Let π be a multiforcing, p MT ( π ) , n < ω , c a π -complete real name, T PT .
There exists i = 0 , 1 and a multitree q MT ( π ) , [ 0 ] q p , which directly forces c ( n ) = i .
There exists s T and a multitree q MT ( π ) , q p , which directly forces c [ T s ] .
Proof. 
See Lemma 9.2 in [18]. □
The definition of direct forcing is associated with the following notion of genericity.
Definition 13.
Suppose that π is a multiforcing. A set G MT ( π ) is π -generic if:
(1)
For any p q in MT ( π ) , p G implies q G .
(2)
If p , q G then there is r G with r p , r q .
  • Say that G is π -generic over a given π -complete real name c , if in addition
(3)
G intersects every set of the form K n c π , n < ω .
  • In this case, we define a real c [ G ] 2 ω as follows: c [ G ] ( n ) = i if G K n i c .
Lemma 14
(obvious). Suppose that π is a multiforcing and c is a π -complete real name. Let G MT ( π ) be π-generic over c . If some p G directly forces c ( n ) = i , or s c , or c [ T ] , then resp. c [ G ] ( n ) = i , s c [ G ] , c [ G ] [ T ] .
Example 4.
If ξ < ω 1 , then let x ξ be a real name such that each set K n i x ξ consists of a single multitree P n i ξ , satisfying | P n i ξ | = { ξ } (a singleton), and P n i ξ ( ξ ) = T n i , where T n i = { s 2 < ω : [ 0 ] lh ( s ) n s ( n ) = i } . Then, x ξ is a small real name, π -complete for any multiforcing π. If a set G MT ( π ) is π -generic over x ξ , then the real x ξ [ G ] is identical to the real x ξ [ G ] (see Remark 1). In other words, x ξ is a canonical name for x ξ [ G ] .

11. Sealing Real Names and Avoiding Refinements

Here, we develop the idea of Definition 11 in the context of dense sets generated by real names.
Definition 14.
Let π ϙ be multiforcings and c be a real name. We define that ϙ seals c over π,in symbol π c ϙ ,in case ϙ seals each set
K n c π = { p MT ( π ) : [ 0 ] q K n c ( p q ) } ,
over π, i.e., π K n c π ϙ , in the sense of Definition 11.
Corollary 10.
Suppose that π , ϙ , σ are regular multiforcings and c is a real name. Then:
(i)
If π c ϙ then the name c is π -complete, ( π cw ϙ ) -complete, and sealed ϙ -complete;
(ii)
If π ϙ and c is sealed π -complete, then c is sealed ϙ -complete.
Proof. 
To prove (i), (ii) apply Lemma 10 and observe that ( K n c π ) ϙ K n c ϙ . □
If π is a multiforcing then the forcing notion MT ( π ) adjoins a family of principal generic reals  x ξ = x ξ [ G ] 2 ω , ξ | π | , where every x ξ is π ( ξ ) -generic over the ground set universe. Obviously many more reals are added. The next definition provides a sufficient condition for a π -complete real name c to generate not a real of the form x ξ .
Definition 15.
Suppose that π is a multiforcing and ξ | π | . A real name c is called non-principal at ξ over π,if the next set D ξ c ( π ) is open dense in MT ( π ) :
D ξ c ( π ) = { p MT ( π ) : [ 0 ] ξ | p | and p directly forces c [ p ( ξ ) ] } .
It will be demonstrated by Theorem 5(i) below that the non-principality at ξ implies that c is not a name of the real x ξ [ G ̲ ] . Moreover, the avoidance condition in the following definition will be demonstrated to imply that c is a name of a non-generic real.
Definition 16.
Let π be a multiforcing and Y PT be a set of trees (e.g., Y = π ( ξ ) for some ξ | π | ). A real name c is said to avoid Y over π,if for each tree Q Y , the set
D Q c ( π ) = { r MT ( π ) : [ 0 ] r directly forces c [ Q ] }
is sealed dense (then open dense) in MT ( π ) in the sense of Definition 11.
Let π , ϙ be multiforcings, π ϙ , Y PT be a set of trees. We write π Y c ϙ ,if for each tree Q Y , ϙ seals the set D Q c ( π ) over π — that is formally π D Q c ( π ) ϙ .
The relation π Y c ϙ will be applied mainly in case Y = ϙ ( ξ ) for some ξ | π | .
Theorem 11.1 in [18] demonstrates that if π is a small regular multiforcing, ξ | π | , and a real name c is non-principal at ξ over π (in the sense of Definition 15) then there is a special multiforcing ϙ with π ϙ ( ξ ) c ϙ (as in Definition 16). This fact will be used in the proof of Theorem 4 below.
Lemma 15.
Let π ϙ be regular multiforcings, Y PT be a set of trees, c be a real name.
(i)
If π Y c ϙ then c avoids Y over ϙ ;
(ii)
If c avoids Y over π then c avoids Y over ϙ as well.
Proof. 
(i) Let Q Y . The set D = D Q c ( π ) ϙ is sealed dense in MT ( ϙ ) by Lemma 10(iii). However, clearly, D D Q c ( ϙ ) ; thus, the set D Q c ( ϙ ) is sealed dense in MT ( ϙ ) as well.
(ii) Let Q Y . The set D = D Q c ( π ) is sealed dense in MT ( π ) by the avoidance assumption. Thus, D ϙ is a sealed dense set in MT ( ϙ ) by Lemma 10(iii). However, clearly, ( D ϙ ) D Q c ( ϙ ) . It follows that the set D Q c ( ϙ ) is sealed dense in MT ( ϙ ) as well. □

12. Inductive Analysis of Well-Foundedness

Here, we accomplish some work related to the combinatorial description of forcing of well-founded trees. This will be applied in Part IV as a tool to define an auxiliary forcing relation for formulas in Σ 1 1 and Π 1 1 via the well-foundedness of certain trees.
A set τ MT × ω < ω is called a tree-name, if whenever s t belong to ω < ω and p MT then p , t τ p , s τ . Following Section 10, say that a multitree q MT  directly forces s τ if q 0 , s τ for some q 0 MT ( π ) such that q 0 q .
Definition 17.
Assume that π is a multiforcing and τ MT × ω < ω is a tree-name.
If p MT and s ω < ω then define
MT ( π ) p = { q MT ( π ) : [ 0 ] q p } ; W p s ( τ ) = { q MT : [ 0 ] q p j ( q directly forces s j τ ) } ; W p s ( τ , π ) = W p s ( τ ) MT ( π ) p ; W + W p s ( τ , π ) = { q MT ( π ) : [ 0 ] q W p s ( τ , π ) or q is incompatible with p } .
Let the derivative τ π τ contain all pairs p , s τ such that W p s ( τ , π ) is dense in MT ( π ) p (then clearly open dense too), so that r MT ( π ) p q W p s ( τ , π ) ( q r ) . This is equivalent to saying that W p s ( τ ) is dense in MT ( π ) below p.
Note that τ π is a tree-name. Define a descending sequence of tree-names τ π ν , ν < ω 1 , by transfinite induction, so that τ π 0 = τ , τ π ν + 1 = ( τ π ν ) π for ν < ω 1 , and τ π λ = ν < λ τ π ν for limit λ . Then, eventually τ π ν + 1 = τ π ν for some ν = ν π ( τ ) < ω 1 , and we let τ π = τ π ν for this index ν . Thus, τ π τ is a tree-name as well, and ( τ π ) π = τ π .
Lemma 16.
Let τ MT × ω < ω be a tree-names, π ϙ be regular multiforcings, and σ = π cw ϙ . Then, τ σ ν = τ ϙ ν for all ν, and accordingly τ σ = τ ϙ .
Proof. 
It suffices to prove that just τ σ = τ ϙ ; all further inductive steps are similar. Recall that MT ( ϙ ) is open dense in MT ( σ ) by Corollary 6. It follows that one and the same set W p s ( τ ) is dense in MT ( ϙ ) p if it is dense in MT ( σ ) p . □
Definition 18.
A set G MT ( π ) is π-generic over τ if G is π-generic as in Definition 13, and G intersects every set of the form W + W p s ( τ π ν , π ) , dense in MT ( π ) , where p , s τ and ν ν π ( τ ) . Put τ [ G ] = { s ω < ω : [ 0 ] p G ( p directly forces s τ ) } .
Thus, τ [ G ] is a tree is ω < ω because τ is a tree-name.
For any tree T ω < ω , let T be the pruned derivative, that consists of all s T that are not terminal nodes in T, and let T be the pruned kernel, the largest subtree S T with no terminal nodes, that consists of all s T that belong to infinite branches B T .
Lemma 17.
Assume that π is a multiforcing, τ MT × ω < ω is a tree-name, and a set G MT ( π ) is π-generic over τ. Then:
(i)
τ π [ G ] is the pruned derivative of the tree τ [ G ] ω < ω ;
(ii)
τ π [ G ] is the pruned kernel of τ [ G ] ω < ω ;
(iii)
G remains π-generic over τ π and over τ π .
Proof. 
(i) The contrary assumption results in the two following cases.
Case 1: some s τ π [ G ] is maximal in τ [ G ] . In particular, we have multitrees p G and p 0 such that p 0 , s τ π and p p 0 . By definition, the set W p 0 s ( τ ) has to be dense in MT ( π ) p 0 . Therefore, as G is generic over τ , and p G , some q W p 0 s ( τ ) belongs to G as well. By definition, q directly forces s j τ for some j < ω . Then, there is a multitree q 0 satisfying q q 0 and q 0 , s j τ . However, s j τ [ G ] , contrary to the choice of s.
Case 2: a tuple s j belongs to τ [ G ] but s does not belong to τ π [ G ] . Then, we have p 0 , s j τ , p G , p p 0 . It follows that p 0 , s τ π , and hence s τ π [ G ] , contrary to the choice of s.
Claim (ii) is a corollary of (i). To check (iii) note that τ π 1 + ν = ( τ π ) π ν for all ν . □
Corollary 11.
Under the assumptions of the lemma, let p G .
(i)
If p directly forces s τ π then τ [ G ] has an infinite chain containing s .
(ii)
If no condition q MT ( π ) , q p directly forces s τ π , then τ [ G ] is well-founded over s.
Proof. 
By Lemma 17, τ π [ G ] is the the pruned kernel of τ [ G ] . Thus, τ [ G ] includes an infinite chain containing some s τ [ G ] if s τ π [ G ] . This easily implies both items. □

13. Absoluteness of the Derivative

The key result of this section will be to show that, under certain restrictions, the pruned derivative operation introduced in Section 12 is absolute with respect to refinements of the multiforcings involved. We need, however, to introduce another property of the form of sealing of dense sets, as in Definition 11.
Definition 19.
Let π be a multiforcing, and τ MT × ω < ω is a tree-name, as in Section 12. Say that τ is sealed in π, if the following conditions hold:
(a) 
If p dom τ = { p : [ 0 ] s ( p , s τ ) } then | p | | π | ,
(b) 
If ν ν π ( τ ) , p , s τ π ν , and D = W + W p s ( τ π ν , π ) (see Section 12) is a set dense (then open dense as well) in MT ( π ) , then D is sealed dense in MT ( π ) .
Let ϙ be another multiforcing with π ϙ , so that ϙ is a refinement of π. Say that ϙ seals τ over π,symbolically π τ ϙ ,if the next two conditions hold:
(c) 
Just as (a) above;
(d) 
If ν ν π ( τ ) and p , s τ π ν , and the set D = W + W p s ( τ π ν , π ) is dense (then open dense) in MT ( π ) , then π D ϙ .
The following claims show the effect of τ in terms of Lemma 16.
Lemma 18
(obvious). Let τ MT × ω < ω be a tree-name, π τ ϙ be regular multiforcings. Then π τ π ν ϙ for all ν, and accordingly π τ π ϙ .
Theorem 3.
Let τ MT × ω < ω be a tree-name, π ϙ be regular multiforcings, π r ϙ holds for all r dom τ , and σ = π cw ϙ . Then, the following holds:
(i)
If r , s τ , then W r s ( τ , π ) ϙ W r s ( τ , ϙ ) and D r ( π ) ϙ D r ( ϙ ) ;
(ii)
If p , s τ , then the set W p s ( τ , π ) ϙ is dense in W p s ( τ , ϙ ) ;
(iii)
If τ is sealed in π, then π τ ϙ ;
(iv)
If π τ ϙ , then τ π ν = τ ϙ ν = τ σ ν for all ν, and accordingly τ π = τ ϙ = τ σ ;
(v)
If π τ ϙ , then τ is sealed in ϙ ;
(vi)
If π τ ϙ , s ω < ω , p MT , and π p q 0 ϙ (see Example 3)holds for all q 0 dom τ such that p , q 0 are π -incompatible— then the following are equivalent:
( 1 ) No multitree r MT ( π ) p directly forces s τ π ;
( 2 ) No multitree r MT ( σ ) p directly forces s τ σ ;
( 3 ) No multitree r MT ( ϙ ) p directly forces s τ ϙ .
Proof. 
(i) Let u MT ( ϙ ) belong to W r s ( τ , π ) ϙ . There is a multitree q W r s ( τ , π ) with u q . Then, q directly forces s j τ , some j, and hence, so does u ; thus, u W r s ( τ , ϙ ) .
(ii) Let u W p s ( τ , ϙ ) , meaning that u MT ( ϙ ) , u p , and also u r , where r , s j τ for some j < ω . Let X = | u | . Note that both r , p belong to dom τ ; therefore, we have π r ϙ and π p ϙ , and then π D r ( π ) D p ( π ) ϙ by Lemma 11(ii). It follows by Lemma 10(iv) that there is a ( D r ( π ) D p ( π ) ) ϙ -extendable multitree v MT ( ϙ ) , v u , with | v | = X . In other words, there are multitrees w MT ( ϙ ) with X Y = | w | and w X = v , and q D r ( π ) D p ( π ) with w q . As w v u p , r , the multitree q cannot be incompatible with p and with r . Therefore, q r , p . This implies q W p s ( τ , π ) , and hence, w q W p s ( τ , π ) ϙ . This ends the proof.
(iii) Suppose that ν ν π ( τ ) , p , s τ π ν , and the set D = W + W p s ( τ π ν , π ) is dense in MT ( π ) . Then, π D ϙ holds by Lemma 10(ii), as required.
(iv) In view of Lemmas 16 and 18, it suffices to prove τ ϙ τ π τ σ .
Step 1: τ π τ σ . Let p , s τ π . Then, p , s τ , and by definition, the set W p s ( τ , π ) is dense in MT ( π ) p . We conclude that D = W + W p s ( τ , π ) (see Section 12) is open dense in the whole MT ( π ) , and hence, π D ϙ holds. Then, D ϙ is open dense in MT ( σ ) by Lemma 10(iii),(v). Accordingly, W p s ( τ , π ) ϙ is open dense in MT ( σ ) p . Then, W p s ( τ , ϙ ) , a bigger set by (i), is open dense in MT ( σ ) p , too. Thus, p , s τ σ .
Step 2: τ ϙ τ π . Assume that p , s τ ϙ , so that p , s τ and the set W p s ( τ , ϙ ) is open dense in MT ( ϙ ) p . Then, the set W p s ( τ , π ) ϙ is dense in MT ( ϙ ) p as well by (ii). We claim that the set W p s ( τ , π ) is dense in MT ( π ) p .
Indeed, let p 1 MT ( π ) p . Then, there is q 1 MT ( ϙ ) , q 1 p 1 . By (ii), there exists a pair q 2 p 2 of multitrees p 2 W p s ( τ , π ) and q 2 MT ( ϙ ) such that q 2 q 1 . Therefore, q 2 witnesses that the multitrees p 1 , p 2 in MT ( π ) are compatible, and hence, compatible right in MT ( π ) by Corollary 2. Thus, we have established that the set W p s ( τ , π ) is at least pre-dense, and then obviously dense in MT ( π ) p , as required.
(v) Prove (b) of Definition 19 for ϙ . In view of (iv) and Lemma 18, it suffices to only consider the case ν = 0 , i.e., given p , s τ , and assuming that the set D = W + W p s ( τ , ϙ ) is dense in MT ( ϙ ) , we have to prove that D is sealed dense in MT ( ϙ ) .
By definition, the set W p s ( τ , ϙ ) is dense (then open dense) in MT ( ϙ ) p . It follows by (ii) that the set W p s ( τ , π ) ϙ is also dense in MT ( ϙ ) p . We conclude (see Step 2 above) that the set W p s ( τ , π ) itself is dense in MT ( π ) p . Then, the set E = W + W p s ( τ , π ) itself is dense in MT ( π ) p . Therefore, we have π E ϙ because π τ ϙ is assumed.
It follows by Lemma 10(iii) that E ϙ is sealed dense in MT ( ϙ ) . However, easily E ϙ D by (ii). This ends the proof that D is sealed dense in MT ( ϙ ) .
(vi) Recall that MT ( ϙ ) is dense in MT ( σ ) by Corollary 6. Therefore, (iv) implies that ( 2 ) ( 3 ) . Moreover, (iv) implies as well that ( 2 ) ( 1 ) simply because MT ( π ) MT ( σ ) . It remains to be proven that conversely ( 1 ) ( 3 ) .
Let (3) fail, that is, we assume that u MT ( ϙ ) p 0 , X = | u | , and u directly forces s τ σ . Then, by (iv) u directly forces s τ π ; hence, u q 0 holds for some q 0 with q 0 , s τ π . Thus, p , q 0 are ϙ -compatible (by u ). It follows that p , q 0 are π -compatible as well. Indeed, otherwise we have π p q 0 ϙ by the assumptions of (vi). This implies that p ϙ q is sealed by ϙ by Corollary 9. However, this contradicts the ϙ -compatibility of p , q 0 . Finally, the π -compatibility of p , q 0 means ¬ ( 1 ) . □

14. Combining Refinement Types

The properties of generic refinements considered above in Section 5, Section 8, Section 9, and Section 11 are summarized by the next definition.
Definition 20.
Let π ϙ be multiforcings and M be any set. W define π M ϙ to mean that the following conditions hold:
(1)
If ξ | π | , D π ( ξ ) , D M , D is pre-dense in π ( ξ ) , then we have π ( ξ ) D ϙ ( ξ ) ;
(2)
If D MT ( π ) , D M , D is open dense in MT ( π ) , then we have π D ϙ ;
(3)
If p M MT and | p | | π | , then π p ϙ ;
(4)
If p , q M MT , | p | | q | | π | , and p , q are π -incompatible, then π p q ϙ ;
(5)
If c M and c is a π -complete real name then we have π c ϙ ;
(6)
If c M is a π -complete real name, non-principal at ξ | π | over π , then π ϙ ( ξ ) c ϙ ;
(7)
If τ M , τ MT × ω < ω is a tree-name, then π τ ϙ .
Corollary 12.
Let M be a countable set, π , ϙ , δ be regular multiforcings, and π M ϙ δ . Then, π M ( ϙ cw δ ) and ( π cw ϙ ) M δ .
Proof. 
Our basic reference is Lemma 12(i)(iv), which has to be applied for those sets D involved in the definition of π M ϙ above (Definition 20). □
This follows a refinement existence result.
Theorem 4.
If π is a small regular multiforcing and M a countable set, then there exists a special multiforcing ϙ satisfying | π | = | ϙ | and π M ϙ .
Proof (sketch).
The proof is based on some rather difficult results in [18] which we make use of here without proofs.
First of all, we can assume that M HC = all hereditarily countable sets , since all elements in M HC are irrelevant. Let M HC be the (countable) set containing π , M , every ξ | π | , and every element of M. Let M + contain all sets X HC , -definable over HC, with sets in M allowed as parameters.
Definition 7.1 in [18] introduces the notion of M -generic refinements. Lemma 7.2 and Theorem 7.3 in [18] prove the existence of a special multiforcing ϙ , which satisfies | ϙ | = | π | and is an M -generic refinement of a given small regular multiforcing π . If ϙ is such, then Theorem 8.1 in [18] proves the relation π D old ϙ , and hence, π D ϙ , for all open dense sets D M + , D MT ( π ) . This implies (1)–(5) and (7) of Definition 20 because all dense sets involved there belong to M + by construction.
Finally, (6) of Definition 20 is separately established by Theorem 11.1 in [18]. We may note that (6) of Definition 20 differs from other items of this definition in that the list of the dense sets involved depends on the new multitree ϙ (the one claimed to exist). Therefore, it needs a special theorem in [18], namely Theorem 11.1. □

15. Consequences for Generic Extensions

Lemma 19 shows that real names provide a suitable representation of reals in MT ( π ) -generic extensions. Then, corollaries for non-principal names will be the subject of Theorem 5.
Lemma 19.
Assume that π is a regular multiforcing in the ground set universe V , and G MT ( π ) is a MT ( π ) -generic set over V .
(i)
If x 2 ω is a real in V [ G ] then there exists a π -complete real name c V , c MT ( π ) × ω × 2 , satisfying x = c [ G ] .
(ii)
Let MT ( π ) be a CCC forcing in V , and c V , c MT ( π ) × ω × 2 be a π -complete real name. Then, there exists a small π -complete real name d V , d MT ( π ) × ω × 2 , such that every condition in MT ( π ) forces the equality c [ G ̲ ] = d [ G ̲ ] over V .
As usual, the CCC property means here that every π -antichain (i.e., antichain in MT ( π ) , see Definition 9 and Corollary 2) A MT ( π ) is at most countable.
Proof. 
Claim (i) is a partial case of a general forcing theorem. To prove claim (ii), consider open dense set K n c π = { p MT ( π ) : [ 0 ] q K n c ( p q ) } , choose maximal antichains A n K n c π in those sets, note that each A n is countable by CCC, and finally, define d = { p , n , i : [ 0 ] p A n i } , where A n i = { p A n : [ 0 ] q K n i c ( p q ) } . □
Theorem 5.
Suppose that π is a regular multiforcing, and ξ | π | . Then, the following holds.
(i)
If MT ( π ) is a CCC forcing, G MT ( π ) is a set generic over the ground set universe V , x 2 ω is a real in V [ G ] , and x x ξ [ G ] , then there exists a small π -complete real name c MT ( π ) × ( ω × 2 ) , non-principal at ξ over π, satisfying x = c [ G ] .
(ii)
If c MT ( π ) × ( ω × 2 ) is a π -complete real name that avoids π ( ξ ) over π, ϙ is a regular multiforcing, π ϙ , and G MT ( π cw ϙ ) is generic over V , then c [ G ] Q π ( ξ ) [ Q ] .
Proof. 
(i) By a general forcing theorem, there exists a π -complete real name c such that x = c [ G ] and MT ( π ) forces that c x ξ [ G ̲ ] . We can assume that c is small, by Lemma 19 (as MT ( π ) is CCC). Let us prove that c is non-principal at ξ over π , meaning that the set
D ξ c ( π ) = { p MT ( π ) : [ 0 ] p directly forces c [ p ( ξ ) ] } .
is open dense in MT ( π ) . As the openness is clear, it remains to prove the density.
Let q MT ( π ) . Then, by the choice of c , q MT ( π ) -forces c x ξ [ G ̲ ] . Thus, we may assume that, for some n, the inequality c ( n ) x ξ [ G ̲ ] ( n ) is MT ( π ) -forced by q . By Lemma 13, there is a tuple s ω n + 1 and a multitree p MT ( π ) , p q , such that p directly forces the sentence s c . It remains to be checked that s p ( ξ ) . Indeed, assume otherwise: s p ( ξ ) . Then, the tree T = p ( ξ ) s belongs to MT ( π ) . Define a multitree r by r ( ξ ) = T and r ( ξ ) = p ( ξ ) for all ξ ξ . Then, r MT ( π ) and we have r p q . However, r directly forces both c ( n ) and x ξ [ G ̲ ] ( n ) to be equal to the same number = s ( n ) , which contradicts the choice of n.
(ii) Suppose towards the contrary that Q π ( ξ ) and c [ G ] [ Q ] . Lemma 15 (ii) implies that c avoids π ( ξ ) over ϙ as well. Lemma 10 implies that the set D Q c ( π ) ϙ is open dense in MT ( π cw ϙ ) . Therefore, the set D Q c ( π ) itself is pre-dense in MT ( π cw ϙ ) . We conclude that G D Q c ( π ) by the genericity, so that some multitree r G directly forces c [ Q ] . It follows that c [ G ] [ Q ] , which is a contradiction. □
  • Part III: The Forcing and the Model
Here, we present the key forcing constructions of the proof of Theorem 1.
We consider the constructible universe L as the ground model.
Fix a natural number n 3 as in Theorem 1.
Theorem 6 in Section 19 introduces a ω 1 -long -increasing sequence Π L of special multiforcings, whose properties include: first, sealing many dense sets during the course of the construction; second, a sort of definable genericity in L ; and third, a definability requirement—as in Definition 23. The subsequent key forcing notion P L (which depends on Π ) is defined in Section 20. Its properties include CCC by Theorem 7. Then, we consider P -generic extensions of L , called key models. The main results about key models are Theorem 8, which characterizes generic reals, and Theorem 9, which provides a Δ n 1 -good well-ordering, with (i) of Theorem 1 as a consequence. Along with Theorem 7, they are the main results of this Part.
We begin with routine stuff on -increasing sequences of special multiforcings.

16. Increasing Sequences of Multiforcings

Based on Remark 2, we consider -increasing sequences of multiforcings. Let
MFsp = { π MF : [ 0 ] π is a special , hence small multiforcing } .
Thus, a multiforcing π MF (the set of all multiforcings) belongs to MFsp if | π | ω 1 is finite or countable and each π ( ξ ) , ξ | π | , is a special forcing. (See Section 3 and Section 6).
  • If κ ω 1 , then let MF κ be the set of all -increasing sequences π = π α α < κ of multiforcings π α MFsp , of length  dom ( π ) = κ , which are domain-continuous, so that if λ < κ is a limit ordinal then | π λ | = α < λ | π α | .
  • Let MF = κ < ω 1 MF κ ( -increasing sequences of countable length).
  • The set MF MF ω 1 is ordered by the relations ⊆, ⊂ of extension of sequences. Thus, π ϙ means that a sequence ρ properly extends π .
  • If π MF κ , then let cw π = α < κ cw π α (the component-wise union), MT ( π ) = MT ( π ) , | π | = | cw π | : = α < κ | π ( α ) | (a subset of ω 1 ).
Lemma 20.
Assume that π MF κ and 0 < γ < λ < κ . Let π α = π ( α ) for all α. Then:
(i)
The multiforcings π = α < κ cw π α , π < μ = α < μ cw π α , π μ = μ α < κ cw π α , π > μ = μ < α < κ cw π α are regular, and we have: π < μ π μ π > μ , π < μ π μ , and π μ π λ ;
(ii)
The set MT ( π μ ) is pre-dense in MT ( π ) and MT ( π μ ) is dense in MT ( π ) .
Proof. 
To prove (i),(ii) apply Lemma 5. □
The following is a related form of -type definitions.
Definition 21.
Let π MF κ , ϙ MF λ , κ < λ , and M be any set. Define π M ϙ , if π ϙ (i.e., ϙ extends π) and cw π M ϙ ( κ ) , where cw π = α < κ cw π ( α ) is the component-wise union and ϙ ( κ ) is the first term in ϙ absent in π .
Lemma 21.
Assume that M is a countable set. Then:
(i)
If κ < λ < ω 1 and π MF κ , then there exists a sequence ϙ MF λ such that π M ϙ ;
(ii)
If κ < λ ω 1 , π MF κ , ϙ MF λ , π M ϙ , and a set D M is open dense in MT ( π ) , then π = cw π D ϙ κ = κ α < λ cw ϙ ( α ) , so that D is pre-dense in MT ( ϙ ) .
Proof. 
(i) Let π = cw π . By Theorem 4, there is a special multiforcing σ satisfying | π | = | σ | and π M σ , where M = M { D α : [ 0 ] α < κ } and
D α = π ( α ) π = { p MT ( π ) : [ 0 ] q MT ( π ( α ) ) ( p q ) } .
Each D α is open dense in MT ( π ) because MT ( π ( α ) ) is pre-dense by Lemma 20(ii). Then, using Theorem 4 for M = { D α : [ 0 ] α < γ } in iteration, we define by transfinite induction special multiforcings σ γ , κ γ < λ , such that σ 0 = σ and the sequence σ = σ γ κ γ < λ is just -increasing. Now, let ϙ = π σ , that is, ϙ ( α ) = π ( α ) for α < κ but ϙ ( γ ) = σ γ for κ γ < λ . Then, ϙ MF λ and π M ϙ by construction.
(ii) We have π M ϙ κ by Corollary 12, hence in particular π D ϙ κ . It follows by Lemma 10(iii) that D is a pre-dense set in MT ( π cw ϙ κ ) = MT ( ϙ ) . □

17. Definability Lemma

Recall that HC is the set of all hereditarily countable sets. Thus, X HC if the transitive closure  TC ( X ) is at most countable. Note that HC = L ω 1 under V = L .
We use the standard notation Σ n HC , Π n HC , Δ n HC (slanted lightface Σ , Π , Δ )for classes of parameter-free definability in HC (no parameters allowed), and Σ n ( HC ) , Π n ( HC ) , Δ n ( HC ) for full definability in HC (parameters from HC allowed). We will make use of the following known result, see e.g., Lemma 25.25 in Jech [24]: if X 2 ω and n 1 then
X Σ n HC X Σ n + 1 1 , and X Σ n ( HC ) X Σ n + 1 1 ,
and similar equivalences for the classes Π , Π , Δ , Δ instead of Σ , Σ .
Lemma 22
(in L ). The following ternary relation belongs to the class Δ 1 HC = Δ 1 L ω 1 :
π , ϙ MF M HC π M ϙ .
Proof. 
Note first of all that MF HC , so that the claim makes sense. The proof goes on by routine verification that all sets and relations involved are definable by Δ 0 formulas, i.e., those with only bounded quantifiers over suitable countable sets such as ω or 2 < ω , despite the fact that their prima facie definitions may include quantifiers over uncountable sets such as 2 ω . Consider for instance the relation
C ( S , T ) : = S , T PT [ S ] [ T ] is clopen in [ S ] ,
that participates in several definitions, e.g., in the definition of regular arboreal forcing (Definition 2), in the definition of refinements in Section 4, etc. We observe that, because of the compactness of 2 ω , if S , T PT then for [ S ] [ T ] to be clopen in [ S ] it is necessary and sufficient that there exists a finite set U S such that
t U S t = { r S T : [ 0 ] ( S T ) r is infinite } ,
and this condition is obviously Δ 0 . Thus, this implies that the refinement relations ⊏ and D between arboreal forcings (Section 4 and Section 5) are definable by Δ 0 formulas.
To check that π D ϙ as a ternary relation (Definition 11) is definable by Δ 0 formula, it suffices to prove the Δ 0 definability of the relation [ u ] v D [ v ] (see the beginning of Section 8), where it is assumed that u MT , D MT is finite, and | v | = | u | for all v D . Then, the relation [ u ] v D [ v ] is equivalent to the following:
if s ξ u ( ξ ) for all ξ | u | then there is v D such that s ξ v ( ξ ) for all ξ | u | .
However, this condition is Δ 0 as required. □

18. Auxiliary Diamond Sequence

We argue in L . Let us recall the technique of diamond sequences in L .
Lemma 23
( ω 1 in L ). There is a Δ 1 HC sequence S α α < ω 1 of sets S α α , such that
(∗)
if X ω 1 then the set { α < ω 1 : [ 0 ] S α = X α } is stationary in ω 1 ,so that it has a non-empty intersection with each club (i.e., a closed unbounded set)  C ω 1 .
Proof. 
The existence of a sequence satisfying (∗) is the diamond principle  ω 1 , see ([24], Theorem 13.21). The Δ 1 HC -definability (see is achieved by taking the L -least possible S α at each step α , where L is the Gödel’s well-ordering of L , see ([24], p. 558). □
Definition 22
(in L ). We fix a sequence S α α < ω 1 given by Lemma 23.
We let c α = α th element of HC = L ω 1 in the sense of L ; thus HC = { c α : [ 0 ] α < ω 1 } .
If Z HC and α < ω 1 then let ( Z ) < α = { c ξ Z : [ 0 ] ξ < α } .
If α < ω 1 then let A α = { c ξ : [ 0 ] ξ S α } . Then, A α α < ω 1 is still a Δ 1 HC sequence.
Let A α n = { a : [ 0 ] n , a A α } .
Let M ( α ) = { A α n : [ 0 ] n < ω } . Then, M ( α ) α < ω 1 is still a Δ 1 HC sequence.
An ordinal γ < κ is a crucial ordinal for a sequence π = π α α < κ MF κ if the relation ( α < γ cw π α ) M ( γ ) π γ holds. This is equivalent to π γ M ( γ ) π .
We obtain the following lemma as an easy corollary.
Lemma 24
(in L ). (i) If Z HC then the set W = { α < ω 1 : [ 0 ] A α = ( Z ) < α } is stationary.
(ii) If Z n HC for all n then the set W = { α < ω 1 : [ 0 ] n ( A α n = ( Z n ) < α ) } is stationary.
Proof. 
To prove (i), let X = { α < ω 1 : [ 0 ] c α Z } . The set W = { α < ω 1 : [ 0 ] S α = X α } is then stationary. However, easily W = W . To prove (ii) put Z = { n , x : [ 0 ] n < ω x Z n } and apply (i). □

19. The Key Sequence

The next theorem (Theorem 6) is a crucial step towards the construction of the forcing notion that will prove Theorem 1. The construction employs some ideas related to definable generic transfinite constructions, and it will go on by a transfinite inductive definition of a sequence Π MF ω 1 in L from countable subsequences. The result can be viewed as a maximal branch in MF , generic with respect to all sets of a given complexity.
Definition 23
(in L ). From now ona number n 3 as in Theorem 1 is fixed.
A sequence π MF blocks a set W if either π belongs to W (a positive block) or no sequence ϙ W MF extends π (a negative block).
Any sequence = α α < ω 1 MF ω 1 L , satisfying (in L ) the following four conditions (A)–(D) for this n , will be called a key sequence:
(A) 
The set | | = α < κ | ( α ) | is equal to ω 1 .
(B) 
Every γ < ω 1 is a crucial ordinal for   in the sense of Definition 22.
(C) 
If in fact n 4 and W MF is a boldface Σ n 3 ( HC ) set (a definition with parameters), then there exists an ordinal γ < ω 1 such that the subsequence γ blocksW — so that either γ W , or there is no sequence ϙ W extending γ .
(D) 
The sequencev belongs to the definability class Δ n 2 HC .
Theorem 6
(in L ). There exists a key sequence = α α < ω 1 MF ω 1 .
Proof. 
We argue under V = L , with n 3 fixed. In case n 4 , let un n ( p , x ) be a universal Σ n 3 formula. In other words, the collection of all boldface Σ n 3 ( HC ) sets X HC is equal to the family of all sets of the form Υ n ( a ) = { x HC : [ 0 ] HC un n ( a , x ) } , a HC .
Claim 1.
If n 4 then { π , a : [ 0 ] π MF a HC π blocks Υ n ( a ) } is a Δ n 2 HC set.
Proof (Claim).
We skip a routine verification that MF is Δ 1 HC . Further, if π MF and a HC then for π to block Υ n ( a ) it is necessary and sufficient that
π Υ n ( a ) Σ n 3 HC ¬ ϙ ϙ MF ϙ extends π Δ 1 HC ϙ Υ n ( a ) Σ n 3 HC Π 3 HC .
This is a disjunction of Σ n 3 HC and Π n 3 HC , hence, Δ n 2 HC , and we are finished. □
Coming back to the proof of the theorem, a sequence π [ α ] MF is defined by induction on α < ω 1 . To begin with, we put π [ 0 ] = (the empty sequence).
Step α α + 1 . Assume that π [ α ] MF is already defined. Put κ = dom π [ α ] , M = M ( α ) , and let p α be the α -th element of HC = L ω 1 in the sense of the Gödel well-ordering L of L .By Lemma 21(i), there is a sequence τ MF κ + 1 with π [ α ] M τ , and then a sequence ϙ MF κ + 2 with τ ϙ . If α | ϙ ( κ + 1 ) | then we trivially extend the last term ϙ ( κ + 1 ) of the construction by ϙ ( κ + 1 ) ( α ) = P coh (see Example 1).
Finally if n 4 then there is a sequence π MF satisfying ϙ π and blocking the set Υ n ( p α ) , while if n = 3 then simply put π = ϙ .
Thus, overall we have:
(∗)
π [ α ] M π , κ + 1 < dom π , α | ϙ ( κ + 1 ) | , and π blocks Υ n ( p α ) in case n 4 .
Finally we let π [ α + 1 ] be the L -least one of all sequences π MF satisfying (∗).
Note the role of the blanket assumption V = L in this construction (step α α + 1 ); otherwise, the L -least choice of π [ α + 1 ] could not be executed.
Limit step.
If λ < ω 1 is a limit ordinal then we obviously define π [ λ ] = α < λ π [ α ] .
We have α < β π [ α ] π [ β ] by construction; hence, = α π [ α ] MF ω 1 .
Let us check (D) of Definition 23. Note first of all that the relation R ( π , ϙ , M ) : = π M ϙ is Δ 1 HC by Lemma 22. Easily “to block Υ n ( p ) ” is a Δ n 2 HC relation by Claim 1 above. On the other hand, it is known that choosing the L -least element in each non-empty section of a Δ k HC set under V = L results in a set (transversal) of the same class Δ k HC . Therefore, the assignment α M ( α ) is Δ 1 HC as well. With these estimations, a routine calculation shows that the relation (∗) still is a Δ n 2 HC relation (in L ). This helps to easily accomplish the verification of (D), which we leave to the reader.
To check (A) of Definition 23, note that α | cw π [ α + 1 ] | by construction.
To check (C) of Definition 23 ( n 4 ), note that any boldface Σ n 3 ( HC ) set W MF is equal to Υ n ( p α ) for some α < ω 1 , so γ = dom π [ α + 1 ] is as required.
Finally, (B) holds by by construction. □
Definition 24
(in L ). From now on we fix a key sequence = α α < ω 1 MF ω 1 , given by Theorem 6 for the number n 3 fixed by Definition 23. It satisfies (A)–(D) of Definition 23. We call this fixed Π L the key sequence.
Lemma 25.
Assume that n 4 . Let W MF be a Σ n 3 ( HC ) set dense in MF . Then, there exists an ordinal γ < ω 1 satisfying γ W .
Proof. 
By (C) of Definition 23, γ blocks W for some ordinal γ < ω 1 . The negative block is rejected because W is dense. Therefore, γ W . □

20. The Key Forcing Notion

Based on Definition 24, we introduce some derived notions.
Definition 25
(in L ). Using the key sequence = α α < ω 1 ,we define the regular multiforcing = α < ω 1 cw α MF , and the forcing notion P = MT ( Π ) = MT ( ) .
We put P α = MT ( α ) , < γ = α < γ cw α , P < γ = MT ( < γ ) = MT ( γ ) = γ < α P γ .
We also put γ = γ α < ω 1 cw α .
If ξ < ω 1 , then, following (A) of Definition 23, we let α ( ξ ) < ω 1 be the smallest ordinal α with ξ | α | . Thus, an arboreal forcing notion α ( ξ ) AF is defined whenever the inequality α ( ξ ) α < ω 1 holds. Moreover, α ( ξ ) α ( ξ ) α < ω 1 is a -increasing sequence of special forcings α ( ξ ) AF , thus ( ξ ) = α ( ξ ) α < ω 1 α ( ξ ) AF .
We will call the key multiforcing below, and accordingly the set P = MT ( ) will be our key forcing notion.The following lemmas present principal properties of P in the ground universe L , and of according P -generic models in the next section.
Lemma 26
(in L ). The sequences α ( ξ ) ξ < ω 1 (of ordinals) and α ( ξ ) ξ < ω 1 , α ( ξ ) α < ω 1 (of arboreal forcings) belong to the definability class Δ n n 2 HC .
Proof. 
The following double equivalence
α < α ( ξ ) π ( π = Π α ξ dom π ) π ( π = Π α ξ dom π ) .
holds by construction. Yet, “ π = α ” is a Δ n 2 HC formula by (D) of Definition 23. Therefore, the sequence α ( ξ ) ξ < ω 1 is Δ n 2 HC as well. The other sequence is treated similarly. □
Lemma 27
(in L ). (i) α ( ξ ) is pre-dense in ( ξ ) whenever ξ < ω 1 and α ( ξ ) α < ω 1 .
(ii) Π is a regular multiforcing and | | = ω 1 , thus P = ξ < ω 1 ( ξ ) (finite support).
(iii) C = { γ < ω 1 : [ 0 ] | < γ | = γ } is a club (closed unbounded) in ω 1 , where < γ = α < γ cw α .
Proof. 
(i), (ii) Use Lemma 5. To check that | Π | = ω 1 recall (A) of Definition 23.
(iii) is clear. □
The next lemma claims that P satisfies CCC.
Theorem 7
(in L ). The forcing notion P satisfies CCC. Therefore P -generic extensions of L preserve cardinals.
Proof. 
Let Z P be a maximal antichain. Then, D = { p P : [ 0 ] q Z ( p q ) } is open dense in P . In terms of Definition 22, the set C of all limit ordinals γ < ω 1 , such that
(∗)
( Z ) < γ = Z P < γ , ( Z ) < γ is a maximal antichain in P < γ = MT ( γ ) , ( D ) < γ is open dense in P < γ , and the equality ( D ) < γ = { p P < γ : [ 0 ] q ( Z ) < γ ( p q ) } holds,
is a club. Therefore, by Lemma 24(ii), there is an ordinal γ C such that ( Z ) < γ = A γ 0 and ( D ) < γ = A γ 1 , and hence ( D ) < γ M ( γ ) .
Note that Π < γ M ( γ ) Π γ , or equivalently γ M ( γ ) , by (B) of Definition 23.
However, D = ( D ) < γ M ( γ ) is open dense in P < γ by (*). Therefore, Lemma 21 implies that D remains pre-dense in the whole set P = MT ( ) , and hence, A = ( A ) < γ itself by remains a maximal antichain in P . We conclude that A = A is countable. □
Corollary 13
(in L ). Let a set D P be pre-dense in P . There is an ordinal γ < ω 1 such that D P < γ is already pre-dense in P .
Proof. 
We can w. l. o. g. assume that D is even dense. Let A D be a maximal antichain in D. Then, A is a maximal antichain in P since D is dense. Then, A P < γ for some ordinal γ < ω 1 by Theorem 7. However, A is pre-dense in P . □

21. The Key Model

We aim to prove Theorem 1 using P -generic extensions of L , which we call key models.We will mostly argue in L and in ω 1 L -preserving generic extensions, in particular, in P -generic extensions of L (cardinal-preserving by Theorem 7). Therefore, we will always have ω 1 L = ω 1 . This allows us to view things so that | | = ω 1 (rather than ω 1 L ).
Definition 26.
Let a set G P be generic over the constructible set universe L . If ξ < ω 1 , then, following the remark in the end of Section 6,
-
We put G ( ξ ) = { p ( ξ ) : [ 0 ] p G and ξ | p | } ( ξ ) ;
-
We define x ξ = x ξ [ G ] 2 ω as the unique real which belongs to T G ( ξ ) [ T ] ;
-
We finally let X = X [ G ] = x ξ [ G ] ξ < ω 1 = { ξ , x ξ [ G ] : [ 0 ] ξ < ω 1 } .
To conclude, the forcing notion P adjoins an array X [ G ] of reals x ξ [ G ] to L , where every real x ξ = x ξ [ G ] 2 ω L [ G ] is ( ξ ) -generic over L , and we have L [ G ] = L [ X [ G ] ] .
Theorem 8.
Assume that a set G P is P -generic over L , ξ < ω 1 , and x L [ G ] 2 ω . Then, the following statements are equivalent:
(1)
x = x ξ [ G ] ;
(2)
the real x is ( ξ ) -generic over L ;
(3)
we have x α ( ξ ) α < ω 1 T α ( ξ ) [ T ] .
Proof. 
The implication (1) (2) is routine (see Remark 1). To check (2) (3) note that, by Lemma 27, all sets Π α ( ξ ) are pre-dense in Π ( ξ ) . Finally, prove .
Suppose that x L [ G ] 2 ω but x x ξ [ G ] , i.e., (1) fails. As P = MT ( Π ) is CCC by Theorem 7, Theorem 5(i) implies the existence of a small -complete real name c L , such that x = c [ G ] , c P × ω × 2 , and c is non-principal at ξ over , meaning that
D = D ξ c ( ) = { p P = MT ( Π ) : [ 0 ] p directly forces c [ p ( ξ ) ] }
is a set open dense in P = MT ( ) . By the smallness, c is a < γ 0 -complete real name for some ordinal γ 0 < ω 1 .
In terms of Definition 22, the set C of all limit ordinals γ < ω 1 , such that
(∗)
γ γ 0 and the set ( D ) < γ satisfies ( D ) < γ = D P < γ and is open dense in P < γ ,
is a club. Therefore, by Lemma 249ii), there is an ordinal γ C such that ( D ) < γ = A γ 0 M ( γ ) and c = A γ 1 M ( γ ) . Then, c is non-principal at ξ over Π < γ . On the other hand, < γ M ( γ ) γ , by (B) of Definition 23. It follows that < γ M ( γ ) γ by Lemma 21(ii). Then, we have < γ ξ c γ as well by Definition 20(6), since c M ( γ ) and because of the non-principality of c .
Now, Theorem 5(ii) with π = < γ and ϙ = γ implies x = c [ G ] Q γ ( ξ ) [ Q ] . (We observe that π cw ϙ = ).
In particular, x does not belong to Q γ ( ξ ) [ Q ] . Thus, (3) fails, as required. □
Corollary 14.
Let a set G P be P -generic over L . Then, it holds in L [ G ] that X [ G ] belongs to the definability class Π n 2 HC , and hence, to class Π n 1 1 by (1) of Section 20.
Proof. 
By Theorem 8, it is true in L [ G ] that ξ , x X [ G ] if and only if
α < ω 1 T α ( ξ ) α ( ξ ) α x [ T ] ,
which can be re-written as
μ < ω 1 α < ω 1 Y T Y Y = α ( ξ ) μ = α ( ξ ) μ α x [ T ] .
Note that the equalities μ = α ( ξ ) and Y = α ( ξ ) belong to the class Δ n 2 HC by Corollary 26. This implies that the whole relation is Π n 2 HC , since the quantifier T Y is bounded. □

22. Well-Orderings in the Key Model

According to the following theorem, the key model satisfies (i) of Theorem 1. The reals are treated as points of 2 ω , the Cantor space. The proof see Theorem 2 in [1].
Theorem 9.
Assume that a set G P is P -generic over L . Then, in L [ G ] , there is a Δ 1 -good well-ordering of 2 ω of length ω 1 , and hence (i) of Theorem 1 holds.
Our final step is to prove the result complementary to Theorem 9, that is, the key model also fulfills (ii) of Theorem 1. This will need some more effort. We will argue under the following assumption.
Assumption 1.
We assume that n 4 from now on.
This leaves aside the case n = 3 in (ii) of Theorem 1. Therefore, this case requires a separate consideration to justify the assumption. Assume that n = 3 . We assert that (ii) of Theorem 1 holds in L [ G ] (which is the key model), where G is an arbitrary set P -generic over L . Suppose towards the contrary that (ii) of Theorem 1 fails, so that there is a Δ 2 1 well-ordering of the reals. (We even do not assume that the well-ordering is good). Then, Theorem 25.39 in [24] implies that 2 ω L [ x ] in L [ G ] for some real x 2 ω in L [ G ] . Yet this cannot be the case for the key models L [ G ] we consider.
Indeed, arguing in L [ G ] , suppose to the contrary that x 2 ω L [ G ] = L [ x ξ [ G ] ξ < ω 1 ] and 2 ω L [ G ] L [ x ] . Theorem 7 then implies that there exists an ordinal λ < ω 1 = ω 1 L satisfying x L [ x ξ [ G ] ξ < λ ] . However, the real y = x λ [ G ] does not belong to L [ x ξ [ G ] ξ < λ ] by the product forcing theory. We conclude that y L [ x ] , which contradicts the choice of x.
  • Part IV: Non-existence of Simpler Well-orderings
Claim (ii) of Theorem 1 involves one more important technical tool related to the above-defined key forcing notion P . It turns out that the P -forcing relation of Σ n 1 1 formulas is equivalent (up to level n 1 of the projective hierarchy of formulas) to a certain auxiliary forcing relation forc defined and studied in Section 23, Section 24, Section 25, Section 26, Section 27, Section 28, Section 29 and Section 30 below. Theorem 11 proves the equivalence. This auxiliary forcing is invariant with respect to permutations of indices ξ < ω 1 (Theorem 12), whereas the forcing P itself is, generally speaking, not invariant in that sense. Such a hidden invariance plays a crucial role in the construction. Here, we make use of the invariance to prove, using Theorem 13, that the full version of (ii) holds in P -generic extensions of L . Theorems 11–13 are the main results of this Part.

23. Auxiliary Forcing Relation

We argue in L . We make use of the second-order arithmetic language. It involves variables k , l , m , n , (type 0) assumed to run over ω , and variables a , b , x , y , (type 1) over 2 ω . The atomic formulas are only those of the form x ( k ) = n . Consider the extension L of this language, which allows us to substitute natural numbers for variables of type 0, and small real names (Definition 12) c L for variables of type 1.
  • We define natural classes L Σ n 1 , L Π n 1 of L -formulas, as usual.
  • Given a formula φ in L Σ n 1 (resp., L Π n 1 ), let φ bethe result of canonical transformation of ¬ φ to the L Π n 1 (resp., L Σ n 1 ) form.
Now, we introduce a relation p forc π φ between multitrees p , small multiforcings π MF , and closed L -formulas φ in L Σ n 1 L Π n 1 , n 1 , which will approximate the true P -forcing relation. The definition proceeds by induction on the L -structure of φ .
1°.
Let π be a small regular multiforcing, p MT (not necessarily p MT ( π ) ), and φ be a closed L Σ 1 1 formula. We assume that φ has the following canonical Σ 1 1 form:
(f1)
φ : = x m R ( x m , c 1 m , , c k m ) , where R ( ω < ω ) k + 1 is a recursive relation and every c i MT × ( ω × 2 ) is a small real name.
  • Consider a tree-name τ = τ ( R ) which consists of allpairs q , s MT × ω < ω such that there exist tuples t 1 , , t k ω m , where m = lh ( s ) , and multitrees r j i K j , t i ( j ) c i , 1 i k , j < m (see Definition 12), satisfying:
    (I)
    R ( s n , t 1 n , , t k n ) for all n m ;
    (II)
    q is equal to the multitree 1 i k , j < m cw r j i —see Section 6 on cw , therefore q satisfies q r j i for all i , j , and hence q directly forces t i c i for all 1 i k .
    We define p forc π φ ifthe following conditions (a)–(d) and (e1) hold:
(a)
Every q dom τ is sealed by π (see Example 2);
(b)
If q dom τ and p π q then p π q is sealed by π (see Example 3);
(c)
Every name c i in φ is sealed π -complete (see Definition 12);
(d)
τ = τ ( R ) is sealed in π (see Definition 19);
(e1)
p directly forces Λ τ π , i.e., there is a multitree p 0 p with p 0 , Λ τ π .
2°.
Let π be a small regular multiforcing, p MT (not necessarily p MT ( π ) ), and ψ be a closed L Π 1 1 formula. We assume that ψ has the following canonical Π 1 1 form
(f2)
ψ : = x m ¬ R ( x m , c 1 m , , c k m ) , where R ( ω < ω ) k + 1 is a recursive relation and every c i is a small real name.
  • We define a tree-name τ = τ ( R ) as above. Then, define p forc π ψ ifconditions (a)–(d), as above, hold and the following condition (e2) holds too instead of (e1) above:
(e2)
if p 1 MT ( π ) , p 1 p , then p 1 does not directly force Λ τ π .
3°.
If φ ( x ) is a L Π n 1 formula, n 1 , then we define p forc π x φ ( x ) if and only if there exists a small real name c such that p forc π φ ( c ) .
4°.
If φ is a closed L Π n 1 formula, n 2 , then define p forc π φ if and only if there is no special multiforcing ϙ and p MT ( ϙ ) such that π ϙ , p p , and p forc ϙ φ .
Remark 3.
If p forc π φ holds then it is not necessary that p MT ( π ) , and it is not necessary that every name c in φ satisfies c MT ( π ) × ( ω × 2 ) .
Definition 27.
Given a class K of the form L Σ n 1 , L Π n 1 ( n 1 ), we let FORC [ K ] contain all triples π , p , φ satisfying p forc π φ .
Then, FORC [ K ] is a subset of HC . Recall that if V = L then HC = L ω 1 .
Lemma 28
(in L ). FORC [ L Σ 1 1 ] and FORC [ L Π 1 1 ] belong to Δ 1 HC .
Given any n 2 , FORC [ L Σ n 1 ] belongs to Σ n 1 HC and FORC [ L Π n 1 ] belongs to Π n 1 HC .
Proof. 
Relations such as “being a small regular multiforcing”, “being a formula in L Σ n 1 , L Π n 1 ”, p MT ( π ) , etc., are definable in HC = L ω 1 by bounded formulas, hence Δ 1 HC . Such also are the operations R τ ( R ) , and τ τ π , τ τ π (provided π is small, as in 1°, 2°). This wraps up the Δ 1 HC estimation for the cases of L Σ 1 1 and L Π 1 1 .
The inductive step by 3° is quite simple.
Now, for the step by 4°, assume that n 2 , and FORC [ L Σ n 1 ] Σ n 1 HC is already established. Then, π , p , φ FORC [ L Π n 1 ] if π is a small regular multiforcing, p MT , φ is a closed L Π n 1 formula, and, by 4°, there is no triple ϙ , p , ψ FORC [ L Σ n 1 ] such that ϙ is a special multiforcing, π ϙ , p MT ( ϙ ) , p p , and ψ is φ . This clearly implies the estimation Π n 1 HC of FORC [ L Π n 1 ] as required. □

24. Elementary Properties of the Auxiliary Forcing

We still argue in L .
Lemma 29.
Assume that π ϙ are small regular multiforcings, p , p MT , p p , φ is an L -formula. Then p forc π φ implies p forc ϙ φ .
Proof. 
If φ is a formula in L Σ 1 1 as in 1° of Section 23, and p forc π φ , which is witnessed by (a)–(d) and (e1), then q forc ϙ φ also holds.
Indeed, condition (a) transfers from π to ϙ by Corollary 8(i), (ii).
Condition (b) transfers to ϙ by Corollary 9(i)(ii) (with same p ) and (iii) (to p p ).
Condition (c) transfers to ϙ by Corollary 10 (ii).
Condition (d) transfers to ϙ by Theorem 3(iii)(v).
Finally, (e1) transfers to ϙ because τ π = τ ϙ by Theorem 3 (iv).
The L Π 1 1 case is rather similar, yet the transfer of (e2) from π to ϙ deserves attention. Note that all premises of Theorem 3(vi) hold for π , ϙ , p , and s = Λ . That is, π τ ϙ holds by Theorem 3(iii) and (d), whereas π p q 0 ϙ holds for all q 0 dom τ , π -incompatible with p , by Corollary 9(i) and (b).
Now, condition (e2) for π and p means that (1) of Theorem 3(iv) fails for π , p , and s = Λ . Therefore, (3) fails as well, that is, no p 1 MT ( ϙ ) , p 1 p , directly forces Λ τ ϙ . However, p p , and therefore, we have (e2) for ϙ and p (instead of π , p ), as required.
The induction step , as in 3°, is pretty elementary.
Now, for the induction step , as in 4°, assume that n 2 and φ is a closed formula in L Π n 1 satisfying p forc π φ . Suppose that q forc ϙ φ fails. Then, by 4° there exist: a special multiforcing ϙ and a multitree q MT ( ϙ ) such that ϙ ϙ , q q , and q forc ϙ φ . However, then we have π ϙ and q p . We conclude that p forc π φ fails by 4°. □
Lemma 30
(in L ). Let π be a small regular multiforcing, φ a formula in L Σ n 1 , n 1 , p MT ( π ) , and if n = 1 then q MT ( π ) ( q p ) . Then p forc π φ implies ¬ ( p forc π φ ) .
Recall that φ is the canonical transformation of ¬ φ to the prenex form.
Proof. 
If n 2 then the result follows from definition 4°. Therefore, let n = 1 , so that, by the contrary assumption and Lemma 29, there exists q MT ( π ) such that both q forc π φ and q forc π φ . However, then (e1) immediately contradicts (e2) with p 1 = q . □
Lemma 31
(in L ). Let π be a small regular multiforcing, p MT ( π ) , φ a formula in L Σ n 1 , n 1 , and each name c in φ is π -complete. Then, there is a special multiforcing ϙ and a multitree q MT ( ϙ ) such that π ϙ , q p , and either q forc ϙ φ or q forc ϙ φ .
Proof. 
Suppose that n = 1 , so that φ has the canonical form (f1) with a recursive R. Then, τ = τ ( R ) MT × ω < ω is a tree-name. As each name in φ is π -complete, Theorem 4 gives a special multiforcing ϙ satisfying π r ϙ for each multitree r in dom τ , π c ϙ for each name c in φ , and π τ ϙ .
Case 1: some q MT ( ϙ ) , [ 0 ] q p directly forces Λ τ . Then, q forc ϙ φ by 1°.
Case 2: not case 1. Then, we have p forc ϙ φ by 2° of Section 23.
If n 2 , then the result follows from definition 4° of Section 23. □

25. Forcing the First Level Formulas

The following theorem shows that the auxiliary forcing relation is properly connected with the ordinary forcing at least for formulas in L Σ 1 1 L Π 1 1 .
Theorem 10
(in L ). Let π = π α α < ω 1 MF ω 1 and Q = MT ( π ) . Assume that α < ω 1 and p MT ( π α ) , φ is a formula in L Σ 1 1 L Π 1 1 , and p forc π α φ . Then, p Q -forces the sentence φ [ G ̲ ] over the universe in the ordinary sense.
Proof. Case 1:
φ is a formula in L Σ 1 1 , of the canonical form (f1), that is,
φ : = x m R ( x m , c 1 m , , c k m ) ,
where R ( ω < ω ) k + 1 is a recursive relation and every c i MT × ( ω × 2 ) is a small real name, and p forc π α φ , so that properties (a)–(d) and (e1) of Section 23 hold for π = π α , τ = τ ( R ) , and p . In particular, (∗) p directly forces Λ τ π α by (e1).
Now, consider any set G Q , generic over the given universe V and containing p ; the goal is to prove that φ [ G ] holds in V [ G ] . The following lemma simplifies the task. □
Lemma 32.
The set G α = G MT ( π α ) is π α -generic over τ in the sense of Definition 18, and is π α -generic over each name c i occurring in φ, in the sense of Definition 13.
In addition, c i [ G ] = c i [ G α ] for any such name c i , as well as τ [ G ] = τ [ G α ] .
Proof (Lemma).
First of all, we have to check (2) of Definition 13 for G α . Thus, let u , v MT ( π α ) belong to G α . However, u , v are sealed by π α by (a) of Section 23, thus the sets
D u ( π α ) = { q MT ( π ) : [ 0 ] | u | | q | ( q u q u ) }
and D v ( π α ) are sealed dense in MT ( π α ) . Then, D u ( π α ) D v ( π α ) is sealed dense in MT ( π α ) as well by Lemma 11(i). Therefore, if α < β < κ = dom ( π ) then
D u ( π α ) D v ( π α ) π β
is a sealed dense, and therefore open dense, set in MT ( π β ) by Lemma 10(iii). We conclude, by the genericity of G, that there is a multitree w G that belongs to ( D u ( π α ) D v ( π α ) ) π β for some β > α . Then, there is a multitree q D u ( π α ) D v ( π α ) satisfying w q . We have q G since w G . On the other hand, u , v G as well; therefore, q cannot be incompatible with u , v . It follows that q u and q v .
This ends the proof of (2) of Definition 13 for G α .
Now, check the special condition of Definition 18. Let p , s τ , ν ν π α ( τ ) , and let the set W + W p s ( τ π α ν , π α ) be dense in MT ( π α ) ; prove that W + W p s ( τ π α ν , π α ) G . Note that τ is sealed in MT ( π α ) by (d) of Section 23. It follows that W + W p s ( τ π α ν , π α ) is sealed dense in MT ( π α ) (see Definition 19(b)). Therefore, by Lemma 10(iii), if β α , then the set W + W p s ( τ π α ν , π α ) π β is dense in MT ( π β ) . It follows, by the genericity of G, that there is a multitree w G ( W + W p s ( τ π α ν , π α ) π β ) , for some β > α . Then, we have a multitree q W + W p s ( τ π α ν , π α ) satisfying w q . Then, q G since w G , and we are finished.
The genericity over the occurring names is verified similarly, starting from (c).
Finally, prove the additional part of the lemma. To check τ [ G ] = τ [ G α ] , assume that s τ [ G ] , meaning that there is q G with q , s τ , and thus, q dom τ . If follows by by (a) of Section 23 that q is sealed by π α , in other words, the set
D q ( π α ) = { r MT ( π ) : [ 0 ] | q | | r | ( r q r q ) }
is sealed dense in MT ( π ) . Then, arguing as above we prove that G ( D q ( π α ) π β ) for some β > α , and hence there exists r G α D q ( π α ) . However, r q is impossible since q G either, so we have r q . Thus, r witnesses that s τ [ G α ] .
The proof that c i [ G ] = c i [ G α ] for any name c i in φ is similar. □
We return to the proof of Theorem 10.
We know that p directly forces Λ τ π α . The set G α is π α -generic over τ by Lemma 32. Therefore, by Corollary 11, τ [ G α ] is ill-founded, i.e., has an infinite chain, and hence, τ [ G ] is ill-founded because τ [ G α ] = τ [ G ] still by Lemma 32.
Our goal is to prove that the sentence φ [ G ] : = x m R ( x m , y 1 m , , y k m ) (see Formula (2) above) holds in V [ G ] , where y i = c i [ G ] = c i [ G α ] , i = 1 , , k . We put
T y 1 , , y k = { s ω < ω : [ 0 ] n lh ( s ) R ( s n , y 1 n , , y k n ) } .
Thus, T y 1 , , y k ω < ω is a tree, and φ [ G ] is true if T y 1 , , y k is ill-founded. However, τ [ G ] is ill-founded, see just above. Thus, it remains to be shown that T y 1 , , y k = τ [ G ] .
Let s τ [ G ] , m = lh ( s ) . We have q , s τ for some q G . By definition, there are tuples t 1 , , t k ω m satisfying (I) and (II) of Section 23; in particular, q directly forces t i c i by (II) for all i = 1 , , k , and hence, t i = y i m for all i. Thus, s T y 1 , , y k by (I).
Conversely let s T y 1 , , y k , that is, R ( s n , t 1 n , , t k n ) holds for all n m = lh ( s ) , where t i = y i m for all i. As y i = c i [ G ] , there is a family of conditions r j i K j , t i ( j ) c i G , 1 i k , j < m . Then, the multitree q = 1 i k , j < m cw r j i belongs to G as well as G is generic, and by definition we have q , c τ ( R ) . It follows that s τ [ G ] .
Thus, T y 1 , , y k = τ [ G ] , as required.
Case 2:  φ is a formula in L Π 1 1 . We write ψ instead of φ . Thus, let ψ be a L Π 1 1 formula of the form (f2), i.e., essentially the negation of φ above, and let p forc π α ψ , so that properties (a)–(d) and (e2) of Section 23 hold for π = π α , τ = τ ( R ) , and p . In particular, if p 1 MT ( π ) , p 1 p , then p 1 does not directly force Λ τ π α , by (e2). Given any G Q , generic over L and containing p , the goal is to prove that ψ [ G ] holds in V [ G ] .
As p G α and G α is π α -generic over τ by Lemma 32, Corollary 11(ii) implies that τ [ G α ] = τ [ G ] is well-founded. Then, the tree T y 1 , , y k , defined as above, is well-founded either, since it is equal to τ [ G α ] . Therefore, ψ [ G ] holds, as required.

26. Forcing inside the Key Sequence

It is implied by Theorem 11 below that the forcing relation forc π , considered with the terms π = α of the key sequence , really approximates the true P -forcing relation at level n 1 and below. Recall that n 4 is assumed (see Assumption 1).
We argue in L . Recall that the key sequence = α α < ω 1 MF ω 1 , satisfying (A), (B), (C), (D) of Definition 23 was defined by Theorem 6, = α < ω 1 cw Π α is the key multiforcing, and P = MT ( ) = MT ( ) is our forcing notion.
Definition 28.
We write p forc α φ instead of p forc α φ , for the sake of brevity. Let p forc φ mean: p forc α φ for some α < ω 1 .
Lemma 33
(in L ). Assume that p P , α < ω 1 , and p forc α φ . Then, the following holds:
(i)
If α β < ω 1 , q P < β = MT ( Π β ) , and q p , then q forc β φ ;
(ii)
If q P , q p , then there exists β , [ 0 ] α β < ω 1 , such that q forc β φ ;
(iii)
If q P and q forc φ then p q ;
(iv)
It follows that, first, if p , q P , q p , and p forc φ then q forc φ , and second, p forc φ and p forc φ are incompatible.
Proof. 
Lemma 29 implies (i). To prove (ii), choose an ordinal β with α < β < ω 1 , satisfying q MT ( Π β ) , and apply (i). To check (iii), we observe that p , q are incompatible in P , as otherwise (i) leads to contradiction. On the other hand, multitrees incompatible in P are by Corollary 2. □
Theorem 11.
Assume that 1 n n 2 and ψ is a closed formula in L Π n 1 L Σ n + 1 1 , with all names small and Π -complete, and p P . Then p P -forces ψ [ G ̲ ] over L in the usual sense, if and only if p forc ψ .
Proof. 
Let be the ordinary P -forcing relation over L .
Part 1: ψ is a L Π 1 1 formula, of the canonical form (f2) in Section 23, with a recursive R. Define the tree-name τ = τ ( R ) by (I), (II) in Section 23.
If p forc φ then p forc γ φ for some γ < ω 1 , and then p φ [ G ̲ ] by Theorem 10.
To prove the converse suppose that p φ [ G ̲ ] . By the choice of φ , there is an ordinal λ 0 < ω 1 such that all names in φ are Π < λ 0 -complete, where < λ 0 = α < λ 0 cw α . Thanks to Lemma 24(ii), the set C of all ordinals λ λ 0 such that
(∗)
M ( λ ) contains all names in ψ , all multitrees in dom τ , and p , τ as well,
is stationary. Therefore, there is an ordinal λ C , λ > λ 0 .
Property (B) in Definition 23 implies < λ M ( λ ) λ . In particular, it follows by (∗), that < λ q λ for all q dom τ , < λ p q λ for all q dom τ , < λ -incompatible with p , < λ c λ for all names c in ψ , and < λ τ λ .
We conclude that properties (a)–(d) of Section 23 hold for λ in the role of π (and for the given p , ψ ). Indeed, to check (a), recall that < λ q λ holds for all q dom τ by the above; hence, every q dom τ is sealed by λ by Corollary 8(ii). To check (b), (c), (d) for λ argue similarly but refer to resp. Corollary 9(ii), Corollary 10(i), Theorem 3(v).
We claim that (e2) of Section 23 also holds, i.e., if p 1 MT ( λ ) , p 1 p , then p 1 does not directly force Λ τ λ . Indeed, suppose to the contrary that p 1 MT ( λ ) , p 1 p is a counterexample, so that p 1 directly forces Λ τ λ . Then, p 1 forc γ φ , where φ is ψ , by the definition in 1° of Section 23. We conclude that p 1 φ [ G ̲ ] by Theorem 10, that is, p 1 ¬ ψ [ G ̲ ] . However, this contradicts the assumption that p φ [ G ̲ ] .
Part 2: the step L Π n 1 L Σ n + 1 1 ( n 1 ). Let φ ( x ) be a L Π n 1 formula. Suppose that p forc x φ ( x ) . Then, by definition, we have p forc φ ( c ) for a small real name c . The inductive hypothesis implies p φ ( c ) [ G ̲ ] ; hence, p x φ ( x ) [ G ̲ ] . To prove the converse, let p x φ ( x ) [ G ̲ ] . As P is CCC, there exists a small real name c (in L ) satisfying p φ ( c ) [ G ̲ ] . Then, p forc φ ( c ) by the inductive hypothesis; therefore, p forc x φ ( x ) .
Part 3: the step L Σ n 1 L Π n 1 ( 2 n n 2 ). Let φ be a closed L Σ n 1 formula, and p forc φ . Lemma 33(iv) implies that no multitree q P , q p , satisfies q forc φ . We conclude that p φ [ G ̲ ] by the inductive hypothesis.
Conversely, let p φ [ G ̲ ] . There is an ordinal λ < ω 1 such that every name in φ is < λ -complete, where < λ = α < λ cw α . Consider the set U of all sequences π MF , of successor length dom ( π ) = κ + 1 , such that κ > λ and there is a multitree q MT ( π ) , q p , such that q forc π ( κ ) φ . Then, U is a Σ n 1 ( HC ) set (defined with φ , p 0 as parameters) by Lemma 28; hence, U belongs to Σ n 3 ( HC ) . (Recall that n 4 by Assumption 1. Therefore, using Theorem 6 (and (C) of Definition 23) there is an ordinal β < ω 1 such that the restricted sequence β blocks U.
Case 1: β U , so that β = κ + 1 , κ > λ , and there is a multitree q MT ( β ) satisfying q p and q forc κ φ . Then, q φ [ G ̲ ] holds by the inductive hypothesis, which contradicts the choice of p . We conclude that Case 1 is impossible.
Case 2: no sequence in U extends β . We can assume that β > λ and β is a successor, β = κ + 1 . (If not, replace β by max { β + 1 , λ + 1 } ). We asert that p forc κ φ . Indeed, otherwise, 4° implies that there exists a special multiforcing ϙ and a multitree q MT ( ϙ ) , satisfying κ ϙ , q p , and q forc ϙ φ . However, then the extended sequence ϙ = ( β ) ϙ belongs to U. However, β π , which contradicts the Case 2 assumption. Thus, p forc φ , as required. □

27. Permutation Invariance

The theory of forcing admits various invariance theorems. Theorem 12 is related to the invariance of the auxiliary forcing under permutations.
We argue in L . Let PERM be the set of all bijections h : ω 1 onto ω 1 , satisfying h = h 1 and such that the non-identity domain NI ( h ) = { ξ : [ 0 ] h ( ξ ) ξ } is at most countable. Bijections in PERM will be called permutations.
We extend the action of any h PERM as follows:
  • If p is a multitree then h p is a multitree, | h p | = h | p | = { h ( ξ ) : [ 0 ] ξ | p | } , and ( h p ) ( h ( ξ ) ) = p ( ξ ) for each ξ | p | ;
  • If π MT is a multiforcing then accordingly h · π = π ( h 1 ) is a multiforcing, | h · π | = h π and ( h · π ) ( h ( ξ ) ) = π ( ξ ) for each ξ | π | ;
  • If c MT × ( ω × ω ) is a real name, then we define h c = { h p , n , i : [ 0 ] p , n , i c } , so that h c is a real name as well;
  • If π = π α α < κ MF , then h π = h · π α α < κ , this is still a sequence in MF ;
  • If φ : = φ ( c 1 , , c n ) is a L -formula (all names indicated), then h φ is φ ( h c 1 , , h c n ) .
Many notions and relations defined above are rather obviously PERM -invariant. Thus, p MT ( π ) if h p MT ( h · π ) , π old ϙ if h · π old h · ϙ , et cetera. As the next lemma shows, the invariance also holds with respect to the relation forc . An obvious proof by induction on n is left to the reader. (See Theorem 24.1 in [18]).
Theorem 12.
Assume that h PERM , π is a small regular multiforcing, p MT , n 1 , and a closed formula φ belongs to L Π n 1 L Σ n + 1 1 . Then, p forc π φ if ( h p ) forc h π ( h φ ) .

28. Embedding Multiforcings in the Key Sequence

The following lemma proves that any special multiforcing admits a suitable embedding into the key sequence = α α < ω 1 , due to the generic properties of the latter.
In L , if ϑ < ω 1 , then we define shift permutations h 1 [ ϑ ] , [ 0 ] h 2 [ ϑ ] PERM so that
NI ( h 1 [ ϑ ] ) = [ 0 , ϑ · 2 ) and h 1 [ ϑ ] ( ξ ) = h 1 [ ϑ ] 1 ( ξ ) = ϑ + ξ for all ξ < ϑ ,
NI ( h 2 [ ϑ ] ) = [ 0 , ϑ ) [ ϑ · 2 , ϑ · 3 ) and h 2 [ ϑ ] ( ξ ) = h 2 [ ϑ ] 1 ( ξ ) = ϑ · 2 + ξ for ξ < ϑ ,
where as usual, ϑ · 2 = ϑ + ϑ and ϑ · 3 = ϑ + ϑ + ϑ . In other words, h 1 [ ϑ ] , h 2 [ ϑ ] are order-preserving shifts between [ 0 , ϑ ) and resp. [ ϑ , ϑ · 2 ) , [ ϑ · 2 , ϑ · 3 ) .
Lemma 34
(in L ). Let σ be a special multiforcing, α < ω . There exist a special multiforcing ϙ , and ordinals ν , θ < ω 1 , such that σ ϙ , α < min { ν , θ } , | ϙ | θ , and the multiforcings ϙ 1 = h 1 [ θ ] · ϙ , ϙ 2 = h 2 [ θ ] · ϙ satisfy ϙ 1 , ϙ 2 Π ν , i.e., ϙ 1 = ν | ϙ 1 | and ϙ 2 = ν | ϙ 2 | .
Under the conditions of the lemma, it follows by the definition of h 1 [ θ ] and h 2 [ θ ] above that | ϙ 1 | [ θ , θ · 2 ) and | ϙ 2 | [ θ · 2 , θ · 3 ) . This lemma will have two applications below. One of them (the proof of Lemma 35) will really need the effect of both h 1 [ θ ] and h 2 [ θ ] . The other one (Section 30) will involve only h 1 [ θ ] .
Proof. 
We argue in L . First of all, fix any special multiforcing ϙ satisfying σ ϙ and | ϙ | = | σ | . Let U be the set of all sequences π MF such that:
(†)
there are ordinals ν < dom ( π ) , θ < ω 1   | ϙ | [ 0 , θ ) , and the shifted multiforcings ϙ 1 = h 1 [ θ ] · ϙ , ϙ 2 = h 2 [ θ ] · ϙ satisfy ϙ 1 , ϙ 2 Π ν .
Easily, U is a Σ 1 ( HC ) set (with ϙ as the only parameter of the Σ 1 definition in HC ); therefore, a Σ n 3 ( HC ) set, because n 4 by Assumption 1. It follows by Definition 23(C) that there exists an ordinal ν < ω 1 such that ν blocks U. We can w. l. o. g. assume that ν = γ + 1 is a successor; otherwise, just substitute ν + 1 for ν . We put π = γ .
Case 1: no sequence in U extends ν . To demonstrate that this is inconsistent, let θ < ω 1 be the least ordinal satisfying | π | | ϙ | [ 0 , θ ) . Let π be any special multiforcing satisfying π π and still | π | = | π | [ 0 , θ ) .
We define ϙ 1 = h 1 [ θ ] · ϙ , ϙ 2 = h 2 [ θ ] · ϙ . Thus, π , ϙ 1 , ϙ 2 are special multiforcings with disjoint domains | π | [ 0 , θ ) , | ϙ 1 | [ θ , θ · 2 ) , | ϙ 2 | [ θ · 2 , θ · 3 ) . ’ It follows that the simple union σ = π ϙ 1 ϙ 2 is still a multiforcing, and by the way π σ since π π . It follows that the extended sequence π = ( ν ) σ belongs to MF and ( ν ) π , dom ( π ) = ν + 1 , and π ( ν ) = σ = π ϙ 1 ϙ 2 , so that ϙ 1 , ϙ 2 ( ν ) .
We conclude that π U , but this contradicts the Case 1 assumption.
Case 2: π = λ U . Let this be witnessed by an ordinal ν < λ and θ , ϙ as in (†). Then, ϙ 1 = h 1 [ θ ] · ϙ , ϙ 2 = h 2 [ θ ] · ϙ satisfy ϙ 1 , ϙ 2 π ( ν ) = ν , and hence, this accomplishes the proof of the lemma. □

29. The Non-Well-Orderability Claim, Part I

Here, we begin the proof of Theorem 1 in part (ii). It will be completed in the end of Section 30. We are going to establish the following even somewhat stronger result.
Theorem 13.
Assume that a set G P is P -generic over L . Then, in L [ G ] , there is no Σ 1 1 well-orderings of the reals, and moreover, no Σ n 1 1 relation well-orders the set { x ξ [ G ̲ ] : [ 0 ] ξ < ω 1 L } .
Our plan is to infer a contradiction from the next assumption contrary to Theorem 13.
Assumption 2.
Assume that Φ ( x , y ) is a Σ n 1 1 parameter-free formula, α < ω 1 , p P α = MT ( α ) , and p P -forces, over L , that “the relation < Φ , defined by x < Φ y if Φ ( x , y ) , strictly well-orders the set { x ξ [ G ̲ ] : [ 0 ] ξ < ω 1 L } in L [ G ̲ ] ”.
We begin with the next lemma. See Example 4 regarding real names of the form x . ξ .
Lemma 35
(in L ). Under Assumption 2, suppose that σ is a small regular multiforcing, ξ | σ | , and s MT ( σ ) . Then, there exists a special multiforcing π, a multitree p MT ( π ) , and an ordinal η | π | , such that σ π , p s , and p forc π Φ ( x . η , x . ξ ) .
Proof. 
We argue in L . We recall that p P α = MT ( α ) . By Lemma 34, there exist a special multiforcing ϙ , and ordinals ν , θ < ω 1 , such that σ ϙ , α < ν , | ϙ | | p | θ , and the shifted multiforcings ϙ 1 = h 1 [ θ ] · ϙ , ϙ 2 = h 2 [ θ ] · ϙ satisfy ϙ 1 , ϙ 2 Π ν .
Let ξ 1 = h 1 [ θ ] ( ξ ) , ξ 2 = h 2 [ θ ] ( ξ ) . Pick a multitree q MT ( ϙ ) with q s . Then
q 1 = h 1 [ θ ] q MT ( ϙ 1 ) and q 2 = h 2 [ θ ] q MT ( ϙ 2 ) ,
hence, q 1 , q 2 P ν . We observe that q 1 s 1 = h 1 [ θ ] s and q 2 s 2 = h 2 [ θ ] s .
Note that the sets | p | , | q 1 | , | q 2 | are subsets of the pairwise disjoint intervals resp. [ 0 , θ ) , [ θ , θ · 2 ) , [ θ · 2 , θ · 3 ) . Then, the simple union p = p q 1 q 2 is still a multitree in P ν stronger than each of p , [ 0 ] q 1 , [ 0 ] q 2 .
Then, by the choice of p , there exists a condition p P , p p , which either P -forces Φ ( x ξ 1 [ G ̲ ] , x ξ 2 [ G ̲ ] ) or P -forces Φ ( x ξ 2 [ G ̲ ] , x ξ 1 [ G ̲ ] ) . Let p P -force say Φ ( x ξ 2 [ G ̲ ] , x ξ 1 [ G ̲ ] ) over L . We can assume that p MT ( μ ) for some μ < ω 1 , satisfying μ ν + 2 and [ 0 , θ · 3 ) | Π μ | . Using Theorem 11, we have
(1)
p forc Π λ Φ ( x . ξ 2 , x . ξ 1 ) , for some λ < ω 1 .
Here, λ can be chosen large enough for λ > μ by Lemma 29. Then, there exists a multitree r MT ( λ ) = P λ satisfying r p and | r | = | p | . Lemma 29 implies:
(2)
r forc λ Φ ( x . ξ 2 , x . ξ 1 ) ,
and then acting by h 1 [ θ ] = ( h 1 [ θ ] ) 1 on (2), we obtain by Theorem 12:
(3)
p forc π Φ ( x . ξ 2 , x . ξ ) —by Theorem 12,
where π = h 1 [ θ ] λ and p = h 1 [ θ ] r MT ( π ) because h 1 [ θ ] ( ξ 1 ) = ( h 1 [ θ ] ) 1 ( ξ 1 ) = ξ .
It remains to be observed that σ ϙ ; hence, σ 1 ϙ 1 , and further σ 1 ν because ϙ 1 ν by construction. Therefore, σ 1 λ since ν < λ . Acting by h 1 [ θ ] = h 1 [ θ ] 1 , we obtain σ = h 1 [ θ ] σ 1 π . We similarly obtain p s = h 1 [ θ ] s 1 because r p p q 1 s 1 by construction. This ends the proof of the lemma, with η = ξ 2 . □
The goal of the next lemma is to strengthen Lemma 35 to the effect that a whole dense set of conditions with the same property will be obtained.
Lemma 36
(in L ). Under Assumption 2, there is a sequence π = π k k < ω MF satisfying the following for all ξ | π | :
(i)
If q MT ( π ) , where π = cw π = k < ω cw π k , then there is a condition p MT ( π ) , p q , and an ordinal η | π | , such that p forc π Φ ( x . η , x . ξ ) ;
(ii)
The set D ξ [ π ] = { p MT ( π ) : [ 0 ] η | π | k < ω p forc π k Φ ( x . η , x . ξ ) } is dense (then in fact open dense by Lemma 29) in MT ( π ) .
Proof. 
(i) Using Lemma 34, we define π k by induction so that for each k there is a certain pair of ξ k | π k | and q k MT ( π k ) , satisfying:
p k MT ( π k + 1 ) η k | π k + 1 | p k q k p k forc π k + 1 Φ ( x η k , x ξ k ) .
Moreover, the enumeration by ξ k and q k can be arranged so that for each ordinal ξ | π | and condition q MT ( π ) there exists k such that ξ k = ξ and q k = q . However, π is as required. Claim (ii) is just a reformulation of (i). □
Corollary 15
(in L ). Under Assumption 2, let π MF ω satisfy (ii) of Lemma 36: if ξ | π | then D ξ [ π ] is open dense in MT ( π ) , where π = cw π . There is a special multiforcing ϙ , such that π k ϙ for each k, and each set D ξ [ π ] ϙ , ξ | π | , is sealed dense in MT ( ϙ ) .
Proof. 
Consider the (countable) collection of all sets D ξ [ π ] , ξ | π | . By Lemma 21(i), there exists an extension ϙ MF ω + 1 of π , by the rightmost term ϙ = ϙ ( ω ) , satisfying π D ξ [ π ] ϙ for all ξ | π | . Then, each set D ξ [ π ] ϙ is sealed dense in ϙ by Lemma 10(iii). □

30. The Non-Well-Orderability Claim, Part II

Still arguing under the conditions of Assumption 2, we proceed with the following construction.
(I)
Pick π = π k k < ω MF ω by Lemma 36, so that
D ξ [ π ] = { p MT ( π ) : [ 0 ] η | π | k p forc π k Φ ( x η , x ξ ) }
is an open dense set in MT ( π ) for any ξ | π | , where π = cw π = k < ω cw π k .
(II)
Then, pick a special multiforcing ϙ by Corollary 15, so that π k ϙ for each k, and if ξ | π | then π D ξ [ π ] ϙ , and hence, the set D ξ [ π ] ϙ is sealed dense in MT ( ϙ ) .
(III)
By Lemma 34, there exist a special multiforcing χ , and ordinals ν , θ < ω 1 , such that ϙ χ , | χ | θ , and the multiforcing χ * = h 1 [ θ ] · χ satisfies χ * ν . Accordingly, we let ϙ * = h 1 [ θ ] · ϙ , π * = h 1 [ θ ] · π , π * = h 1 [ θ ] · π , π * k = h 1 [ θ ] · π k , so that π * k ϙ * χ * for all k, and π * ϙ * χ * . If ξ | π * | then put
D ξ [ π * ] = { p MT ( π * ) : [ 0 ] η | π * | k < ω p forc π * k Φ ( x η , x ξ ) } .
Lemma 37.
If ξ | π * | and τ * is a special multiforcing, χ * τ , then the set D ξ [ π * ] τ is sealed dense and open dense in MT ( τ ) .
Proof. 
Let us make use of the action of h 1 [ θ ] on (II) above. We assert that
(∗)
D ξ [ π * ] = h 1 [ θ ] D ξ [ π ] : = { h 1 [ θ ] · p : [ 0 ] p D ξ [ π ] } .
Indeed, suppose that ξ | π | and p D ξ [ π ] show that p = h 1 [ θ ] · p D ξ [ π * ] , where accordingly ξ = h 1 [ θ ] ( ξ ) . By definition there is an ordinal η | π | , such that p forc π k Φ ( x η , x ξ ) ) . Then, p forc π * k Φ ( x η , x ξ ) ) by Theorem 12, where η = h 1 [ θ ] ( η ) . This completes the proof of (∗) from right to left. The inverse implication is similar.
Now, it follows from (∗) and that each set D ξ [ π * ] ϙ * , where ξ | π * | is sealed dense in MT ( ϙ * ) . However, we have ϙ * χ * τ . It follows that the set D ξ [ π * ] τ is sealed dense and open dense in MT ( τ ) simply because D ξ [ π * ] ϙ * τ D ξ [ π * ] τ , whereas D ξ [ π * ] ϙ * τ is sealed dense and open dense in MT ( τ ) by Lemma 10(ii),(iii). □
We now obtain a related the pre-density result in the context of the the key sequence Π . Recall that p forc φ means that p forc Π α φ holds for some α < ω 1 . (See Definition 28).
Lemma 38.
If ξ | π * | , then the following set is open dense in P = MT ( Π ) :
D ξ = { s P : [ 0 ] η | π * | s forc Φ ( x η , x ξ ) } .
Proof. 
The openness holds by Lemma 29. To show the density, pick any p 0 P . The goal is to find an ordinal η | π * | , and a multitree s MT ( Π ) = P such that s p 0 and s forc Φ ( x η , x ξ ) ) . As Π is -increasing, there is an ordinal γ > ν + 1 and a stronger multitree p 1 MT ( Π γ ) , p 1 p 0 . It follows from (III) that χ * Π ν Π ν + 1 ; hence, χ * Π ν + 1 , which implies χ * Π γ for each γ ν + 1 ; therefore, χ * Π γ for the ordinal γ chosen just above. However, the set D ξ [ π * ] Π γ is open dense in MT ( Π γ ) by Lemma 37 (with τ = Π γ ). It follows that there is a multitree q D ξ [ π * ] Π γ , q p 1 p .
Then, p 1 r , where r D ξ [ π * ] , and hence, r forc π * k Φ ( x η , x ξ ) for some η | π * | and k. We conclude that then q forc Π γ Φ ( x η , x ξ ) by Lemma 29; thus, q D ξ , as required. □
Let be the P -forcing relation over L . It essentially coincides with forc by Proposition 11. Therefore, the lemma implies the following corollary.
Corollary 16.
If ξ | π * | then the following set is open dense in P :
D ξ = { s MT ( Π ) : [ 0 ] η | π * | s Φ ( x η [ G ̲ ] , x ξ [ G ̲ ] ) } .
Proof of Theorem 13.
It follows from Corollary 16 that if G if P -generic over L , then the set { x ξ [ G ̲ ] : [ 0 ] ξ | π * | } contains no < Φ -minimal element, which contradicts Assumption 2. The contradiction negates Assumption 2 and thereby proves Theorem 13. □
Combining Theorems 13 and 9, we complete the proof of Theorem 1.
  • Part V: Final
This final Part contains Section 31 with a short proof of Theorem 2 and a brief discussion of its possible reduction to a theory weaker than ZFC + P ( ω ) exists’. We finish in Section 32 with conclusions and problems.

31. Proof of Theorem 2 and Comments

First of all, we recall that ZFC is a subtheory of ZFC obtained as follows:
(a)
We exclude the Power Set axiom PS;
(b)
The well-orderability axiom WA, which claims that every set can be well-ordered, is substituted for the usual set-theoretic Axiom of Choice AC of ZFC ;
(c)
The Separation schema is preserved, but the Replacement schema (which happens to be not sufficiently strong in the absence of PS) is substituted with the Collection schema: X Y x X y Φ ( x , y ) y Y Φ ( x , y ) .
A comprehensive account of main features of ZFC is given in e.g., [27,28,29].
Proof of Theorem 2.
Arguing in ZFC , let us drop to the subuniverse L of all constructible sets in the ZFC universe of discourse. Then, L satisfies ZFC too, and if P ( ω ) exists then P ( ω ) L L exists in L . Thus, instead of ZFC + ‘ P ( ω ) exists’, we argue in the theory ZFC + ( V = L ) + ‘ P ( ω ) exists’, whose universe is L .
Now, the existence of the power set P ( ω ) = { X : [ 0 ] X ω } leads to the existence of sets such as ω 1 and HC = L ω 1 , and basically, the existence of all sets involved in the construction of the key forcing notion P (including P itself). After this remark, all arguments in the proof of Theorem 1 in Parts I, II, III, and IV above naturally go through, giving the proof of Theorem 2 by means of a P -generic extension of L . □
It is really interesting to further reduce the assumptions of Theorem 2 down to PA 2 (see [20,30,31] and elsewhere on second-order Peano arithmetic PA 2 ) or ZFC without the extra assumption of the existence of P ( ω ) , or the associated class theory GBc , which is formalized in a two-sorted language with separate variables and quantifiers for sets and classes, so that lower-case letters are used for set variables, whereas upper-case letters are used for class variables. The minus still reflects the absence of the Power Set axiom.The axiomatization of GBc (see e.g., [29]) includes axioms for sets (exactly those of ZFC ) and those for classes. In particular, (1) extensionality for classes; (2) the class replacement axiom asserting that every class function restricted to a set is a set; and (3) a predicative comprehension schema asserting that every collection of sets, definable by a formula with no quantified class variables, is a class.
Theories PA 2 , ZFC , and GBc have been known to be equiconsistent for a while, see e.g., [20,30,31] for PA 2 vs. ZFC , and [32,33,34] for ZFC vs. GBc .
Such objects as ω 1 and HC are legitimate classes in GBc , and such are all ZFC -sets that play any role in the proof of Theorem 1 above, with one notable exception. The exceptional case being the Δ 1 HC   ω 1 -sequence used in Lemma 24. The ZFC construction of such a sequence (as e.g., in [24]) can be maintained as a proper class in GBc + all sets are constructible as well as in ZFC + ( V = L ) . However, unfortunately, the proof of the ω 1 -property of the resulting sequence does not go through in GBc because the ZFC proof involves ordinals beyond ω 1 , and hence, does not directly translate to the GBc level. This will be the subject of our forthcoming paper aimed at solving this technical obstacle by means of recently discovered methods as, e.g., in [35,36].

32. Conclusions and Problems

In this study, the method of finite-support products of Jensen’s forcing was applied to the problem of obtaining a model of ZFC in which, for a given n 3 , there is a Δ n 1 -good well-ordering of the reals, but no well-orderings of the reals exist in the class Δ n 1 1 at the preceding level of the hierarchy. This is achieved by Theorem 1, our first main result. We also demonstrate that this theorem can be obtained on the basis of the consistency of ZFC (i.e., ZFC sans the Power Set axiom) plus the claim that P ( ω ) exists, which is a much weaker assumption than the consistency of ZFC usually assumed in such independence results obtained by forcing method. This is achieved by Theorem 2, our second main result. Two principal technical achievements, related to getting rid of countable models of ZFC as a technical tool and according treatment of the auxiliary forcing, were mentioned in Section 2. These are new results in such a generality (with n 3 arbitrary), and valuable improvements upon our earlier results in [1]. They may lead to further progress in studies of the projective hierarchy.
From our study, it is concluded that the technique of definable generic inductive construction of forcing notions in L that carry hidden automorphisms, developed for Jensen-type product forcing in our earlier papers [17,18,21], succeeds to solve other important descriptive set theoretic problems of the same kind, using Theorems 1 and 2.
These results (Theorems 1 and 2) continue the series of recent research such as a model [37] in which there is Π n 1 real singleton { a } that codes a cofinal map f : ω ω 1 L , while every Σ n 1 set X ω is constructible, and hence, cannot code a cofinal map ω ω 1 L , and another model [38], in which there is a non-ROD-uniformizable Π n 1 set with countable cross-sections, while all Σ n 1 sets with countable cross-sections are Δ n + 1 1 -uniformizable—in addition to the research already mentioned in Section 2 above.
This study may also be a contribution to the search for solutions of several similar and still open problems related to the projective hierarchy, such as separation of the countable AC at different levels of the projective hierarchy, a similar problem for the principle DC of dependent choices, and a critically significant problem posed by S. D. Friedman in ([39], p. 209) and ([40], p. 602): assuming the consistency of an inaccessible cardinal, find a model for a given n in which all Σ n 1 sets of reals are Lebesgue measurable and have the Baire and perfect set properties, while there is a Δ n + 1 1 well-ordering of the reals.
From the result of Theorem 1, the following more concrete problems arise.
Problem 1.
Prove that it is true in the key model L [ G ] of Section 20 that there is no boldface Δ n 1 1 well-ordering of the reals.
The boldface specification means that the real parameters are allowed in the definitions of pointsets, whereas they are not allowed in the lightface case. This is a principal difference.
Problem 2.
Prove a version of Theorem 1 with the additional requirement that the negation 2 0 > 1 of the continuum hypothesis holds in the generic extension considered.
The model for Theorem 1 introduced in Section 20 definitely satisfies the continuum hypothesis 2 0 = 1 . The problem of obtaining models of ZFC in which 2 0 > 1 and there is a projective well-ordering of the real line, has been known since the beginning of modern set theory. See, e.g., problem 3214 in an early survey [41] by Mathias. Harrington [42] solved this problem using a generic model in which 2 0 > 1 and there is a Δ 3 1 well-ordering of the continuum, using a combination of methods based on such coding forcing notions as the almost-disjoint forcing [43] and a forcing by Jensen and Johnsbråten [44]. Such a different forcing notion as the product/iterated Sacks forcing [45,46] may also be of interest here.

Author Contributions

Conceptualization, V.K. and V.L.; methodology, V.K. and V.L.; validation, V.K.; formal analysis, V.K. and V.L.; investigation, V.K. and V.L.; writing original draft preparation, V.K.; writing review and editing, V.K. and V.L.; project administration, V.L.; funding acquisition, V.L. All authors have read and agreed to the published version of the manuscript.

Funding

This research was partially supported by Russian Foundation for Basic Research RFBR grant number 20-01-00670.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable. The study did not report any data.

Acknowledgments

We thank the anonymous reviewers for their thorough review and highly appreciate the comments and suggestions, which significantly contributed to improving the quality of the publication.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Kanovei, V.; Lyubetsky, V. A model in which wellorderings of the reals appear at a given projective level. Axioms 2022, 11, 354. [Google Scholar] [CrossRef]
  2. Hadamard, J.; Baire, R.; Lebesgue, H.; Borel, E. Cinq lettres sur la théorie des ensembles. Bull. Soc. Math. Fr. 1905, 33, 261–273. [Google Scholar] [CrossRef]
  3. Sierpiński, W. L’axiome de M. Zermelo et son rôle dans la théorie des ensembles et l’analyse. Bull. Acad. Sci. Crac. 1918, 97–152. [Google Scholar]
  4. Lusin, N. Sur la classification de M. Baire. C. R. Acad. Sci. Paris 1917, 164, 91–94. [Google Scholar]
  5. Moschovakis, Y.N. Descriptive Set Theory; Studies in Logic and the Foundations of Mathematics; North-Holland: Amsterdam, NY, USA; Oxford, UK, 1980; Volume 100, pp. XII+637. [Google Scholar] [CrossRef]
  6. Gödel, K. The Consistency of the Continuum Hypothesis; Annals of Mathematics Studies, No. 3; Princeton University Press: Princeton, NJ, USA, 1940. [Google Scholar] [CrossRef]
  7. Addison, J.W. Some consequences of the axiom of constructibility. Fundam. Math. 1959, 46, 337–357. [Google Scholar] [CrossRef]
  8. Levy, A. Definability in axiomatic set theory II. In Studies in Logic and the Foundations of Mathematics; Bar-Hillel, Y., Ed.; North-Holland: Amsterdam, The Netherlands; London, UK, 1970; pp. 129–145. [Google Scholar] [CrossRef]
  9. Solovay, R.M. A model of set-theory in which every set of reals is Lebesgue measurable. Ann. Math. 1970, 92, 1–56. [Google Scholar] [CrossRef]
  10. Caicedo, A.E. Projective well-orderings and bounded forcing axioms. J. Symb. Log. 2005, 70, 557–572. [Google Scholar] [CrossRef]
  11. Caicedo, A.E.; Friedman, S.D. BPFA and projective well-orderings of the reals. J. Symb. Log. 2011, 76, 1126–1136. [Google Scholar] [CrossRef]
  12. Caicedo, A.E.; Schindler, R. Projective well-orderings of the reals. Arch. Math. Logic 2006, 45, 783–793. [Google Scholar] [CrossRef]
  13. Friedman, S.; Hoffelner, S. A Σ 4 1 wellorder of the reals with NSω1 saturated. J. Symb. Log. 2019, 84, 1466–1483. [Google Scholar] [CrossRef]
  14. Fischer, V.; Friedman, S.D. Cardinal characteristics and projective wellorders. Ann. Pure Appl. Log. 2010, 161, 916–922. [Google Scholar] [CrossRef]
  15. Fischer, V.; Friedman, S.D.; Zdomskyy, L. Cardinal characteristics, projective wellorders and large continuum. Ann. Pure Appl. Log. 2013, 164, 763–770. [Google Scholar] [CrossRef]
  16. Fischer, V.; Friedman, S.D.; Khomskii, Y. Measure, category and projective wellorders. J. Log. Anal. 2014, 6, 1–25. [Google Scholar] [CrossRef]
  17. Kanovei, V.; Lyubetsky, V. The full basis theorem does not imply analytic wellordering. Ann. Pure Appl. Log. 2021, 172, 46. [Google Scholar] [CrossRef]
  18. Kanovei, V.; Lyubetsky, V. Models of set theory in which separation theorem fails. Izv. Math. 2021, 85, 1181–1219. [Google Scholar] [CrossRef]
  19. Horowitz, H.; Shelah, S. Transcendence bases, well-orderings of the reals and the axiom of choice. Proc. Am. Math. Soc. 2021, 149, 851–858. [Google Scholar] [CrossRef]
  20. Simpson, S.G. Subsystems of Second Order Arithmetic, 2nd ed.; Perspectives in Logic; Cambridge University Press: Cambridge, UK; ASL: Urbana, IL, USA, 2009; pp. xvi+444. [Google Scholar]
  21. Kanovei, V.; Lyubetsky, V. A model in which the Separation principle holds for a given effective projective Sigma-class. Axioms 2022, 11, 122. [Google Scholar] [CrossRef]
  22. Friedman, S.D.; Gitman, V.; Kanovei, V. A model of second-order arithmetic satisfying AC but not DC. J. Math. Log. 2019, 19, 1–39. [Google Scholar] [CrossRef]
  23. Jensen, R. Definable sets of minimal degree. In Studies in Logic and the Foundations of Mathematics; Bar-Hillel, Y., Ed.; North-Holland: Amsterdam, The Netherlands; London, UK, 1970; Volume 59, pp. 122–128. [Google Scholar] [CrossRef]
  24. Jech, T. Set Theory, 3rd ed.; Springer: Berlin/Heidelberg, Germany; New York, NY, USA, 2003; pp. xiii+769. [Google Scholar] [CrossRef]
  25. Enayat, A. On the Leibniz—Mycielski axiom in set theory. Fundam. Math. 2004, 181, 215–231. [Google Scholar] [CrossRef]
  26. Kanovei, V.; Lyubetsky, V. Definable E0 classes at arbitrary projective levels. Ann. Pure Appl. Log. 2018, 169, 851–871. [Google Scholar] [CrossRef]
  27. Zarach, A. Unions of ZF–models which are themselves ZF–models. In Studies in Logic and the Foundations of Mathematics; North-Holland: Amsterdam, The Netherlands; London, UK, 1982; Volume 108, pp. 315–342. [Google Scholar]
  28. Gitman, V.; Hamkins, J.D.; Johnstone, T.A. What is the theory ZFC without power set? Math. Log. Q. 2016, 62, 391–406. [Google Scholar] [CrossRef]
  29. Antos, C.; Gitman, V. Modern Class Forcing. In Research Trends in Contemporary Logic; Daghighi, A., Rezus, A., Pourmahdian, M., Gabbay, D., Fitting, M., Eds.; Available online: https://philpapers.org/go.pl?aid=ANTMCF (accessed on 6 December 2022).
  30. Apt, K.R.; Marek, W. Second order arithmetic and related topics. Ann. Math. Log. 1974, 6, 177–229. [Google Scholar] [CrossRef]
  31. Kreisel, G. A survey of proof theory. J. Symb. Log. 1968, 33, 321–388. [Google Scholar] [CrossRef]
  32. Shoenfield, J.R. A relative consistency proof. J. Symb. Log. 1954, 19, 21–28. [Google Scholar] [CrossRef]
  33. Freire, A.R.; de Alvarenga Freire, R. The Ontological Import of Adding Proper Classes. Manuscrito 2019, 42, 85–112. [Google Scholar] [CrossRef]
  34. Felgner, U. Comparison of the axioms of local and universal choice. Fundam. Math. 1971, 71, 43–62. [Google Scholar] [CrossRef]
  35. Hamkins, J.D. Diamond on the Ordinals. 2015. Available online: http://jdh.hamkins.org/diamond-on-the-ordinals/ (accessed on 16 May 2023).
  36. Enayat, A.; Hamkins, J.D. ZFC proves that the class of ordinals is not weakly compact for definable classes. J. Symb. Log. 2018, 83, 146–164. [Google Scholar] [CrossRef]
  37. Kanovei, V.; Lyubetsky, V. Definable minimal collapse functions at arbitrary projective levels. J. Symb. Log. 2019, 84, 266–289. [Google Scholar] [CrossRef]
  38. Kanovei, V.; Lyubetsky, V. Non-uniformizable sets with countable cross-sections on a given level of the projective hierarchy. Fundam. Math. 2019, 245, 175–215. [Google Scholar] [CrossRef]
  39. Friedman, S.D. Fine Structure and Class Forcing; De Gruyter Series in Logic and Its Applications; de Gruyter: Berlin, Germany, 2000; Volume 3, pp. x+221. [Google Scholar] [CrossRef]
  40. Friedman, S.D. Constructibility and class forcing. In Handbook of Set Theory; Springer: Dordrecht, The Netherlands, 2010; pp. 557–604. [Google Scholar] [CrossRef]
  41. Mathias, A.R.D. Surrealist landscape with figures (a survey of recent results in set theory). Period. Math. Hung. 1979, 10, 109–175. [Google Scholar] [CrossRef]
  42. Harrington, L. Long projective wellorderings. Ann. Math. Log. 1977, 12, 1–24. [Google Scholar] [CrossRef]
  43. Jensen, R.B.; Solovay, R.M. Some applications of almost disjoint sets. In Studies in Logic and the Foundations of Mathematics; Bar-Hillel, Y., Ed.; North-Holland: Amsterdam, The Netherlands; London, UK, 1970; Volume 59, pp. 84–104. [Google Scholar] [CrossRef]
  44. Jensen, R.B.; Johnsbraten, H. A new construction of a non-constructible Δ 3 1 subset of ω. Fundam. Math. 1974, 81, 279–290. [Google Scholar] [CrossRef]
  45. Kanovei, V. Non-Glimm-Effros equivalence relations at second projective level. Fund. Math. 1997, 154, 1–35. [Google Scholar] [CrossRef]
  46. Kanovei, V.; Lyubetsky, V. On the Significance of Parameters in the Choice and Collection Schemata in the 2nd Order Peano Arithmetic. Mathematics 2023, 11, 726. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Kanovei, V.; Lyubetsky, V. A Model in Which Well-Orderings of the Reals First Appear at a Given Projective Level, Part II. Mathematics 2023, 11, 2517. https://doi.org/10.3390/math11112517

AMA Style

Kanovei V, Lyubetsky V. A Model in Which Well-Orderings of the Reals First Appear at a Given Projective Level, Part II. Mathematics. 2023; 11(11):2517. https://doi.org/10.3390/math11112517

Chicago/Turabian Style

Kanovei, Vladimir, and Vassily Lyubetsky. 2023. "A Model in Which Well-Orderings of the Reals First Appear at a Given Projective Level, Part II" Mathematics 11, no. 11: 2517. https://doi.org/10.3390/math11112517

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop