Next Article in Journal
Controlling Chaos in Van Der Pol Dynamics Using Signal-Encoded Deep Learning
Previous Article in Journal
Acoustic Emission b Value Characteristics of Granite under True Triaxial Stress
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Blurry Definability

1
Department of Mathematics, College of Staten Island (CUNY), 2800 Victory Blvd., Staten Island, New York, NY 10314, USA
2
Mathematics Program, CUNY Graduate Center, 365 5th Avenue, New York, NY 10016, USA
Mathematics 2022, 10(3), 452; https://doi.org/10.3390/math10030452
Submission received: 30 December 2021 / Revised: 28 January 2022 / Accepted: 28 January 2022 / Published: 30 January 2022
(This article belongs to the Section Mathematics and Computer Science)

Abstract

:
I begin the study of a hierarchy of (hereditarily) < κ -blurrily ordinal definable sets. Here for a cardinal κ , a set is < κ -blurrily ordinal definable if it belongs to an OD set of cardinality less than κ , and it is hereditarily so if it and each member of its transitive closure is. I show that the class of hereditarily < κ -blurrily ordinal definable sets is an inner model of ZF . It satisfies the axiom of choice iff it is a κ -c.c. forcing extension of HOD , and HOD is definable inside it (even if it fails to satisfy the axiom of choice). Of particular interest are cardinals λ such that some set is hereditarily < λ -blurrily ordinal definable but not hereditarily < κ -blurrily ordinal definable for any cardinal κ < λ . Such cardinals I call leaps. The main results concern the structure of leaps. For example, I show that if λ is a limit of leaps, then the collection of all hereditarily < λ -blurrily ordinal definable sets is a model of ZF in which the axiom of choice fails. Using forcing, I produce models exhibiting various leap constellations, for example models in which there is a (regular/singular) limit leap whose cardinal successor is a leap. Many open questions remain.
MSC:
03E45; 03E47; 03E25; 03E35; 03E40; 03E55

Contents
 
1      Introduction..............................................................................................................................................................1
 
2      ZF(C) Results............................................................................................................................................................3
2.1      Basic Observations........................................................................................................................................ 3
2.2      Blurry Choice................................................................................................................................................. 4
2.3      How Close Is HOD to Blurry HOD?........................................................................................................... 6
2.4      Leaps............................................................................................................................................................... 13
 
3      Effects of Forcing on Blurry Definability..............................................................................................................14
3.1      Preserving Blurry Definability.................................................................................................................... 15
3.2      Not Adding to Blurry HOD......................................................................................................................... 15
3.3      Cohen Forcing............................................................................................................................................... 18
3.4      The Forcing by Kanovei and Lyubetsky.................................................................................................... 23
3.5      Forcing with Homogeneous Souslin Trees................................................................................................ 24
3.6      Příkrý Forcing............................................................................................................................................... 28
 
4      Questions and Directions for Future Research....................................................................................................32
 
References.........................................................................................................................................................................33

1. Introduction

The concept of ordinal definability is a core notion in set theory, introduced by Gödel, and developed by Myhill and Scott. Classically, a set a is ordinal definable, or OD , iff there are a formula φ ( x , y ) and ordinals α such that a is the unique set such that φ ( a , α ) holds. Although it is a classical fact due to Tarski that in general, the class of all definable sets is itself not definable, allowing ordinal parameters results in a definable concept. A lot of research on questions of definability has been done already in the first half of the twentieth century, and there is a lot of recent research as well, which I will refer to later, but let me mention [1] now for a very current article relating to the abovementioned result due to Tarski.
The collection of ordinal definable sets is not necessarily transitive. For example, the collection of all subsets of ω is definable, but there may be subsets of ω which are not ordinal definable. Classically, the way around this defect is to define that a set a is hereditarily ordinal definable if it is OD and every member of its transitive closure is also OD . The collection of all hereditarily ordinal definable sets is denoted HOD , and is known to be an inner model in which the axiom of choice holds, even if V is merely a ZF model.
Fairly recently, Hamkins and Leahy [2] introduced the concept of ordinal algebraicity: a set a is ordinal algebraic if there is a finite OD set A such that a A . They showed that the hereditary version of this concept, the class of all hereditarily ordinal algebraic sets, is no different than HOD .
Taking the logical next step, in a recent manuscript, Tzouvaras [3] argues that one can capture what Russell meant when he used the adjective “typical” in a somewhat paradoxical statement, by defining a set to be nontypical, or NT , or NT 1 , if it belongs to a countable OD set.
I follow a more liberal approach here, and I hope to convince the reader that this results in a very rich and interesting hierarchy of definability notions. I use the notation a ¯ ¯ for the cardinality of the set a in the following.
Definition 1
( ZF ). Let κ be a cardinal. A set a is < κ -blurrily ordinal definable, or < κ - OD , if there is an OD set A such that a A and A ¯ ¯ < κ . As usual, I will also write < κ - OD for the class of all sets that are < κ - OD .
This definition is to be understood in ZF , i.e., A is required to have a cardinality, and this cardinality is required to be less than κ . Nevertheless, I will mostly work in ZFC models, where every set has a cardinality, and the concepts are a little more natural. Clearly, < κ - OD = for κ < 2 . The idea behind the concept is this: when a is < κ - OD , we may not be able to single out a as the only set with a certain property (with respect to some ordinal), as was the case with ordinal definability, but we may narrow it down so that a is one of fewer than κ many sets with that property, just as though our memory of the exact identity of a became a little blurry. The set A in Definition 1 can hence be thought of as a blurry definition of a.
Thus, a set is OD iff it is < 2 - OD , and it is ordinal algebraic iff it is < ω - OD . The abovementioned “nontypical” sets are the ones that are < ω 1 - OD in the current terminology. The hereditary versions of the < κ - OD sets are defined in the usual way. I denote the transitive closure of a set x by TC ( x ) .
Definition 2.
Let κ be a cardinal. A set a is hereditarily < κ -blurrily ordinal definable, denoted < κ - HOD , iff TC ( { a } ) < κ - OD . As before, I also write < κ - HOD for the class of all < κ - HOD sets.
Again, < 0 - HOD = < 1 - HOD = (this is why I will always assume that κ > 1 ), < 2 - HOD = HOD , < ω - HOD is the collection of all hereditarily algebraic sets, and < ω 1 - HOD is the class of the hereditarily nontypical sets, or HNT 1 , in the terminology of Tzouvaras. I refrained from employing the notation HNT κ , which was used by Tzouvaras, but only to rule out the relevance of the case κ > ω 1 ; he argues that in this case, the resulting concept would be unnatural, contradicting his interpretation of nontypicality. Thus, for κ > 1 , we are not dealing with nontypicality, and I call it blurry definability instead.
One simple fact that I will frequently use is that a set a is < κ - HOD iff a is < κ - OD and a < κ - HOD .
This article is a first exploration of the structure of this hierarchy of blurry definability and the associated hierarchy of classes < κ - HOD . Although in the existing literature, the focus was always on one particular κ (namely 2, ω or ω 1 ), here, I am more interested in questions such as at which κ does a new set become hereditarily < κ -blurrily definable? What can the class of such κ’s be like? What can be said in general about < κ - HOD and its relationship to HOD , say? There are many questions such as this that are worthwhile.
The article is organized as follows.
In Section 2, I prove some general ZF / ZFC results about < κ - HOD : that it is an inner model (Proposition 2) and that it satisfies a “blurry” version of the axiom of choice (Theorem 2). Turning to the question how close HOD is to < κ - HOD , I show that HOD satisfies Hamkins’ λ -approximation and -cover properties in < κ - HOD , for every cardinal λ κ (Theorem 3), that HOD and < κ - HOD have the same cardinals and cofinalities above κ (Proposition 6), and that < κ - HOD has no fresh sequences over HOD whose length has cofinality at least κ (Proposition 4). Two of the main results in this section are Theorems 5 and 7, which state:
  • Let κ be an infinite cardinal. If < κ - HOD satisfies the axiom of choice. then it is a set forcing extension of HOD by a κ-c.c. forcing notion.
  • Let λ 2 be a cardinal. Let κ λ be regular. Then HOD is definable in < λ - HOD using P ( κ ) HOD as a parameter.
I also make a connection to Woodin’s work on the HOD conjecture by showing that if δ is extendible, then the HOD hypothesis implies that [ HOD ] < δ < δ - HOD (Proposition 8). I further introduce the concept of a leap, which is a κ where a new set gets into < κ - HOD , and I prove some basic facts about the class of leaps: that it is closed, that the least leap, if existent, is a successor cardinal, and that successor leaps are successor cardinals (Lemma 2). A maybe surprising result is Theorem 10:
  • If λ is a limit leap, then < λ - HOD does not satisfy the axiom of choice; more precisely, λ ¯ - AC fails in < λ - HOD , where λ is the λ ¯ -th leap.
Section 3 is concerned with the effects of forcing on blurry HOD and the leap structure. I prove preservation facts for belonging to blurry HOD , as well as results on not adding to blurry HOD . Specific forcing notions I investigate are Cohen forcing, a forcing due to Kanovei and Lyubetsky, forcing with certain homogeneous Souslin trees and Příkrý forcing. Strewn into this section are some relative consistency results, constructing models where the least leap is the successor of a regular limit cardinal (Corollary 7), where the cardinal successor of a regular limit leap is a leap (Theorem 14), where the least leap is the successor of a singular limit cardinal (Theorem 16), and where the cardinal successor of a singular limit leap is a leap (Theorem 17).
I close with Section 4, containing some open problems and directions for future research.
I would like to thank the two referees for thoroughly reading an earlier manuscript of this article, and for providing very useful feedback.

2. ZF(C) Results

In this section, I will prove some results on the structure of < κ - HOD —in some cases, I will work in ZF , and in others, I will also assume the axiom of choice.

2.1. Basic Observations

Let us begin by making some simple observations.
Proposition 1.
Let 2 κ < λ be cardinals.
(1)
OD < κ - OD < λ - OD .
(2)
< κ - HOD is transitive, and HOD < κ - HOD < λ - HOD .
(3)
OD H κ < κ - HOD .
(4)
Under AC , H κ < ( 2 < κ ) + - HOD .
(5)
So under AC , V is the increasing union κ Card < κ - HOD .
Proof. 
Points (1) and (2) are obvious.
For point (3), let a H κ be OD . To show that a < κ - HOD , we must check that every x TC ( { a } ) is < κ - OD . However, TC ( { a } ) is definable from a and hence OD , and the cardinality of TC ( { a } ) is less than κ , as a H κ . So TC ( { a } ) witnesses that x is < κ - OD .
For point (4), note that the cardinality of H κ is 2 < κ . So H κ is an OD set of size less than ( 2 < κ ) + that witnesses that a is < ( 2 < κ ) + - OD , for every a H κ . It follows that every a H κ is < ( 2 < κ ) + - HOD , as claimed.
Point (5) is again obvious. □
Hamkins-Leahy [2] introduced the notion of ordinal algebraicity by defining that a set a is ordinal algebraic iff it belongs to a finite OD set, and denoted the class of all ordinal algebraic sets by OA . They further defined a to be hereditarily ordinal algebraic if TC ( { a } ) OA , and denoted the class of all hereditarily ordinal algebraic sets by HOA . Thus, using the notation introduced here,
OA = < ω - OD and HOA = < ω - HOD .
Theorem 1
(Hamkins-Leahy [2]). < ω - HOD = HOA = HOD .
Proposition 2
( ZF ). Let κ 2 be a cardinal. Then < κ - HOD is an inner model, i.e., a transitive class containing the ordinals such that the ZF axioms hold when relativized to it.
Proof. 
If 2 κ ω , then by Proposition 1(2) and Theorem 1, HOD < κ - HOD < ω - HOD = HOD , so that < κ - HOD = HOD certainly is an inner model (even satisfying the axiom of choice).
So let us assume that κ > ω . It suffices to show that < κ - HOD satisfies the following condition: for every u < κ - HOD , there is a transitive v < κ - HOD such that u v and Def ( v , ) < κ - HOD (see [4], Thm. 13.9; the stated condition implies the assumption of the theorem.) Here is the short proof that this condition is satisfied:
So let u < κ - HOD be given. Let u V α , and set v = V α < κ - HOD . Clearly, v is transitive, OD (so also < κ - OD ), contained in < κ - HOD , so v < κ - HOD , and u v . To show that Def ( v , ) < κ - HOD , let φ ( x , y ) be a formula, and let a = a 0 , , a n 1 v . We must show that z = { x v | v , φ ( x , a ) } < κ - HOD . Since z v < κ - HOD , it suffices to show that z is < κ - OD . For each i < n , let A i be an OD set containing a i such that A ¯ ¯ i < κ . Since a i v , we may assume that each b A i is in v, by adding this requirement to the definition of A i if necessary, and this can be done for every i < n . Then z is in the set
B = { w | b 0 A 0 b n 1 A n 1 w = { x v | v , φ ( x , b ) } } ,
B is OD , as A 0 , , A n 1 and v are, and obviously, B ¯ ¯ A ¯ ¯ 0 · · A ¯ ¯ n 1 < κ , as κ is an infinite cardinal. □

2.2. Blurry Choice

Even though < κ - HOD is an inner model, we do not know that it satisfies AC , see [5,6], where it is shown that < ω 1 - HOD (there referred to as HNT ) may be strictly between HOD and V , while satisfying or not satisfying AC . However, it does satisfy a “blurry” form of AC , as we shall see presently.
However, first, I would like to say a few words about the definability of < κ - OD . I will work with some simple Gödelization of formulas as natural numbers. If φ is an actual formula, then I denote its Gödel number by φ . When working inside a model of set theory, I will also sometimes write φ for a natural number in the sense of the model which it believes to be the code of a formula (even though there may be no actual formula φ of which it would be the code, e.g., if φ is a nonstandard number), and it is useful to think of φ just as a formula in the sense of the model. There is a set-theoretic Σ 1 formula Sat which defines the satisfaction relation in any model M of set theory. Working inside a model M of set theory, if φ is a formula in the sense of M, A is a model of the corresponding language, and s is an assignment of the free variables of φ with values in the universe of A , then Sat ( A , φ , s ) expresses that A φ [ s ] . We can now define that a < κ - OD iff there is a formula φ ( x , y ) in the language of set theory with two free variables (so we are quantifying over a certain set of natural numbers) such that for some ordinals α and β < α , the set A = { z | Sat ( V α , , φ , z , β ) } has cardinality less than κ , and a A . The reason that this works is that if this property holds, then the set A is OD , since A is defined using the parameters α , φ and β , which all are ordinals (even if φ may be a nonstandard natural number in the particular model we are working in— Sat is an actual formula.) Vice versa, if there is a set A = { z | φ ( z , β ) } M of M-cardinality less than κ , where φ is an actual formula, and a A , then by the Levy reflection theorem, there is an α such that in M, A = { z | Sat ( V α , , φ , z , β ) } . I will often be a little sloppy in the notation, and write “ A φ [ s ] ” in place of the more precise, but maybe less suggestive “ Sat ( A , φ , s ) .” I also used the fact that in ZF , any finite sequence of ordinals can be coded by a single ordinal, using Gödel’s pairing function, for example. I will tacitly keep using this throughout.
Theorem 2
( ZF ). Let κ > 1 be a cardinal. Then, whenever C < κ - HOD is a set consisting of nonempty sets, there is a function f : C [ C ] < κ V such that f < κ - HOD , and such that for every c C , f ( c ) c .
Remark: So while in this situation, AC would guarantee a function that picks, for every c C , an element of c, which is equivalent to picking a one element subset of c, the theorem guarantees the existence of a function in < κ - HOD that picks, for every c C , a nonempty subset of c of size less than κ (as computed in V ).
Proof. 
For every c < κ - HOD , let us say that a triple α , β , φ is a code for c if φ is the Gödel number of a formula in the language of set theory with the two free variables v 0 and v 1 , and, letting Z = { x | V α φ ( x , β ) } , we have that Z ¯ ¯ < κ and c Z . Every element of < κ - HOD has such a code, and the codes are canonically well-ordered, for example using the lexicographical order.
Now, given C < κ - HOD as in the theorem, define a function f = f C : C [ C ] < κ as follows. Given c C , or any nonempty set c < κ - HOD , really, let τ c = α c , β c , φ c be the least code of any element of c, and let
f ( c ) = { x c | V α c φ c ( x , β c ) } .
Thus, letting τ c be a code for d c , we have that d f ( c ) c and f ( c ) ¯ ¯ < κ . Therefore, it remains to show that f < κ - HOD . To this end, since C < κ - HOD , we can let A be an OD set such that C A and A ¯ ¯ < κ . By adding a requirement to the definition of A if necessary, we may assume that every D A is a set of nonempty sets, and that D < κ - HOD . We can then define a function f D as above. Then, the set
{ f D | D A }
has cardinality less than κ , and it contains f = f C . So f is < κ - OD . To see that f < κ - HOD , it remains to show that f < κ - HOD . Every member of f is a pair of the form c , f ( c ) , where c dom ( f ) . It suffices to show that c , f ( c ) < κ - HOD , since < κ - HOD is closed under ordered pairs. Now c dom ( f ) = C < κ - HOD , so c < κ - HOD , since < κ - HOD is transitive. In addition, f ( c ) is of the form { x c | V α c φ c ( x , β c ) } . So f ( c ) c < κ - HOD , and so, f ( c ) < κ - HOD , again since < κ - HOD is transitive. Therefore, all we must show is that f ( c ) < κ - OD . However, this follows by an argument which is standard by now: since c < κ - HOD , there is an OD set B of cardinality less than κ , with c B . Since c is a nonempty set and c < κ - HOD , we may assume that B consists of nonempty sets which belong to < κ - HOD , by adding these requirements to the definition of B, if necessary. We can now let E be the set consisting of all sets of the form
{ x b | V α b φ b ( x , β b ) }
where b B . The set E is OD , has size less than κ , since B has, and since c B , we have that f ( c ) E . This shows that f ( c ) < κ - HOD , as required. □
Remark 1.
The proof of the previous theorem shows that there is a V -definable prewellorder R of < κ - HOD such that for every x < κ - HOD , the set of y which are not comparable with x has cardinality less than κ. In other words, this prewellorder splits < κ - HOD into equivalence classes, each in < κ - HOD , of size less than κ, and these equivalence classes are strongly well-ordered, meaning that the collection of predecessors of any given set forms a set.
A defect of this is that < κ - HOD may not know that these equivalence classes have cardinality less than κ . This can be fixed, however, if κ has a nice closure property.
Proposition 3
(AC). Let κ be a strong limit cardinal. Suppose that a < κ - HOD , and that a ¯ ¯ V < κ . Then a ¯ ¯ < κ - HOD = a ¯ ¯ V .
Proof. 
Let κ ¯ = a ¯ ¯ < κ . It suffices to show that there is a bijection between a and κ ¯ in < κ - HOD .
There are κ ¯ κ ¯ many bijections between κ ¯ and a. Each of them is in < κ - HOD , as I will show presently. First, let A be an OD set of cardinality λ < κ , such that a A . We may assume that every element of A belongs to < κ - HOD and has cardinality κ ¯ , since a has these properties, so that we otherwise may add these requirements to the definition of A. Consider the set
B = { f | there is a b A such that f : κ ¯ b is a bijection } .
For every fixed b A , there are κ ¯ κ ¯ < κ such bijections, and there are fewer than κ many elements of A, so in total, the cardinality of B is λ · κ ¯ κ ¯ < κ . In addition, since A is OD , so is B. It follows that B < κ - HOD , because if f B , then f < κ - HOD , as f : κ ¯ b , for some b B , so f κ ¯ × b < κ - HOD . Hence, there is a bijection between κ ¯ and a in < κ - HOD . □
Corollary 1.
If κ is a strong limit cardinal, then < κ - HOD satisfies the following form of the Axiom of Choice: for every collection C of nonempty sets, there is a function f : C [ C ] < κ such that for every c C , f ( c ) c .

2.3. How Close Is HOD to Blurry HOD ?

The main theme in this subsection is to find ways in which HOD and < κ - HOD are close to each other. The following definition captures two important forms of closeness, introduced by Hamkins [7] (Def. 2).
Definition 3.
Let M N be transitive classes, and let κ be a cardinal in N.
M satisfies the κ -cover property in N if for every set a N with a M and a ¯ ¯ N < κ , there is a set c M such that a c and c ¯ ¯ M < κ . M satisfies the strong κ -cover property if this is true for every set a N with a M and a ¯ ¯ V < κ .
Let a N be a set with a M . A set of the form a c , where c M and c ¯ ¯ M < κ , is called a κ -approximation to a in M. The set a is said to be κ -approximated in M if every κ-approximation to a in M belongs to M. M satisfies the κ -approximation property in Nif whenever a N with a M is κ-approximated in M, then a M .
Note that in the notation of this definition, if κ < λ are cardinals in N, and M satisfies the κ -approximation property in N, then M also satisfies the λ -approximation property in N, because if x N , x M is λ -approximated in M, then it is also κ -approximated in M.
Theorem 3.
Let κ λ be infinite cardinals. Then HOD satisfies the strong λ-cover property and the λ-approximation property in < κ - HOD .
Proof. 
To verify the strong λ -cover property, let a < κ - HOD , a HOD , with γ = a ¯ ¯ < λ . As a side remark, note that any subset of HOD is well-ordered by the canonical well-ordering of HOD , restricted to the set, and hence, it has a cardinality in V , even without assuming the axiom of choice.
Let A be OD with a A and A ¯ ¯ < κ . Since a HOD and a ¯ ¯ = γ , we may assume that for all b A , b HOD and b ¯ ¯ = γ , since these requirements may be added to the definition of A if necessary. Set c = A . Then c ¯ ¯ γ · A ¯ ¯ < λ , c is OD , and c HOD . Thus, c HOD , and clearly, a c . Since AC holds in HOD , c has a cardinality in HOD , and hence, c ¯ ¯ HOD < λ , because if it were the case that c ¯ ¯ HOD λ , then λ would be collapsed as a cardinal. This verifies the strong λ -cover property. Note that consequently, since HOD < κ - HOD , it is also true in < κ - HOD that the cardinality of a is less than λ .
Concerning the λ -approximation property, by the remark after Definition 3, we may assume that λ = κ , i.e., it suffices to prove the κ -approximation property. So let a < κ - HOD , a HOD be κ -approximated in HOD . Let A be OD , with a A and A ¯ ¯ < κ . We may assume that every b A is a subset of HOD that is κ -approximated in HOD . Let T = A . Then T is OD and T HOD , so T is in HOD .
For every c ( [ T ] < κ ) HOD , the set
A c = { b c | b A }
is an OD subset of HOD , and hence an element of HOD . Moreover, the function F : ( [ T ] < κ ) HOD HOD defined by
F ( c ) = A c
belongs to HOD as well.
Define, for distinct b 0 , b 1 A , d ( b 0 , b 1 ) to be the least (in the canonical well-ordering of HOD ) element of b 0 b 1 . Let
Δ = { d ( b 0 , b 1 ) | b 0 , b 1 A , b 0 b 1 } .
Then Δ HOD , and Δ ¯ ¯ < κ . Since κ is a cardinal in V , Δ ¯ ¯ HOD < κ as well, so that Δ ( [ T ] < κ ) HOD . Thus, A Δ HOD . Note that if b , b A are distinct, then b Δ b Δ .
Consequently, for Δ c ( [ T ] < κ ) HOD and b ¯ A Δ , there is a unique b ¯ A c such that b ¯ Δ = b ¯ . Therefore, we can define in HOD :
B ( b ¯ ) = { b ¯ | c ( [ T ] < κ ) HOD ( Δ c and b ¯ A c and b ¯ Δ = b ¯ ) } .
It follows that B ( b ¯ ) is the unique b A such that b Δ = b ¯ . Since for b A , b = B ( b Δ ) , it follows that
A = { B ( b ¯ ) | b ¯ A Δ }
and hence, A HOD . In particular, a HOD . □
As a side, note that the fact that HOD satisfies the ω -approximation property in < ω - HOD implies directly that HOD = < ω - HOD , reproving the Hamkins-Leahy result, Theorem 1. The approximation property also sheds a light on fresh sequences in blurry HOD over HOD . The terminology follows Hamkins [8].
Definition 4
(Hamkins). Let M N be inner models, and let θ be an ordinal. A sequence a : θ M is a fresh sequence in N over M if a N , a M , but for all ξ < θ , a ξ M .
Note that for there to be a fresh sequence of length θ , the ordinal θ must be a limit. The following proposition expresses another way in which < κ - HOD is close to HOD . It will turn out later that it is optimal, in a sense.
Proposition 4.
Let κ be an infinite cardinal. If θ is a limit ordinal with cf < κ - HOD ( θ ) κ , then < κ - HOD has no length θ sequence that is fresh over HOD .
Proof. 
This follows from the fact that HOD satisfies the κ -approximation property in < κ - HOD , by Theorem 3—here is the argument. Let f : θ HOD , f < κ - HOD , be such that for every α < θ , f α HOD . As a set, f is a subset of HOD , and the point is that f is κ -approximated in HOD . To see this, let a HOD , a ¯ ¯ HOD < κ . Since cf < κ - HOD ( θ ) κ , it follows that { ξ < θ | ξ , f ( ξ ) a } is bounded in θ , say by α . Then, f a = ( f α ) a HOD . □
The fact that HOD satisfies the κ -approximation and -cover properties in < κ - HOD suggests that the relationship between these models is in some sense similar to that between a ground model and its forcing extension by a forcing with a closure point below κ , see [7] (Lemma 13), although < κ - HOD may not satisfy the axiom of choice. In fact, using a criterion for when a ZFC model of set theory is a set forcing extension of an inner model proved in Bukovský [9], it can be seen that < κ - HOD actually is a forcing extension of HOD by a set-sized κ -c.c. forcing, if < κ - HOD satisfies ZFC .
Definition 5
([9] (1.6)). Let M 1 M 2 be transitive models, and let κ be a cardinal in M 2 . Then Apr M 1 , M 2 ( κ ) says that whenever f M 2 is a function from an ordinal α to an ordinal β, then there is a function g : α P ( β ) in M 1 such that for every ξ < α , f ( ξ ) g ( ξ ) and g ( ξ ) ¯ ¯ M 1 < κ .
The remarkable main theorem of [9] is the following.
Theorem 4
( ZFC ). Suppose M is a transitive inner model of ZFC , and κ is an infinite cardinal. Then the following conditions are equivalent:
1.
V is a forcing extension of M by a κ-c.c. forcing notion.
2.
Apr M , V ( κ ) holds.
The point now is:
Proposition 5.
Let κ be a cardinal. Then Apr HOD , < κ - HOD ( κ ) holds.
Proof. 
I will prove a more general condition, namely that if f : d HOD is a function in < κ - HOD with d HOD , then there is in HOD a function g : d HOD such that for every x d , f ( x ) g ( x ) and g ( x ) ¯ ¯ HOD < κ . To see this, let f be as described. Let F be OD with f F and F ¯ ¯ V < κ , and such that for every h F , h : d HOD . Define a function g with domain d by
g ( x ) = { h ( x ) | h F } .
Then g HOD , and for x d , f ( x ) g ( x ) and g ( x ) ¯ ¯ HOD < κ . So g is as wished. □
Consequently, we obtain the following result.
Theorem 5.
Let κ be an infinite cardinal. Then the following are equivalent:
1.
< κ - HOD satisfies the axiom of choice.
2.
< κ - HOD is a set forcing extension of HOD by a κ-c.c. forcing notion.
Proof. 
The direction from 1 to 2 follows by Proposition 5 and Theorem 4. For the converse, since HOD satisfies the axiom of choice, so does < κ - HOD if the latter is a set forcing extension of the former. □
Even if < κ - HOD fails to satisfy the axiom of choice, Bukovský’s condition is useful.
Proposition 6.
Let κ be an infinite cardinal. Then HOD and < κ - HOD have the same cardinals and cofinalities above κ, in the following sense:
(a)
If λ is a limit ordinal such that cf HOD ( λ ) κ , then cf HOD ( λ ) = cf < κ - HOD ( λ ) .
(b)
For λ κ , λ is regular in HOD iff λ is regular in < κ - HOD .
(c)
Card HOD κ = Card < κ - HOD κ .
In fact, this is true of any two models M (in place of HOD ) and N (in place of < κ - HOD ) such that Apr M , N ( κ ) holds; for (c), we assume that the axiom of choice holds in M.
Proof. 
I will use only that Apr HOD , < κ - HOD ( κ ) holds, by Proposition 5.
To prove (a), assume the contrary. Then λ ¯ = cf < κ - HOD ( λ ) < cf HOD ( λ ) . Let f : λ ¯ λ be cofinal, with f < κ - HOD . By Apr HOD , < κ - HOD ( κ ) , let g : λ ¯ P ( λ ) , g HOD , so that for all ξ < λ ¯ , f ( ξ ) g ( ξ ) and g ( ξ ) ¯ ¯ HOD < κ . Since cf HOD ( λ ) κ , it follows that sup g ( ξ ) < λ . In HOD , define h : λ ¯ λ by h ( ξ ) = sup g ( ξ ) . Since f ( ξ ) g ( ξ ) , ran ( g ) is cofinal in λ , contradicting that λ ¯ < cf HOD ( λ ) , and showing (a).
Claim (b) follows immediately from (a).
Turning to (c), it suffices to show that every cardinal λ κ in HOD is also a cardinal in < κ - HOD . Assume the contrary, and let λ be the least cardinal of HOD that is greater than or equal to κ and not a cardinal in < κ - HOD . Since κ itself is a cardinal in < κ - HOD , it follows that λ > κ , and obviously, λ must be a successor cardinal in HOD . However, then, λ is regular in HOD , by the axiom of choice, so λ = cf HOD ( λ ) = cf < κ - HOD ( λ ) , showing that λ is a cardinal in < κ - HOD after all. □
I would like to give an application of the approximation and cover properties of HOD in < κ - HOD , namely that HOD is definable in < κ - HOD . In view of Theorem 5, this is clear if < κ - HOD is a model of the axiom of choice, modulo Laver’s ground model definability result [10]. Therefore, the main case of interest is going to be that it is not. Note that this result is not at all obvious; HOD is highly non-absolute to inner models—see, for example, [11]. It can be viewed as expressing a certain closeness between < κ - HOD and V , because it says that < κ - HOD can tell what is hereditarily ordinal definable in V . I will use the following theorem, the proof of which is a variation of an argument due to Hamkins to prove Laver’s abovementioned result, as exhibited in more detail in Reitz [12] (Lemma 7.2). The new point is that the ambient model is not required to satisfy any form of the axiom of choice (so that it will be possible to apply the result in < κ - HOD .)
Theorem 6.
Let W be a transitive model satisfying ZF . Let κ be a regular cardinal in W. Let M , M W be transitive models of ZF without replacement, with θ = M On = M On , and each satisfying: if κ ¯ κ and r κ ¯ × κ ¯ is such that κ ¯ , r a well-order, then there are an ordinal α and a function π : κ ¯ α such that π : κ ¯ , r α , < is an isomorphism, and every set of ordinals has a monotone enumeration. Moreover, suppose that every a M M is well-orderable in W.
Let W θ = ( V θ ) W , and suppose that both M and M satisfy the κ-cover and approximation properties in W θ . Suppose, moreover, that P ( κ ) M = P ( κ ) M , and that ( κ + ) M = ( κ + ) M = ( κ + ) W .
Then it follows that P ( θ ) M = P ( θ ) M .
Proof. 
As a first step, I will show
(∗)
If A W is a bounded subset of θ and A ¯ ¯ W < κ , then there is a B M M such that B ¯ ¯ κ in any of the models M , M and W, and A B .
To prove ( ) , let A α < θ , and fix well-orderings < M , < M in W of P ( α ) M , P ( α ) M , respectively. By the power set axiom in M / M , these are sets in M / M , so by assumption, they are well-orderable in W. Note that A W θ .
Define in W a weakly increasing sequence A ξ | ξ < κ of subsets of α of cardinality less than κ in W with the following properties: A A 0 , if ξ is even (including when ξ is a limit ordinal), then A ξ M , and if ξ is odd, then A ξ M . The construction is straightforward at successor stages, using that M and M satisfy the κ -cover property in W θ . To make the sequence definable in W, we can always pick the < M / < M -least covering set. At limit stage λ < κ , let A ¯ λ = ξ < λ A ξ . Since we do not assume that W satisfies the axiom of choice, let me be careful in concluding that in W, A ¯ λ has cardinality less than κ . Assume this were not the case. Then Ω = otp ( A ¯ λ ) κ . Let e : A ¯ λ Ω be the inverse of the monotone enumeration of A ¯ λ . For every ξ < λ , we inductively know that A ¯ ¯ ξ W < κ , so otp ( A ξ ) < κ . The sequence A ξ | ξ < λ is in W, and so is the sequence otp ( A ξ ) | ξ < λ . Since κ is regular in W, it follows that this sequence of ordinals is bounded in κ , say by κ ¯ . For each ξ < λ , let f ξ : κ ¯ A ξ { 0 } be defined by letting f ξ ( ζ ) be the ζ -th element of A ξ according to its monotone enumeration, if ζ < otp ( A ξ ) , and let f ξ ( ζ ) = 0 otherwise. In W, the function h : λ × κ ¯ Ω can now be defined by
h ( ξ , ζ ) = e ( f ξ ( ζ ) ) .
This function is onto Ω κ , but λ , κ ¯ < κ , contradicting that κ is a cardinal in W. So A ¯ λ has cardinality less than κ in W, and one can define A λ to be the < M -least set in P ( α ) M covering A ¯ λ and with size less than κ in M .
This defines the sequence A ξ | ξ < κ . Let B = ξ < κ A ξ . A similar argument to the above shows that B ¯ ¯ W κ . If not, then Ω = otp ( B ) ( κ + ) W . However, for each ξ < κ , otp ( A ξ ) < κ . Again, letting e : B Ω be the inverse of the monotone enumeration of B and letting, for each ξ < κ , f ξ : κ A ξ { 0 } be defined by letting f ξ ( ζ ) be the ζ -th element of A ξ if ζ < otp ( A ξ ) and f ξ ( ζ ) = 0 otherwise, we can define h : κ × κ Ω by h ( ξ , ζ ) = e ( f ξ ( ζ ) ) , resulting in a function in W with domain κ × κ whose range contains ( κ + ) W , a contradiction.
To see that B M , note that B is κ -approximated in M , because if C M has C ¯ ¯ M < κ , then there is a ξ < κ such that C B = C A ξ , since κ is regular in W. So C B = C A ξ = C A ξ + 1 M , since at least one of A ξ and A ξ + 1 is in M . The same argument shows that B M , and claim ( ) is proven.
Following Hamkins’ argument, the next step is to show that M and M have the same sets of ordinals of cardinality less than κ . By symmetry, it suffices to show that given a set of ordinals A M of cardinality less than κ in M , A M . Note first that A must be bounded in θ , since M satisfies ZF minus replacement. Let B M M be such that A B and B ¯ ¯ κ in all three models. Let Ω = otp ( B ) < κ + (in the sense of any and all of the models involved). In M , let κ ¯ be the cardinality of Ω , and let h : κ ¯ Ω be a bijection. Let w = { α , β | α , β < κ ¯ h ( α ) < h ( β ) } . Since P ( κ ) M = P ( κ ) M , it follows that w M . By assumption on M , there are a function h and an ordinal Ω in M such that h : κ ¯ , w Ω , < . However, since κ ¯ , w is actually a well-order, it must be that h = h and Ω = Ω . The inverse of the monotone enumeration of B, e : B Ω is also both in M and M . Let A ¯ = h 1 e [ A ] . Then A ¯ P ( κ ) M , so A ¯ M , and so, A = e 1 h [ A ¯ ] M .
The proof can now be completed by showing that M and M have the same sets of ordinals: let A M be a set of ordinals. It suffices to show that A M . As before, note that A is bounded in θ , so that A W θ . The point is now that A is κ -approximated in M . Specifically, let B M be a set of ordinals of cardinality less than κ in M . By the previous point, B M . However, then, A B M , since both A and B are in M . In addition, A B has cardinality less than κ in M , so A B M , again by the same point. It now follows by the κ -approximation property of M in W θ that A M . □
It would be possible in the previous theorem to strengthen the assumptions on M and M to ensure that every set in M / M is coded by a set of ordinals in M / M , and to strengthen the conclusion to M = M , as was done in the result due to Laver referenced above. However, the present form of the result seems to be a little more convenient here.
Theorem 7.
Let λ 2 be a cardinal. Let κ λ be regular. Then HOD is definable in < λ - HOD using P ( κ ) HOD as a parameter.
Remark: If λ ω , then HOD is trivially definable in < λ - HOD without parameters, since then, < λ - HOD = HOD . For λ > ω , note that by a result of Gitik [13], it is consistent with ZF (assuming the consistency of very large cardinals) that every uncountable cardinal is singular, so there may be no κ as stated. However, of course, ZFC implies that λ + is regular.
Proof. 
Let λ ω , and let κ λ be regular.
Let z = P ( κ ) HOD . Working in < λ - HOD , and using the fact that κ is regular, we have that for every ordinal θ , if there is a transitive model M satisfying the conditions of Theorem 6 with θ = On M and P ( κ ) M = z , which satisfies the κ -approximation and cover properties in V θ , such that ( κ + ) M = κ + , then for any other such model N , we have that P ( θ ) M = P ( θ ) N . Let me denote this common value of P ( θ ) M by S θ . If such an M does not exist, then let S θ be undefined. Let I be the class of θ such that S θ is defined.
If θ > κ + and θ is a limit ordinal in < λ - HOD then V θ HOD is a model as above, and so, S θ = P ( θ ) V θ HOD . This is because ( κ + ) V θ HOD = ( κ + ) < λ - HOD by Proposition 6, and because HOD satisfies the κ -approximation and -cover properties in < λ - HOD by Theorem 3—this easily implies that V θ HOD satisfies the κ -approximation and -cover properties in V θ < λ - HOD . The other conditions are also easily seen to be satisfied by V θ HOD .
Still working in < λ - HOD , let J = { θ I | θ > κ + is a limit ordinal } . We can define in < λ - HOD :
S = θ J S θ .
Then S = P ( On ) HOD . It follows that the class S ^ of sets coded by an element of S is equal to HOD . Here, let me say that a code is just a relation r α × α (which can easily be coded as a set of ordinals), for some ordinal α , such that α , r is well-founded and extensional. By Mostowski’s theorem, there are a unique transitive set u and a unique bijective function π : α u that constitutes an isomorphism between α , r and u , u . The set coded by r is π ( 0 ) . Since HOD is a model of ZFC , every element a of it has a code r HOD , which is in S, and consequently, a S ^ . Moreover, S HOD , and so, S ^ HOD . Thus, S ^ = HOD is definable in < λ - HOD using P ( κ ) HOD as a parameter, as claimed. □
The original use of the approximation and cover properties in [7] was that the passage from the smaller to the larger model does not create new large cardinals of various types. I will just mention two instances of this phenomenon here. If < κ - HOD satisfies the axiom of choice, then all the results from [7] apply.
Proposition 7.
Let κ be an infinite cardinal, and let λ κ be inaccessible in HOD .
(1)
If λ weakly compact in < κ - HOD , then it is weakly compact in HOD .
(2)
If λ is measurable in < κ - HOD , then it is measurable in HOD .
Proof. 
To see (1), let T be a λ -tree in HOD . Since λ is weakly compact in < κ - HOD , T has a cofinal branch b there. However, < κ - HOD has no fresh λ -sequence over HOD , by 4, so b HOD .
For (2), the argument of [7] (Theorem 10) applies verbatim. □
This shows that < κ - HOD does not capture that much more of the large cardinal structure of V than HOD does. On the one hand, if κ is inaccessible, then V κ < κ - HOD = V κ , so that large cardinal properties of V witnessed by V κ are inherited by < κ - HOD . However, recall that it was shown in [14] (Theorem 4) that it is consistent that a supercompact cardinal λ is not weakly compact in HOD – so if κ λ , then λ is not weakly compact in < κ - HOD either, by Proposition 7.
Finally, I would like to make a quick connection to Woodin’s work on the HOD dichotomy. Without going into too many details, it can be formulated as follows.
Theorem 8
( HOD dichotomy theorem, Woodin [15] (Thm. 3.39)). Suppose that δ is an extendible cardinal. Then exactly one of the following holds:
(1)
Every regular cardinal δ is ω-strongly measurable in HOD .
(2)
No regular cardinal δ is ω-strongly measurable in HOD . Furthermore, HOD is a weak extender model for the supercompactness of δ.
Here, an inner model N of ZFC is called a weak extender model for the supercompactness of δ if for every γ > δ , there is a δ -complete, normal, fine measure U on P δ ( γ ) such that N P δ ( γ ) U and U N N . To be able to follow, it is not necessary to know what it means that a cardinal is ω -strongly measurable in HOD ; suffice it to say that it implies that the cardinal in question is measurable in HOD . The HOD hypothesis says that there is a proper class of regular cardinals which are not ω -strongly measurable in HOD . Thus, if the HOD hypothesis holds and there is an extendible cardinal δ , then HOD is a weak extender model for the supercompactness of δ . Here is the salient fact on weak extender models from Woodin’s analysis.
Lemma 1
(Woodin [15] (Lemma 3.8)). If N is a weak extender model for the supercompactness of δ, then N satisfies the δ-cover property in V .
I can now make the connection to blurry HOD I was aiming at.
Proposition 8
( ZFC ). Suppose δ is extendible. Then the HOD hypothesis implies that
[ HOD ] < δ < δ - HOD .
Proof. 
Let a HOD , with a ¯ ¯ < δ . By our assumption, HOD is a weak extender model for the supercompactness of δ , so by Lemma 1, HOD satisfies the δ -cover property in V . This means that there is a c HOD such that a c and c ¯ ¯ < δ . Let A = P ( c ) . Since δ is inaccessible, A ¯ ¯ < δ . Since c HOD , A is OD . In addition, clearly, a A , showing that a < δ - HOD , as claimed. □
Recent work of Goldberg [16] reduces the assumption in Proposition 8 from an extendible cardinal to a strongly compact one.

2.4. Leaps

Clearly, in a model where V = HOD , we have that for every cardinal κ > 1 , V = HOD < κ - HOD V , so that HOD = < κ - HOD . On the other hand, if V HOD is a ZFC model, then since by Proposition 1(5), V = κ Card < κ - HOD is an increasing union, there must be stages γ at which < γ - HOD contains something new. These stages are obviously interesting, and I call them leaps.
Definition 6.
A cardinal λ > 2 is a leap if
< δ - HOD < λ - HOD ,
for every cardinal δ < λ . I write Λ α | α < Θ for the monotone enumeration of the leaps (it is the empty sequence, i.e., Λ 0 is undefined, if there is no leap). A leap λ is a successor leap if λ = Λ ξ + 1 , for some ξ, and it is a limit leap if it is of the form λ = Λ ξ , where ξ is a limit ordinal.
Lemma 2.
Leaps have the following properties.
(1)
The class of leaps is closed in the ordinals.
(2)
Λ 0 , if defined, is an uncountable successor cardinal.
(3)
Successor leaps are successor cardinals.
Proof. 
(1) is trivial.
(2): Λ 0 must be uncountable by Theorem 1. Now assume Λ 0 is a limit cardinal. Let a be ∈-minimal in < Λ 0 - HOD HOD . So a HOD . Since a < Λ 0 - OD , and Λ 0 is a limit cardinal, it follows that a is < λ - OD , for some λ < Λ 0 . However, then a < λ - HOD HOD (as a HOD < λ - HOD ). However, then λ is a leap less than Λ 0 , a contradiction.
(3): Assume Λ ξ + 1 were a limit cardinal. Pick a∈-minimal in < Λ ξ + 1 - HOD < Λ ξ - HOD . Since a < Λ ξ + 1 - HOD , it follows that a < Λ ξ + 1 - HOD , and hence that a < Λ ξ - HOD , by ∈-minimality. In addition, since a < Λ ξ + 1 - OD and Λ ξ + 1 is a limit cardinal, it follows that a < λ - OD , for some cardinal λ < Λ ξ + 1 which we may choose so that λ Λ ξ . Since a < Λ ξ - HOD , it follows that a < λ - HOD , and so, since a < λ - OD , a < λ - HOD . However, since there is no leap in ( Λ ξ , λ ] , < λ - HOD = < Λ ξ - HOD . So a < Λ ξ - HOD , a contradiction. □
By Lemma 2, item (1), limit leaps occur automatically, in a sense. However, it is an interesting question whether a stronger property can hold.
Definition 7.
Say that a leap γ is a big leap if
δ < γ , δ Card < δ - HOD < γ - HOD .
Successor leaps are always big leaps, but what can be said about limit leaps? Perhaps somewhat surprisingly, they are also big.
Theorem 9.
Every leap is big.
Proof. 
Assume the contrary. Let λ be the least counterexample. Since successor leaps are clearly big leaps, λ must be a limit leap. Let S = { κ < λ | κ is a leap } . So S is unbounded in λ , and by minimality of λ , every leap in S is a big leap. For κ S , let τ κ = α κ , β κ , φ κ , be the (lexicographically) least code for an element of < κ - HOD κ ¯ Card κ < κ ¯ - HOD , i.e., A κ = { x | Sat ( V α κ , φ κ , β κ ) } has cardinality less than κ , there is an a A κ such that a < κ - HOD κ ¯ Card κ < κ ¯ - HOD , and τ κ is minimal with this property.
Note that the sequence τ κ | κ S is ordinal definable from the parameter λ . Now define
B κ = A κ < κ - HOD
for κ S . The sequence B = B κ | κ S is then OD , and it is actually < λ - HOD , because every element of it is of the form κ , B κ , for some κ S . Now B κ is OD , and B κ < κ - HOD < λ - HOD . Thus, B κ < λ - HOD , and so, κ , B κ is < λ - HOD . Therefore, the whole sequence B is, as a set, contained in < λ - HOD , and it is OD , hence it is < λ - HOD .
However, clearly, B < κ - HOD , for κ Card λ , because we can pick κ S ( κ + 1 ) , so that there is an a B κ with a < κ - HOD . Clearly then, B cannot belong to < κ - HOD , since < κ - HOD is transitive. □
Theorem 10.
If λ is a limit leap, then < λ - HOD does not satisfy the axiom of choice; more precisely, λ ¯ - AC fails in < λ - HOD , where λ = Λ λ ¯ .
Proof. 
Let us improve the sequence B of the proof of Theorem 9 slightly. First, let us work with
T = { κ < λ | κ is a successor leap } .
For a successor leap κ , let κ be its predecessor leap. For κ T , let τ κ = α κ , β κ , φ κ be the least code for an ∈-minimal element of < κ - HOD < κ - HOD (in the same sense as in the previous proof), and let A κ = { x | Sat ( V α κ , φ κ , β κ ) } . Let
B κ = { x A κ | x is - minimal in < κ - HOD < κ - HOD } .
Therefore, for every b B κ , b < κ - HOD , b < κ - HOD , but b < κ - HOD ; the latter by ∈-minimality. As above, B = B κ | κ T is OD , and B belongs to < λ - HOD . It is a sequence of nonempty sets, and I claim that it has no choice function in < λ - HOD : suppose it did. Let b = b κ | κ T < λ - HOD be such that for every κ T , b κ B κ . Since b < λ - HOD , it is < γ - OD , for some cardinal γ < λ . Let X witness this, i.e., let X be OD and of cardinality less than γ , so that b X . Let
Y = X κ T B κ .
Clearly, Y is still OD , has cardinality less than γ , and has b Y .
Now pick κ T such that γ κ . I claim that b κ < κ - HOD , a contradiction. Specifically, let
Z = { x ( κ ) | x Y } .
This is an OD set of cardinality at most Y ¯ ¯ < γ κ , and b κ belongs to it. So b κ is < κ - OD . In addition, since b κ B κ , we know that b κ < κ - HOD . Thus, b κ < κ - HOD , as claimed. This contradiction completes the proof. □
In the notation of the previous proof, the question arises naturally, at which level δ a choice function for B gets into < δ - HOD . This may depend on cardinal arithmetic. Clearly, all such choice functions are in < ( 2 λ ) + - HOD . Can one be in < λ + - HOD already? We do not know.
Corollary 2.
In a ZFC model, the largest leap, if there is one, is a successor leap.
Therefore, both the first and the last leap, if they exist, are successor cardinals.

3. Effects of Forcing on Blurry Definability

The main method for producing models of set theory with interesting leap structures is going to be forcing. In this section, I will investigate how < κ - HOD V relates to < κ - HOD V [ G ] , where G is generic over V for certain notions of forcing. First, let me find ways to ensure that being in < κ - HOD is preserved, i.e., that < κ - HOD V < κ - HOD V [ G ] .

3.1. Preserving Blurry Definability

Proposition 9.
Suppose that P is a notion of forcing, G is generic for P over V , and V is a class in V [ G ] definable from ordinal parameters. Let κ be a cardinal in V [ G ] . Then < κ - OD V < κ - OD V [ G ] , and so, < κ - HOD V < κ - HOD V [ G ] as well.
Proof. 
Let a < κ - OD , and let A witness this, i.e., A = { x | φ ( x , α ) } , for some formula φ and some ordinal α , where a A and A ¯ ¯ < κ . Let ψ ( x , β ) define V in V [ G ] . Then A = { x | ψ ( x , β ) φ { z | ψ ( z , β ) } ( x , α ) } V [ G ] , and A ¯ ¯ V [ G ] < κ , so a < κ - OD V [ G ] . It follows immediately that < κ - HOD V < κ - HOD V [ G ] . □
The assumption that V is definable from ordinals in V [ G ] can be weakened as follows.
Proposition 10
( ZFC ). Suppose that P is a notion of forcing, G is generic for P over V , κ is a cardinal in V [ G ] , and V is definable in V [ G ] from a parameter in < κ - OD V [ G ] . Then
< κ - OD V < κ - OD V [ G ]
and so, < κ - HOD V < κ - HOD V [ G ] as well.
Proof. 
Let b < κ - OD V [ G ] and ψ ( x , y ) be a formula such that
V = { x | ψ ( x , b ) } V [ G ] .
Since b < κ - OD V [ G ] , we can also let B be OD V [ G ] so that b B and B has cardinality less than κ in V [ G ] .
Now, in V , let a < κ - OD , and let A witness this, i.e., A = { x | φ ( x , α ) } , for some formula φ and some ordinal α , where a A and A ¯ ¯ V < κ . We must show that a is also < κ - OD V [ G ] .
To this end, let A ¯ ¯ V [ G ] = κ ¯ < κ , and let χ ( x , y ) be a formula and β an ordinal such that B = { x | χ ( x , β ) V [ G ] } . We can now define
A = z | b w ( χ ( b , β ) w = { x | φ ( x , α ) { x | ψ ( x , b ) } } w ¯ ¯ = κ ¯ z w V [ G ] .
Clearly, a A , as witnessed by b = b (and w = { x | φ ( x , α ) V } ), and A ¯ ¯ < κ in V [ G ] , since in V [ G ] , A is a union of fewer than κ sets, each of cardinality κ ¯ < κ . Since A is OD V [ G ] , it follows that a < κ - OD V [ G ] , as claimed. □
As a corollary, one obtains a preservation by small forcing result.
Corollary 3.
Let κ be a cardinal, and let P be a notion of forcing of cardinality γ, where 2 ( 2 γ ) < κ . If G is P -generic over V , then
< κ - HOD V < κ - HOD V [ G ] .
Proof. 
By a result of Woodin [17], V is (uniformly) definable in V [ G ] from the parameter P ( γ ) V . This parameter is an element of Z = P ( P ( γ ) ) V [ G ] . Since P is γ + -c.c., it preserves cardinals above γ , so the cardinality of Z in V [ G ] is 2 ( 2 γ ) V < κ , so Z is < κ - OD V [ G ] . The claim now follows from Proposition 10. □

3.2. Not Adding to Blurry HOD

Having seen how to preserve membership to < κ - HOD when passing to a forcing extension, let us now turn to the converse problem, ensuring that nothing is added to < κ - HOD . Homogeneity properties of the forcing notions in question will play an important role. The following is a folklore concept; I follow the terminology of [18].
Definition 8.
Let P be a forcing notion. For p P , let the cone below p in P be the set
P p = { q P | q p }
equipped with the restriction of the ordering of P .
P is called cone homogeneous if for any two conditions p , q P , there are p p and q q such that P p and P q are isomorphic.
First, let me prove two general lemmas. I say that a forcing notion P is < κ -closed, where κ is a regular cardinal, if every decreasing sequence in P of length less than κ has a lower bound. The following lemma generalizes the well-known folklore fact that if G is generic for a cone homogenous forcing notion, then HOD V [ G ] V —note that any forcing notion is < ω -closed.
Lemma 3.
Let κ be a regular cardinal, P a cone homogeneous, < κ -closed forcing notion, and let G P be P -generic over V . Then
< κ - HOD V [ G ] V .
Proof. 
Assume the contrary, and let a be ∈-minimal in < κ - HOD V [ G ] V . Then a V , and there is an OD V [ G ] set A = { x | φ ( x , ρ ) } V [ G ] such that a A and A ¯ ¯ V [ G ] = κ ¯ < κ . Let a = a ˙ G , and let p P force all of these facts: that a ˙ is ∈-minimal in < κ ˇ - HOD V [ G ˙ ] V ˇ , that φ ( a ˙ , ρ ˇ ) holds, and that { x | φ ( x , ρ ˇ ) } has cardinality κ ¯ ˇ .
In V , note that for every condition q p , there are q 0 , q 1 q and a set d such that q 0 d ˇ a ˙ while q 1 d ˇ a ˙ , because otherwise, q would decide, for every d, the statement “ d ˇ a ˙ ”. However, since q p , q also forces that a ˙ V . It would follow that a = { d | p d ˇ a ˙ } V , contradicting our assumption that p forces that a ˙ V ˇ .
This enables us to construct, in V , sequences q s | s κ ¯ 2 and d s | s < κ ¯ 2 with the following properties:
  • q = p ,
  • q s P , and s t q t P q s ,
  • q s 0 P d s ˇ a ˙ and q s 1 P d s ˇ a ˙ , for s < κ ¯ 2 .
To define q s when dom ( s ) is a limit ordinal, we use that fact that this limit ordinal is at most κ ¯ , which is less than κ , and that P is < κ -closed.
Let me temporarily fix a function s : κ ¯ 2 in V . Consider the set
D s = { p p | q q s P p is isomorphic to P q } .
It is easily seen that D s is dense below p, since P is cone homogeneous. It follows that there is a condition p s G D s . Let q s q s and π s V witness this, i.e.,
π s : P p s P q s
is an isomorphism. Then, G s = π s [ G ] is generic for P q s . G s generates a generic filter G s in P that contains q s , and since π s V , it follows that
V [ G ] = V [ G s ] φ ( a ˙ G s , ρ ) .
However, note that if t s is another member of κ ¯ 2 , then a ˙ G s a ˙ G t , because if δ = min { i < κ | s ( i ) t ( i ) } , then q s P d ˇ s δ a ˙ q t P d ˇ s δ a ˙ .
Since P is < κ -closed, it follows that ( κ ¯ 2 ) V = ( κ ¯ 2 ) V [ G ] . Therefore, in V [ G ] , the set
{ a ˙ G s | s : κ ¯ 2 }
is a 2 κ ¯ -sized subset of A. This contradicts that A has cardinality κ ¯ in V [ G ] . □
Lemma 4.
Let κ ¯ be a cardinal, and let P be a cone homogeneous forcing that preserves cardinals up to κ ¯ , such that whenever G is P -generic over V , then
< κ ¯ - HOD V [ G ] V .
If P is < κ ¯ - OD , then for any P -generic filter G, we have that
< κ ¯ - HOD V [ G ] < κ ¯ - HOD V .
Proof. 
Assume the contrary. Let a be ∈-minimal in < κ ¯ - HOD V [ G ] < κ ¯ - HOD V . So a < κ ¯ - HOD V . We also know that a V . Since a is < κ ¯ - OD V [ G ] , we can pick an OD V [ G ] set A = { φ ( x , ρ ) } V [ G ] such that a A and such that in V [ G ] , A ¯ ¯ = δ < κ ¯ . By the cone homogeneity of P it follows that every condition in P forces that A ¯ ¯ = δ ˇ —this is one of the folklore consequences of cone homogeneity of P : if some condition r P forces a statement of the form ψ ( a ˇ 0 , , a ˇ n ) , then every condition in P forces this. This is easily seen, because otherwise we would have another condition, say s, forcing the negation of the statement. We could then find extensions r r and s s such that P r is isomorphic to P s . If H is generic for P r , then H generates a filter H which is generic for P , and in V [ H ] , φ ( a 0 , , a n ) holds, since r H . However, applying the isomorphism to H gives a P s -generic, say I, which also generates a P -generic filter I , and in V [ I ] , φ ( a 0 , , a n ) fails, since s I . However, clearly, V [ H ] = V [ I ] , a contradiction. I will use this consequence of cone homogeneity in the future without further justification.
Furthermore, since P is < κ ¯ - OD V , there is a set B = { x | ψ ( x , τ ) } V such that P B and B ¯ ¯ < κ ¯ . We may assume that all elements of B are cone homogeneous forcing notions that preserve cardinals up to κ ¯ and force that the cardinality of the set { x | φ ( x , ρ ˇ ) } is δ , since we can add these requirements to the definition of B if necessary.
Fixing a Q B , consider the set
A Q = { x | Q φ ( x ˇ , ρ ˇ ) } .
Since Q preserves cardinals up to κ ¯ and forces that the set { x | φ ( x , ρ ˇ ) } has cardinality δ , and since obviously, Q A ˇ Q { x | φ ( x , ρ ˇ ) } , it follows that A Q has cardinality at most δ in V . Moreover, we have that a A P , because P φ ( a ˇ , ρ ˇ ) .
To conclude, the set
C = Q B A Q
is OD V and has cardinality at most B ¯ ¯ · δ < κ ¯ , and it contains a, since P B and a A P . So a is < κ ¯ - OD V . Since a < κ ¯ - HOD V , this shows that a < κ ¯ - HOD V , contradicting the choice of a. □
The following corollary again nicely generalizes a well-known folklore fact, that if P is a cone homogeneous forcing notion that is OD , and G is P -generic over V , then HOD V [ G ] HOD V .
Corollary 4.
Let κ be a regular cardinal, P a cone homogeneous, < κ -closed forcing notion, κ ¯ κ a cardinal such that P is < κ ¯ - OD , and let G P be P -generic over V . Then
< κ ¯ - HOD V [ G ] < κ ¯ - HOD V .
Proof. 
By Lemma 3, it follows that < κ ¯ - HOD V [ G ¯ ] V , whenever G ¯ is P -generic over V . Hence, Lemma 4 applies, immediately showing the claim. □

3.3. Cohen Forcing

By “Cohen forcing” I mean the standard forcing to add a subset to a regular cardinal κ by approximations of size less than κ , often denoted Add ( κ , 1 ) . In this case, we can do a little better.
Theorem 11
( ZFC ). Let κ be an infinite regular cardinal such that 2 < κ < 2 κ , and let G be generic for P = Add ( κ , 1 ) . If κ ¯ is a cardinal less than or equal to 2 κ in V [ G ] , then
< κ ¯ - HOD V [ G ] < κ ¯ - HOD V .
Note: P is ( 2 < κ ) + -c.c, so under the assumptions of the theorem, P preserves 2 κ as a cardinal, and we have that ( 2 κ ) V = ( 2 κ ) V [ G ] . The forcing collapses 2 < κ to κ and preserves all cardinals up to κ .
Proof. 
I take P to consist of all functions of the form f : α κ , where α < κ , ordered by reverse inclusion. This forcing is < κ -closed, and hence does not add a new < κ -sequence of ground model elements.
(1)
< 2 κ - HOD V [ G ] V .
Proof of (1). 
Assume the contrary, and let a < 2 κ - HOD V [ G ] V be ∈-minimal. Then a V . Let a ˙ V P be such that a = a ˙ G . Since a < 2 κ - HOD V [ G ] , there is an OD V [ G ] set A such that a A and A ¯ ¯ V [ G ] < 2 κ . Let A = { x | φ ( x , α ) } V [ G ] , where α is some ordinal. Let p G force that φ ( a ˙ , α ˇ ) holds and that a ˙ is contained in V ˇ , but is not an element of V ˇ .
Define
G = { H V [ G ] | p H P , H is a P - generic filter over V , and V [ H ] = V [ G ] } .
It is easy to see that G V [ G ] .
(1.1)
If H G , then a ˙ H A .
Proof of (1.1).
Since p H , V [ H ] φ ( a ˙ H , α ) , so since V [ H ] = V [ G ] , V [ G ] φ ( a ˙ H , α ) , and this means that a ˙ H A . □
The strategy is going to be to show that G is very rich: there are 2 κ filters in G that interpret a ˙ differently. This, together with (1.1), will produce a contradiction.
Let us now work in V for a while.
(1.2)
For every q p , there are a set d and conditions r 1 , r 2 q such that r 1 d ˇ a ˙ and r 2 d ˇ a ˙
Proof of (1.2). 
A condition q constituting a counterexample would decide, for every d, the statement “ d ˇ a ˙ ”. It would also force that a ˙ V ˇ , since q p . Hence, it would force that a ˙ V , while p forces that a ˙ is not in V , a contradiction. □
Now, fix a condition q p . Let d ( q ) be such that there are q 0 , q 1 q that decide “ ( d ( q ) ) ˇ a ˙ ” in different ways. Let A q be a set of conditions such that
(a)
for every r A q , r < q ,
(b)
A q is an antichain,
(c)
A q is maximal with (a) and (b),
(d)
every r A q decides “ ( d ( q ) ) ˇ a ˙ ,”
(e)
both of the sets
A q + = { r A q | r P ( d ( q ) ) ˇ a ˙ } and A q = { r A q | r P ( d ( q ) ) ˇ a ˙ }
have cardinality κ .
Let EVEN be the collection of the even ordinals below κ (including the limit ordinals), and let ODD consist of the odd ones. Let e q : κ A q be a bijection such that e q [ EVEN ] = A q + and e q [ ODD ] = A q .
Define a function F : P p P p by recursion, as follows. To begin, set F ( p ) = p .
Given that F ( r ) = s is defined, let, for i < κ ,
F ( r i ) = e s ( i ) .
Finally, if dom ( r ) = λ < κ is a limit ordinal and F ( r α ) has been defined for all dom ( p ) α < λ , then set
F ( r ) = dom ( p ) α < λ F ( r α ) .
(1.3)
F : P p P p is a dense embedding.
Proof of (1.3). 
Let t p be given. I will define a condition s p such that F ( s ) t . This will be done by defining s α , for dom ( s ) α dom ( p ) . It will be maintained that either F ( s α ) t (in which case we let α = dom ( s ) and s is completely defined), or t F ( s α ) .
To begin, let s dom ( p ) = p . We have F ( p ) = p t .
Now suppose α > dom ( p ) and for all β < α , s β has been defined.
If α is a limit ordinal, then s α is already determined as β < α s β . Then, F ( s α ) = dom ( p ) β < α F ( s β ) . Inductively, we have that F ( s β ) t , for every dom ( p ) β < α , and so, F ( s α ) t as well.
Now suppose α = β + 1 is a successor ordinal. We have that q = F ( s β ) t . If there is an i < κ such that F ( s β i ) t , then let s ( β ) = i , and we are done. If not, then no condition in A q is below t, and since A q is a maximal antichain below q, there is a (unique) r A q with t r —there cannot be more than one such r, since A q is an antichain, and there must be at least one such r, because A q is a maximal antichain below q: some r A q must be compatible with t, and r t , so it must be that t r , since P is a tree. Letting r be the unique condition in A q with t r , let e q ( i ) = r and set s ( β ) = i . Then F ( s α ) = e q ( i ) = r t .
Now clearly, this process must stop at some point, or else we end up with a function s : κ κ such that s t , but dom ( t ) < κ . This means that a condition s is reached with s t , as claimed. □
Since F V is a dense embedding from P p to P p , it follows that if I P is a generic filter, then F [ I ] generates a generic filter F [ I ] , and V [ I ] = V [ F [ I ] ] .
Now, for every x [ dom ( p ) , κ ) , x V , let π x : P P be the automorphism of P defined as follows. First, π x does not change the domains of conditions, i.e., for q P , dom ( π x ( q ) ) = dom ( q ) . In addition, for i dom ( q ) , define
( π x ( q ) ) ( i ) = q ( i ) if i x , q ( i ) + 1 if i x and q ( i ) is even , q ( i ) 1 if i x and q ( i ) is odd .
Note that π x V , and that the restriction of π x to P p is an automorphism as well. It follows that
V [ G ] = V [ π x [ G ] ] = V [ F [ π x [ G ] ] ] .
Thus, writing H x for F [ π x [ G ] ] , we have that H x G , and so, by ( 1.1 ) , a ˙ H x A . However, if x 0 x 1 are any two distinct subsets of [ dom ( p ) , κ ) , both in V , then a ˙ H x 0 a ˙ H x 0 . This is because if we let g = G and δ = min ( x 0 x 1 ) , then d F ( g δ ) is going to belong to exactly one of a ˙ H x 0 , a ˙ H x 1 . Hence, we have that { a ˙ H x | x P ( κ ) V } A , which means that the cardinality of A is at least 2 κ in V [ G ] , a contradiction. □
Now let κ ¯ 2 κ be a cardinal in V [ G ] .
(2)
< κ ¯ - HOD V [ G ] V .
Proof of (2). 
This is because < κ ¯ - HOD V [ G ] < 2 κ - HOD V [ G ] , as κ ¯ 2 κ , and since < 2 κ - HOD V [ G ] V by (1). □
(3)
< κ ¯ - HOD V [ G ] < κ ¯ - HOD V .
Proof of (3). 
Again, assume the contrary. Let a be ∈-minimal in < κ ¯ - HOD V [ G ] < κ ¯ - HOD V . Then a < κ ¯ - HOD V . I will show that a is < κ ¯ - OD V , which then implies that a < κ ¯ - HOD V , contradicting the choice of a.
Let a A = { x | φ ( x , α ) } V [ G ] , where A ¯ ¯ V [ G ] < κ ¯ . Since a < κ ¯ - HOD V [ G ] , we know by (2) that a V . By the weak homogeneity of P , P φ ( a ˇ , α ˇ ) . Define in V :
B = { x | P φ ( x ˇ , α ˇ ) } .
Since P is OD , this is a definition of B using only ordinal parameters. Clearly, a B A . So B ¯ ¯ V [ G ] A ¯ ¯ V [ G ] < κ ¯ . However, then, B ¯ ¯ V < κ ¯ as well (otherwise, there would be in V a surjection from B onto κ ¯ , and this surjection would also exist in V [ G ] , but in V [ G ] , B ¯ ¯ < κ ¯ ). So a < κ ¯ - OD V , which yields the desired contradiction. □
This completes the proof of the theorem.
Corollary 5.
Assume V = L , and let κ be an infinite regular cardinal. If G is generic for P = Add ( κ , 1 ) , then
L = HOD L [ G ] = < κ + - HOD L [ G ] < κ + + - HOD L [ G ] = L [ G ] .
In particular, Λ 0 L [ G ] = κ + + .
Proof. 
Again, view P as consisting of all functions of the form f : α κ , where α < κ . P is κ -closed and κ + -c.c., by the GCH in L, and hence preserves cardinals. Since < κ + - HOD L trivially is equal to L, we have that < κ + - HOD L < κ + - HOD L [ G ] . By Theorem 11, < κ + - HOD L [ G ] < κ + - HOD L . However, clearly, L < κ + - HOD L L , and we have seen that HOD L [ G ] < κ + - HOD L [ G ] . Putting this together gives L = HOD L [ G ] = < κ + - HOD L [ G ] .
Now let us consider G , a function from κ to κ , as a subset of κ × κ . Then G P ( κ × κ ) L [ G ] , and P ( κ × κ ) L [ G ] is an OD L [ G ] set of cardinality κ + . Thus, G is < κ + + - OD L [ G ] , and since G κ × κ OD L [ G ] , it follows that G < κ + + - HOD L [ G ] . Therefore, since G is absolutely definable from G , G < κ + + - HOD L [ G ] . However, since < κ + + - HOD L [ G ] is an inner model of L [ G ] , this implies directly that < κ + + - HOD L [ G ] = L [ G ] .
The statement about Λ 0 L [ G ] is immediate. □
This may be a good place to make a connection to ordinal indiscernibility and the Leibniz–Mycielsky axiom. For a nice summary of the history and some recent results on the subject, see [19], and for a connection to Ehrenfeucht’s lemma, see [20]. Two sets a and b are called ordinal indiscernible if for every formula φ ( x , y ) in the language of set theory and every ordinal α , φ ( a , α ) holds iff φ ( b , α ) holds. Since ordinal parameters are used in this definition, the concept of ordinal indiscernibility is first order definable, just as ordinal definability. The Leibniz–Mycielsky axiom says that no distinct elements a and b are ordinal indiscernible, i.e., whenever a b , then a and b can be distinguished by a property with an ordinal parameter.
There is an obvious connection between ordinal indiscernibility and blurry ordinal definability: suppose that I = { a i | i < κ } is a set of κ many ordinal indiscernible elements. Then none of them can be < κ - OD , because if some a i belongs to { x | φ ( x , α ) } , then every a i does, and so the set { x | φ ( x , α ) } , if it contains one of the ordinal indiscernibles, must have cardinality at least κ . However, note that the sets in < κ + + - HOD < κ + - HOD obtained in the previous corollary are subsets of κ × κ , hence essentially sets of ordinals. As such, they are clearly not ordinal indiscernibles, because given a b , both sets of ordinals, if α is in the symmetric difference of a and b, then the formula “ α x ” distinguishes a and b.
The process of adding Cohen subsets can be iterated transfinitely. The following theorem is just an example. It is interesting to note that iterated Cohen forcing has been put to good use in the context of ordinal definability in [21] as well.
Theorem 12.
Assume V = L . Let λ be a cardinal, and let P i | i λ , Q ˙ i | i < λ be the reverse Easton iteration whose only nontrivial stages are when i = κ is an infinite regular cardinal, 1 l P κ P κ Q ˙ κ = Add ( κ , 1 ) . Let G be P = P λ -generic over L. Then:
(a)
For regular κ < λ , L [ G ( κ + 1 ) ] = < κ + + - HOD L [ G ] , and
G ( κ ) < κ + + - HOD L [ G ] < κ + - HOD L [ G ] . So κ + + is a leap in L [ G ] .
(b)
L = < ω 1 - HOD L [ G ] , so ω 1 is not a leap in L [ G ] .
(c)
For any limit cardinal κ λ , G κ < κ + + - HOD L [ G ] < κ + - HOD L [ G ] . So κ + + is a leap in L [ G ] .
Remark 2.
Thus, in L [ G ] , if ω κ λ , and either κ is regular and κ < λ , or κ is a limit cardinal, then κ + + is a leap. All limit cardinals up to λ are also leaps, but ω 1 is not.
Proof. 
First, towards proving part (a), it is easy to see that
(1)
L [ G ( κ + 1 ) ] = < κ + + - HOD L [ G ( κ + 1 ) ] .
This is because G ( κ + 1 ) is coded by a subset X of κ , and arguing in L [ G ( κ + 1 ) ] , X belongs to the OD set P ( κ ) , which has cardinality less than κ + + . Thus, X is < κ + + - OD L [ G ( κ + 1 ) ] , so since X is a set of ordinals, X < κ + + - HOD L [ G ( κ + 1 ) ] , and because X codes G ( κ + 1 ) , it follows that G ( κ + 1 ) < κ + + - HOD L [ G ( κ + 1 ) ] . Since < κ + + - HOD L [ G ( κ + 1 ) ] is an inner model of L [ G ( κ + 1 ) ] , it follows that L [ G ( κ + 1 ) ] < κ + + - HOD L [ G ( κ + 1 ) ] L [ G ( κ + 1 ) ] .
The same argument shows that
(2)
L [ G ( κ + 1 ) ] < κ + + - HOD L [ G ] .
Therefore, we must prove the reverse inclusion. Of course, nothing needs to be shown if κ + = λ ; in this case, L [ G ] = L [ G ( κ + 1 ) ] , so we trivially have that < κ + + - HOD L [ G ] L [ G ] = L [ G ( κ + 1 ) ] . Therefore, let us assume that κ + < λ .
Now, κ + is the next nontrivial stage of forcing. From the point of view of L [ G ( κ + 1 ) ] , L [ G ( κ + + 1 ) ] is obtained by forcing with Add ( κ + , 1 ) . Applying Theorem 11 in L [ G ( κ + 1 ) ] yields:
(3)
< κ + + - HOD L [ G ( κ + + 1 ) ] < κ + + - HOD L [ G ( κ + 1 ) ] .
Now if κ + + = λ , then there is nothing left to show, because L [ G ] = L [ G ( κ + + 1 ) ] , so the previous displayed formula says that < κ + + - HOD L [ G ] < κ + + - HOD L [ G ( κ + 1 ) ] . Therefore, let us assume that κ + + < λ .
The passage from L [ G ( κ + + 1 ) ] to L [ G ] is then the tail of the iteration, let us call it P tail . The next nontrivial stage in P tail is κ + + , and the forcing is < κ + + -closed. Moreover, each iterand is weakly homogeneous in the sense of [18] (called almost homogeneous in [22]), which implies that P tail is weakly homogeneous; see [18] (Lemma 4). Weak homogeneity implies cone homogeneity, by [18] (Fact 1), so Corollary 4 can be applied in L [ G ( κ + + 1 ) ] , showing that
(4)
< κ + + - HOD L [ G ] < κ + + - HOD L [ G ( κ + + 1 ) ] .
Together with (3), this shows that
(5)
< κ + + - HOD L [ G ] < κ + + - HOD L [ G ( κ + 1 ) ] .
It follows that < κ + + - HOD L [ G ] L [ G ( κ + 1 ) ] , by (1).
The second claim in (a) is that G ( κ ) < κ + + - HOD L [ G ] < κ + - HOD L [ G ] . It is obvious that G ( κ ) < κ + + - HOD L [ G ] , because G ( κ ) is essentially a subset of κ , and hence an element of the OD set P ( κ ) . To see that G ( κ ) does not belong to < κ + - HOD L [ G ] , suppose it did. Corollary 4 would then imply that G ( κ ) < κ + - HOD L [ G ( κ + 1 ) ] , because the forcing leading from L [ G ( κ + 1 ) ] to L [ G ] is < κ + -closed and cone homogeneous. However, then Theorem 11 would yield that G ( κ ) < κ + - HOD L [ G κ ] , which is absurd.
Part (b), that L = < ω 1 - HOD L [ G ] , follows similarly, because < ω 1 - HOD L [ G ( ω + 1 ) ] L by Theorem 11, and because < ω 1 - HOD L [ G ] < ω 1 - HOD L [ G ( ω + 1 ) ] since the forcing from L [ G ( ω + 1 ) ] to L [ G ] is < ω 1 -closed and weakly homogeneous (again using Corollary 4.)
Finally, let us turn to (c). First, it is obvious that G κ < κ + + - HOD L [ G ] , since it is (coded by a set) in P ( κ ) L [ G ] , which is OD L [ G ] and has cardinality κ + there.
Next, let me show that
(6)
G κ < κ + - HOD L [ G κ ] .
Assume the contrary. Let G ˙ be the canonical P κ -name for the generic filter, and let p P κ force that φ ( G ˙ , ρ ˇ ) holds, for some formula φ and some ordinal ρ such that p also forces that A = { x | φ ( x , ρ ˇ ) } has cardinality at most κ ˇ . Arguing in the ground model L, let, for every ordinal i < κ , Π i be the set of bijections between i and i. For regular γ , every π γ Π γ induces an automorphism π γ of Add ( γ , 1 ) , as follows: for f Add ( γ , 1 ) , f is a function from some ordinal α = dom ( f ) < γ to γ . Then π γ ( f ) = π γ f . It is easily seen that π γ is an automorphism of Add ( γ , 1 ) . Let R be the set of regular cardinals less than κ . Let Π = { π γ | γ R | for every γ R , π γ Π γ . Every sequence π Π induces an automorphism π of P κ as follows. Given a condition r = r i | i < κ P κ , define π ( r ) = q i | i < κ by recursion on i: if i is not a regular cardinal, then q i = r i . If i is a regular cardinal, then r i is a P i -name such that r i P i r i Add ( i , 1 ) . Inductively, let us assume that we have already defined the automorphism ( π i ) of P i . This automorphism extends to a transformation of P i names, which I also denote by ( π i ) . We then have that ( π i ) ( r i ) P i ( π i ) ( r i ) Add ( i , 1 ) . There is then a canonical P i -name τ such that ( π i ) ( r i ) P i τ = π i ˇ ( ( π i ) ( r i ) ) Add ( i , 1 ) . I define q i to be this τ .
It is now easy to see that if π , σ are distinct elements of Π , then P κ π ( G ˙ ) σ ( G ˙ ) . The point is that there are κ + many elements of Π which fix p. To see this, note that for σ R , P σ is σ -c.c. (if σ is a successor cardinal, then P σ is forcing equivalent to P σ ¯ + 1 , where σ = σ ¯ + ). It follows that there is an ordinal β σ < σ such that
( p σ ) P σ ran ( p ( σ ) ) β ˇ σ .
Let
Π p = { π Π | γ R π γ β γ = id β γ } .
It follows that if π Π p , then π ( p ) = p . Denoting equinumerosity by the symbol ∼, we have that
κ α R Π α α R 2 α < α R 2 α Π p ¯ ¯ .
Therefore, there are κ + many automorphisms of P κ fixing p and giving distinct images of G κ . However, if π Π p is such an isomorphism, then
L [ G κ ] = L [ π [ G κ ] ] φ ( π [ G κ ] , α ) ,
that is, π [ G κ ] A . However, P κ preserves cardinals, so in L [ G κ ] , this set has cardinality κ + , contradicting that it has cardinality at most κ .
Familiar arguments yield (c) now, using (6). Of course, there is nothing to prove if κ = λ , so let us assume that κ < λ . We are left to show that G κ does not belong to < κ + - HOD L [ G ] . Suppose it did. First, note that by Corollary 4
(7)
< κ + - HOD L [ G ] < κ + - HOD L [ G κ + ] .
since the forcing from L [ G κ + ] to L [ G ] is < κ + -closed and cone homogeneous. This would yield that G κ < κ + - HOD L [ G κ + ] . If κ is singular, then L [ G κ + ] = L [ G κ ] , so we would have G κ L [ G κ ] , contradicting (6). In addition, if κ is regular, then the forcing leading from L [ G κ ] to L [ G ( κ + 1 ) ] = L [ G κ + ] is Add ( κ , 1 ) , so by Theorem 11, < κ + - HOD L [ G κ + ] < κ + - HOD L [ G κ ] , leading to the same contradiction. □
Therefore, this theorem allows us to control < κ - HOD for double successors of regular cardinals, and to introduce leaps at double successors of any cardinal.

3.4. The Forcing by Kanovei and Lyubetsky

Note that we are not able to introduce a leap at ω 1 using Cohen forcing. This can be achieved by the Kanovei-Lyubetsky forcing [23]. In this subsection, I only report on their results and give an application.
Their forcing is used in L, where it is a finite support product of an OD forcing T whose conditions are a certain collection of perfect trees, ordered by inclusion. This finite support product is denoted by T < ω . It is a ccc forcing in L, and forcing with T < ω over L adds a sequence x = x i | i < ω of reals such that in L [ x ] , { x i | i < ω } is the set of T -generic reals over L.
Proposition 11.
Let x be a T < ω -generic sequence over L. Then
1.
{ x i | i < ω } is OD L [ x ] ,
2.
{ x i | i < ω } < ω 1 - HOD L [ x ] ,
3.
{ x i | i < ω } < ω 1 - HOD L [ x ] ,
4.
x < ω 1 - HOD L [ x ] ,
5.
in L [ x ] , L = HOD = < ω - HOD < ω 1 - HOD < ω 2 - HOD = V . In particular, Λ 0 L [ x ] = ω 1 .
Proof. 
Point 1 is because { x } is the set of all reals which are T -generic over L—since T is OD L , this is a definition of { x } in L [ x ] using ordinal parameters.
Point 2 follows from 1; for any i < ω , by the first point, x i is < ω 1 - OD L [ x ] , and of course, x i , being a real, is a subset of ω × ω , and hence of HOD L [ x ] .
Point 3 follows from 1 and 2.
Point 4 is because if x A , and A is OD L [ x ] , then A must be uncountable in L [ x ] . Specifically, let A = { z | φ ( z , α ) } , and let Γ be the canonical name for the generic sequence. Let p T < ω force that Γ A , i.e., that φ ( Γ , α ˇ ) holds. Then for any automorphism π L which perturbs the coordinates of conditions in T < ω that fixes the coordinates in the support of p, we have that p π ( x ) and L [ x ] = L [ π ( x ) ] φ ( Γ , α ˇ ) , so that π ( x ) A . There are 2 ω = ω 1 such automorphisms, and any two distinct automorphisms give different generics.
Point 5 follows because T < ω is weakly homogeneous and OD L , so that L HOD L [ x ] L . The other relationships follow immediately from the previous points. Note that x < ω 2 - HOD L [ x ] because x ( ω R ) L [ x ] , and this set has cardinality ω 1 < ω 2 in L [ x ] . □
This proposition shows that Proposition 4 is optimal in the case κ = ω 1 : in the model constructed, there are subsets of ω in < ω 1 - HOD that are fresh over HOD . Proposition 4 shows that there can be no fresh subset of ω 1 (or any κ with cf ( κ ) ω 1 ) over HOD in < ω 1 - HOD .
Note that if x = x i | i < ω is T < ω -generic, then L [ x ] = L ( R ) L [ x ] . If we proceed by performing the iteration described in the previous subsection, then we end up with a model in which ω 1 is a leap, as well as all cardinals of the form κ + + , for κ ω .
Corollary 6.
Assume V = L . Let x be a T < ω -generic sequence over L. Working in L [ x ] , let λ be a cardinal, and let P i | i λ , Q ˙ i | i < λ be the reverse Easton iteration whose only nontrivial stages are when i = κ is an uncountable regular cardinal, 1 l P κ P κ Q ˙ κ = Add ( κ , 1 ) . Let G be P = P λ -generic over L [ x ] . Then:
(a)
For uncountable regular κ < λ , L [ x ] [ G ( κ + 1 ) ] = < κ + + - HOD L [ x ] [ G ] , and
G ( κ ) < κ + + - HOD L [ x ] [ G ] < κ + - HOD L [ x ] [ G ] . So κ + + is a leap in L [ x ] [ G ] .
(b)
L [ x ] = < ω 2 - HOD L [ x ] [ G ] .
(c)
For any limit cardinal κ λ , G κ < κ + + - HOD L [ x ] [ G ] < κ + - HOD L [ x ] [ G ] . So κ + + is a leap in L [ x ] [ G ] .
(d)
{ x i | i < ω } < ω 1 - HOD L [ x ] [ G ] , but x < ω 1 - HOD L [ x ] [ G ] .
(e)
< ω - HOD L [ x ] [ G ] = L .
Remark 3.
Thus, in L [ x ] [ G ] , if ω 1 κ λ , and either κ is regular and κ < λ , or κ is a limit cardinal, then κ + + is a leap. All limit cardinals up to λ are also leaps, and so are ω 1 and ω 2 .
For example, if λ = ω , then in L [ x ] [ G ] , all uncountable cardinals up to and including ω are leaps, as is ω + 2 .
Proof (sketch).
To prove (a) and (c), the proofs of the corresponding statements in Theorem 12 relativize, because x is essentially a real number and hence it is < ω 2 - HOD L [ x ] [ G κ ] , for any cardinal κ , so Proposition 10 applies.
Turning to (b), the inclusion from left to right follows from the reason just given. For the converse direction, the forcing leading from L [ x ] [ G ( ω 1 + 1 ) ] to L [ x ] [ G ] is < ω 2 -closed and weakly homogeneous, and the forcing leading from L [ x ] to L [ x ] [ G ( ω 1 + 1 ) ] is Add ( ω 1 , 1 ) , so a combination of Corollary 4 and Theorem 11 shows that < ω 2 - HOD L [ x ] [ G ] < ω 2 - HOD L [ x ] L [ x ] .
For the first part of (d), we know from Proposition 11.3 that { x i | i < ω } is < ω 1 - HOD L [ x ] . The reason is that { x i | i < ω } is the set of all T -generic reals over L. Since P is countably closed, and hence does not add reals, the same definition of { x i | i < ω } works in L [ x ] [ G ] . For the second part, by now familiar arguments show that if we assume the contrary, that x < ω 1 - HOD L [ x ] [ G ] , then x < ω 1 - HOD L [ x ] by Corollary 4 since P is countably closed and weakly homogeneous in L [ x ] . However, this contradicts Proposition 11.4.
Part (e) follows because the combined forcing T < ω P ˙ is cone homogeneous; use Lemma 3 with κ = ω . □

3.5. Forcing with Homogeneous Souslin Trees

The forcings we have investigated so far were not able to introduce a leap at successors of uncountable limit cardinals. In this subsection, we will achieve this. The forcing notions in question will be Souslin trees with certain homogeneity properties. The following definition uses terminology from [24].
Definition 9.
Let κ be a regular cardinal. A streamlined (or sequential) κ-tree is a set T of functions p such that the domain of p is an ordinal less than κ and the range of p is contained in κ, closed under restrictions to ordinals, ordered by inclusion, such that for every α < κ , the α-th level of T, T ( α ) = { p T | dom ( p ) = α } has cardinality less than κ and is nonempty. If p , q T , then p q (p, q are incompatible) iff neither p q nor q p . An antichain in T is a set A T of pairwise incompatible elements. T is a κ-Souslin tree if it has no antichain of cardinality κ. It is coherent if whenever p , q T , then the set d ( p , q ) = { i dom ( p ) dom ( q ) | p ( i ) q ( i ) } is finite. It is uniformly homogeneous if whenever p , q T and dom ( p ) dom ( q ) , then the function p q = p ( q ( dom ( q ) dom ( p ) ) ) T . It is uniformly coherent if it is coherent and uniformly homogeneous.
Remark 4.
Let T be a streamlined uniformly homogeneous κ-tree. Let s , t T with dom ( s ) = dom ( t ) . Let π s , t be the following function defined on T s = { u T | s u } :
π s , t ( u ) = t u .
Then π s , t : T s T t is an isomorphism. It follows that T is cone homogeneous, as a forcing notion.
Proof. 
Clearly, π s , t : T s T t , and it is order preserving. However, also, π t , s : T t T s is order preserving, and it is the inverse function of π s , t . It follows that π s , t is an isomorphism. □
Remark 5.
If T is a κ-Souslin tree, where κ is an uncountable regular cardinal, and P is a forcing notion of cardinality less than κ, then whenever G P is P -generic over V , T remains a κ-Souslin tree in V [ G ] .
Proof. 
If not, then let f ˙ be a P -name and p G a condition forcing that f ˙ : κ ˇ T ˇ is an injective enumeration of an antichain in T. For every ξ < κ , there are a condition q ξ G and a t ˇ ξ such that q ξ p and q ξ P f ˙ ( ξ ˇ ) = t ˇ ξ . Since κ is still a regular cardinal in V [ G ] , and since the cardinality of P is less than κ , there must be a q P such that for κ many ξ < κ , q ξ = q . However, then, the set
A = { t | ξ < κ q P f ˙ ( ξ ˇ ) = t ˇ }
is an antichain in T of cardinality κ that exists in V , contradicting that T is Souslin there. □
When forcing with a tree, the nodes that are higher up in the tree are stronger. In other words, I follow the Israel convention when forcing with trees.
Theorem 13.
Let κ be a regular uncountable cardinal, and let T be a streamlined, uniformly coherent κ-Souslin tree. Let G T be T-generic over V . Then:
(1)
< κ - HOD V [ G ] V .
(2)
If T is < κ + - HOD V [ G ] , then G < κ + - HOD V [ G ] .
(3)
If κ ¯ κ is a cardinal and T is < κ ¯ - OD , then < κ ¯ - HOD V [ G ] < κ ¯ - HOD V .
Proof. 
It is well-known that T is < κ -distributive, i.e., that forcing with T does not add a new sequence of ground model elements of length less than κ . The generic filter G itself can be identified with b = G , a new such sequence of length κ , a function b : κ κ such that for all α < κ , b α T , i.e., a cofinal branch of T. Since T is Souslin, it is also κ -c.c. It follows that forcing with T preserves all cardinals and cofinalities.
To show (1), that < κ - HOD V [ G ] V , let us assume the contrary, and let a be ∈-minimal in < κ - HOD V [ G ] V . So a V , and there is an OD V [ G ] set A = { x | φ ( x , ρ ) } V [ G ] such that a A and γ = A ¯ ¯ V [ G ] < κ . Let a = a ˙ G , and let p G force all the above: that a ˙ is contained in V but not an element of V , that it belongs to A, and that A has cardinality γ . I will carry out the following construction in V [ G ] . For every q p with q G , there is a d q V and a q q such that
d q a ( q T ( d ˇ q a ˙ ) ) V .
This is because otherwise, q would decide membership to a ˙ for every element of V , and since q also forces that a ˙ V , q would force that a ˙ V . Using this, one can now define a sequence α i , q i , d i | i < κ such that α i | i < κ is a strictly increasing sequence of ordinals less than κ , q i T , q i b α i , and b α i + 1 , q i decide “ d ˇ i a ˙ ” in different ways. In the limit step, one uses the fact that κ remains regular in V [ G ] .
For i < κ , let b i = q i b = dom ( q i ) < α < κ q i b α . By uniform coherence of T, b i is a cofinal branch of T, so, since T is Souslin, G i = { b i α | α < κ } is T-generic over V . Moreover, if i < j < κ , then a ˙ G i a ˙ G j . This is because d i a ˙ G i d i a d i a ˙ G j , as q j b α i + 1 .
However, obviously, V [ G i ] = V [ G ] , since b i and b differ only on an initial segment. Hence, we have
V [ G ] = V [ G i ] φ ( a ˙ G i , ρ )
so that { a ˙ G i | i < κ } A . So A has cardinality κ in V [ G ] , a contradiction.
Towards claim (2), the crucial point is that
[ T ] V [ G ] = { b V [ G ] | b is a cofinal branch through T }
has cardinality κ in V [ G ] . First, note that if b [ T ] V [ G ] , then d ( b , b ) = { i < κ | b ( i ) b ( i ) } is finite. For suppose it were not. Let θ be the supremum of the first ω elements of d ( b , b ) . Clearly, θ cannot be less than κ , because if it were, then we would have that b θ , b θ T , so that by coherency of T, d ( b θ , b θ ) < ω , a contradiction. Therefore, then it would have to be that θ = κ , but that would mean that the cofinality of κ is collapsed to ω in V [ G ] , which contradicts that T preserves cofinalities. Thus, every b [ T ] V [ G ] can be obtained from b by modifying it in finitely many places. Clearly, there are only up to κ many ways to do this. Therefore, the cardinality of [ T ] V [ G ] is at most κ in V [ G ] . However, it is also at least κ , because for every q T , q b [ T ] V [ G ] . A by now familiar argument shows that if T is < κ + - OD V [ G ] , then b (and hence G) is < κ + - HOD V [ G ] . Specifically, if A is OD V [ G ] , has cardinality less than κ + there, and contains T, then the set
{ [ S ] | S A and S is a κ - tree with [ S ] ¯ ¯ = κ }
is OD V [ G ] , has cardinality κ , and contains b. Every element of b is a pair of ordinals less than κ , so that clearly, b < κ + - HOD V [ G ] . Hence, b < κ + - HOD V [ G ] . In addition, G = { b α | α < κ } is definable in and hence a member of the inner model < κ + - HOD V [ G ] .
Turning to item (3), let κ ¯ be as stated, and assume that T is < κ ¯ - OD . By item (1), it follows that whenever G is T-generic over V , then < κ ¯ - HOD V [ G ] V . Hence, the assumptions of Lemma 4 are satisfied, and that lemma gives the result. □
It follows from Brodsky and Rinot [24] that in L, for every regular cardinal κ that is not weakly compact, there is a streamlined, uniformly coherent κ -Souslin tree. Since the relevant reference points are somewhat scattered within [24], here are the details. [24] (Thm. 6.1.(21)) says that if V = L and κ is an uncountable regular cardinal that is not weakly compact, then the “parametric proxy principle” P ( κ , 2 , , κ , S , 2 ) holds for S = { E χ κ | χ Reg ( κ ) and κ is ( < χ ) - closed } . Here, κ is ( < χ ) -closed iff for every λ < κ , λ < χ < κ , and the principle, with a subscript called ξ , is defined in [24] (Def. 5.9). According to [24] (Convention 4.3), if the subscript is omitted, then it is understood to be κ . It is obvious from the definition that the principle becomes weaker if one shrinks S or expands any element of S ; see also [24] (Remark 4.11). Since κ trivially is ( < ω ) -closed, it follows that in L, P ( κ , 2 , , κ , { κ } , 2 ) holds, assuming that κ is an uncountable, regular cardinal that is not weakly compact in L. Now [24] (Thm. 6.35) concludes the existence of a uniformly coherent κ -Souslin tree (which has some additional properties that are not needed here) from this assumption. Hence, we obtain the following corollary.
Corollary 7.
Assume V = L , and let λ be an uncountable regular cardinal that is not weakly compact. Then there is a forcing extension L [ G ] of L such that Λ 0 L [ G ] = λ + .
Proof. 
We can let T be the < L -least streamlined, uniformly coherent λ -Souslin tree and let G be T-generic over L. By Theorem 13, L [ G ] is as wished. □
In particular:
Corollary 8.
If ZFC is consistent with the existence of an inaccessible cardinal, then it is consistent that Λ 0 is the successor of an inaccessible cardinal.
Note that Corollary 7 shows that Proposition 4 is optimal in the sense that in the model constructed, < λ + - HOD has a subset of λ that is fresh over HOD . The proposition says that it cannot have such a subset of a cardinal of cofinality greater than or equal to λ + .
It is also possible to combine forcing with a uniformly coherent Souslin tree with an iteration of Cohen forcings as in the proof of the following theorem.
Theorem 14.
If ZFC is consistent with the existence of an inaccessible cardinal, then ZFC is consistent with the existence of a regular (in fact inaccessible) limit leap whose successor cardinal is also a leap.
Proof. 
Under the assumption of the theorem, ZFC is consistent with V = L together with the existence of an inaccessible cardinal. Therefore, let us assume V = L , and let λ be inaccessible, but not weakly compact. Let T be the < L -least streamlined uniformly coherent Souslin tree on λ , and let b be a T-generic branch over L. We know from Theorem 13 that in L [ b ] , b is one of altogether λ many cofinal branches of T.
In L [ b ] , let P be an iteration of Cohen forcings Add ( ρ , 1 ) , for regular ρ < λ , as described in Lemma 12.
In the terminology of [7] (Def. 12), the forcing P has a closure point at every regular cardinal δ < λ , because P factors as P δ + 1 Q ˙ , where P δ + 1 ¯ ¯ = δ and P δ + 1 Q ˙ is strategically δ -closed. As a result, by [7] (Lemma 13), letting G be P -generic over L [ b ] , it follows that L [ b ] satisfies the δ + -approximation and -cover properties in L [ b ] [ G ] . In particular, by the argument of the proof of Proposition 4, L [ b ] [ G ] has no fresh sequence of length λ over L [ b ] . This means that P cannot add a cofinal branch to T over L [ b ] , so that in L [ b ] [ G ] , b is still one of λ many branches through T. However, by the special way T was chosen, it is OD L [ b ] [ G ] . It follows that:
(A)
b < λ + - HOD L [ b ] [ G ] .
Since T adds no bounded subsets to λ , the iteration P of length λ is the same as defined in L or in L [ b ] (the point is that bounded support is used in forming P λ ), and L [ b ] [ G ] = L [ G ] [ b ] .
Imitating the argument of the proof of Theorem 12, let us check that
(B)
for every regular cardinal κ < λ ,
L [ G ( κ + 1 ) ] = < κ + + - HOD L [ b ] [ G ] .
First, we have
(1)
L [ G ( κ + 1 ) ] = < κ + + - HOD L [ b ] [ G ( κ + 1 ) ] .
The inclusion from left to right holds because G ( κ + 1 ) is (coded by) a subset X of κ , and arguing in L [ b ] [ G ( κ + 1 ) ] , X belongs to the OD set P ( κ ) , which has cardinality less than κ + + .
For the converse, we can change the order of forcing and write
< κ + + - HOD L [ b ] [ G ( κ + 1 ) ] = < κ + + - HOD L [ G ( κ + 1 ) ] [ b ] .
Note that by Remark 5, T is still a λ -Souslin in L [ G ( κ + 1 ) ] , and it obviously also is uniformly coherent there. Moreover, T is ordinal definable in L [ G ( κ + 1 ) ] . Hence, Theorem 13 applies, showing that
< κ + + - HOD L [ G ( κ + 1 ) ] [ b ] < κ + + - HOD L [ G ( κ + 1 ) ] = L [ G ( κ + 1 ) ] .
This shows the inclusion from right to left.
The same argument shows that
(2)
L [ G ( κ + 1 ) ] < κ + + - HOD L [ b ] [ G ] .
Therefore, we must prove the reverse inclusion. We have κ + < λ , since λ is inaccessible.
The next nontrivial stage of forcing is κ + . From the point of view of L [ b ] [ G ( κ + 1 ) ] , L [ b ] [ G ( κ + + 1 ) ] is obtained by forcing with Add ( κ + , 1 ) . Applying Theorem 11 in L [ b ] [ G ( κ + 1 ) ] yields:
(3)
< κ + + - HOD L [ b ] [ G ( κ + + 1 ) ] < κ + + - HOD L [ b ] [ G ( κ + 1 ) ] .
Furthermore, we have κ + + < λ , so the passage from L [ b ] [ G ( κ + + 1 ) ] to L [ G ] , which we again call P tail , has as its next nontrivial stage κ + + , and the forcing used is < κ + + -closed, as well as cone homogeneous, as we argued before. Hence, Corollary 4 can be applied in L [ G ( κ + + 1 ) ] , showing that
(4)
< κ + + - HOD L [ b ] [ G ] < κ + + - HOD L [ b ] [ G ( κ + + 1 ) ] .
Together with (3), this shows that
(5)
< κ + + - HOD L [ b ] [ G ] < κ + + - HOD L [ b ] [ G ( κ + 1 ) ] .
However, again,
< κ + + - HOD L [ b ] [ G ( κ + 1 ) ] = < κ + + - HOD L [ G ( κ + 1 ) ] [ b ] L [ G ( κ + 1 ) ] .
It follows that < κ + + - HOD L [ b ] [ G ] L [ G ( κ + 1 ) ] , by (5). This proves (B).
Clearly, ( B ) shows that λ is a limit leap. Let us now say something about < λ - HOD L [ b ] [ G ] :
(C)
< λ - HOD L [ b ] [ G ] L [ G ] .
To see this, let us think of L [ b ] [ G ] as L [ G ] [ b ] instead, obtained by forcing with T over L [ G ] . At first sight, it may seem as though the claim follows immediately from Theorem 13(1), but it is not clear that T is a Souslin tree in L [ G ] - P λ is not small forcing regarding λ ! However, fortunately, the proof of the theorem still goes through—all it uses is that forcing with T preserves λ as a regular cardinal, that the maps π s , t of Remark 4 are isomorphisms, and that T is uniform. There is a small subtlety in the proof: we argued that (using the notation from the proof) q i b is T-generic because it is a cofinal branch of T, and every cofinal branch in a Souslin tree is generic. Since T may not be Souslin in L [ G ] , one cannot argue that way now, but it is sufficient to know that, letting s = b dom ( q i ) , and letting b i = π s , q i [ { b ξ | ξ < λ } ] , we have that π s , q i is an isomorphism between T s and T q i , so that b i is generic for T. With these modifications, the proof goes through to prove the current claim.
Therefore, by (B) and (C), b < λ + - HOD L [ b ] [ G ] < λ - HOD L [ b ] [ G ] , showing that λ + is a leap in L [ b ] [ G ] , and λ is a limit leap, as wished. □

3.6. Příkrý Forcing

In the previous subsections, we saw how to produce models where Λ 0 = κ + , for a regular limit cardinal κ , or where such a κ is a limit leap whose successor cardinal is also a leap. We will now see how this can be arranged for a singular limit cardinal. Recall Lemma 2. (2), which showed that Λ 0 must be a successor cardinal.
To this end, I will use Příkrý forcing [25]: given a measurable cardinal κ and a normal ultrafilter U on κ , the forcing notion consists of pairs s , T , where s is a finite subset of κ , T U , and s min ( T ) . The ordering is defined by declaring that s 1 , T 1 s 0 , T 0 iff T 1 T 0 , s 0 s 1 and s 1 s 0 T 0 . In this situation, s 1 , T 1 is called a direct extension of s 0 , T 0 , denoted s 1 , T 1 s 0 , T 0 , if s 1 = s 0 . It is well-known that forcing with this poset adds a set C (called a Příkrý sequence), cofinal in κ , of order type ω , and interdefinable with the generic filter (using U as a parameter).
Theorem 15.
Let κ be a measurable cardinal, let U be a normal ultrafilter on κ, let P be the Příkrý forcing for U, and let G be P -generic over V . Then
(a)
< κ - HOD V [ G ] V .
(b)
If U is < κ + - OD V [ G ] , then, letting C be the Příkrý sequence corresponding to G, C < κ + - HOD V [ G ] .
(c)
If κ ¯ κ is a cardinal and U is < κ ¯ - OD , then < κ ¯ - HOD V [ G ] < κ ¯ - HOD V .
Proof. 
Let C be the Příkrý sequence corresponding to G, i.e.,
C = { s | T s , T G } .
It is well-known that V [ G ] = V [ C ] . I will soon need the fact, due to Mathias [26], that a subset D of κ with order type ω is the Příkrý sequence corresponding to some P -generic H iff for every B U , D B is finite. I will also need a maximality fact, a proof of which can be found in [27] (but in a much broader context), saying that if D is the Příkrý sequence corresponding to some H which is P -generic over V , and this H is in V [ C ] (equivalently, D V [ C ] ), then D C is finite.
Let G = G V [ C ] be the collection of Příkrý sequences D (again viewed as subsets of κ of order type ω ) such that V [ C ] = V [ D ] .
(1)
G = { D κ | D C is finite } .
Proof. of (1).
For the inclusion from right to left, if D C is finite, then obviously, for any X U , D X is finite, as C X is finite, and otp ( D ) = ω . Thus, by Mathias’ criterion for Příkrý genericity, D is a Příkrý sequence over V . Moreover, V [ C ] = V [ D ] .
For the other direction, suppose D G . Since D is a Příkrý sequence over V and D V [ C ] , it follows by the maximality of C that D C is finite. However, since C V [ D ] , it follows by the maximality of D that C D is finite. Thus, C D is finite. □
To prove (a), I must show that < κ - HOD V [ C ] V .
Assume the contrary, and let a < κ - HOD V [ C ] V be ∈-minimal. So a V . Let A be an OD V [ C ] set such that a A and A ¯ ¯ V [ C ] = κ ¯ < κ . Let A = { x | φ ( x , α ) } V [ C ] , for some ordinal α . Let a = a ˙ G , and let p G be a condition which forces over V that a ˙ is contained in V , but not an element of V , and that φ ( a ˙ , α ˇ ) holds. Let us also assume that p forces that a ˙ is a subset of V θ , for some sufficiently large ordinal θ , and moreover, that fixing a well-order R of V θ , the order type of a ˙ under that well-order is the ordinal Ω . Let us write, for any subset b of V θ , b ( ξ ) for the ξ -th element of b in its enumeration according to R.
I will use the following notation: if D is a Příkrý sequence, then G D denotes the P -generic filter, i.e., the set of all conditions of the form s , T such that s is an initial segment of D and D s T . I will also use the following fact.
(2)
For every condition q P , there is a D G such that q G D .
Proof. of (2).
Let q = s , T . Since C is a Příkrý sequence, e = C T is finite. Let α = sup ( { ξ + 1 | ξ s } ) . Then set D = s ( C ( e α ) ) . Since C α is finite, it follows that D C is finite, so that D G , by (1). In addition, since s is an initial segment of D and D s T , it follows that s , T G D , as wished. □
One more basic fact on Příkrý forcing will prove useful.
(3)
Let t ˙ be a P -name, let q P be a condition, and let Z be a set of size less than κ such that q t ˙ Z ˇ . Then there is a (unique) z Z such that for some direct extension q of q, q t ˙ = z ˇ .
Proof. of (3).
For each z Z , consider the statement φ z = t ˙ = z ˇ ”. By the Příkrý property, for each such z, there is a direct extension q z q deciding φ z . Since all these conditions have the same first coordinate, and there are fewer than κ of them, they have a common extension, q q z for all z Z . It follows that there is a z Z such that q z t ˙ = z ˇ , or else q would force that t ˙ Z ˇ , a contradiction. In addition, this z is unique, or else, q would both force that t ˙ = z ˇ and t ˙ = z ˇ , for distinct z , z Z . □
(4)
If q p is a condition in P and ξ < Ω , then the collection
P q = { z | r q r a ˙ ( ξ ˇ ) = z ˇ }
can have no more than κ ¯ members.
Proof. of (4).
Assume the contrary. For notational simplicity, let us assume q = p , for if not, then we may work with a different Příkrý sequence C instead of C whose generic contains q.
Let P i | i < κ ¯ + be a partition of P q , each P i nonempty. Let A be a maximal antichain below q such that for every r A , there is an i < κ ¯ + with r a ˙ ( ξ ˇ ) P ˇ i . Let D = { s | r A s r } be the dense open subset below q that is generated by A.
Now, for every i < κ ¯ + , there is an r i A forcing that a ˙ ( ξ ˇ ) P i . By (2), there is a D i G such that r i G D i .
However, then, for i < j < κ ¯ + , we have that a ˙ G D i a ˙ G D j . However, each G D i contains the condition p, so φ ( a ˙ G D i , α ) holds in V [ G D i ] = V [ C ] . However, the set { z | V [ C ] φ ( z , α ) } has size κ ¯ in V [ C ] , and ( κ ¯ + ) V is still a cardinal in V [ C ] , since P preserves cardinals. This is a contradiction. □
In V , we will now recursively construct sequences p i | i κ ¯ + , q i + 1 | i < κ ¯ + and ξ i + 1 | i < κ ¯ + with the following properties:
  • for i < j κ ¯ + , p j p i and q i + 1 p i .
  • for i < κ ¯ + , q i + 1 and p i + 1 decide the value of a ˙ ( ξ ˇ i + 1 ) in different ways.
We begin by setting p 0 = p . If j κ ¯ + is a limit ordinal and p i | i < j , q i + 1 | i < j and ξ i + 1 | i < j have been defined already, then let p j be the limit of the sequence p i | i < j (i.e., if p i = s , T i for i < j , then p j = s , i < j T i ). Now suppose p i | i j , q i | i j , i a successor and ξ i | i j , i a successor have been defined. Since p j p , there must be a ξ j + 1 < Ω such that p j does not decide the value of a ˙ ( ξ ˇ j + 1 ) (or else p j would force that a ˙ V ). Since there are no more than κ ¯ many possible values, there is a direct extension p j + 1 of p j that decides it. Now let q j + 1 p j be some condition that decides a ˙ ( ξ ˇ j + 1 ) in a different way. This finishes the construction.
Now, for every successor ordinal i < κ ¯ + , let D i be a Příkrý sequence such that D i C is finite, and such that, letting G D i be the generic filter corresponding to D i , q i G D i . Then for i < j , both successor ordinals, a ˙ G D i a ˙ G D j , because q i decides a ˙ ( ξ ˇ i ) in a way that is different from the way p i decides it, but since q j p j 1 p i , q j decides a ˙ ( ξ ˇ i ) the same way as p i . Thus, a ˙ G D i ( ξ i ) a ˙ G D j ( ξ i ) .
However, for each successor ordinal i < κ ¯ + , V [ D i ] = V [ C ] , and since p G D i , V [ C ] φ ( a ˙ G D i , α ) , while there are only κ ¯ many b such that V [ C ] φ ( b , α ) . This is a contradiction.
To prove (b), assume that U is < κ + - HOD V [ G ] . I must show that C < κ + - HOD V [ G ] . Let A be OD V [ G ] , of cardinality at most κ in V [ G ] , such that U A . Recall that G was defined in V [ C ] to be the collection of all Příkrý sequences D over V with respect to U such that V [ C ] = V [ D ] . Formalizing this definition of G would require us to talk about V , which may or not be definable is a simple enough way. Instead, working in V [ C ] , let me define a set D to be a maximal Příkrý sequence (with respect to U) if:
(i)
D κ , and otp ( D ) = ω .
(ii)
For every B U , D B is finite.
(iii)
Call a set E satisfying (i) and (ii) a Příkrý sequence (with respect to U). Then for every Příkrý sequence E (with respect to U), E D is finite.
It then follows that G is the set of all maximal Příkrý sequences (with respect to U). To see this, for the inclusion from left to right, assume that D G . It then clearly satisfies (i) and (ii). In addition, since V [ D ] = V [ C ] and D is maximal in V [ D ] , it follows that D is also a maximal Příkrý sequence with respect to U. Vice versa, suppose that D satisfies (i)–(iii). D is then Příkrý-generic over V . To see that V [ D ] = V [ C ] , it suffices to show that C V [ D ] . However, C is also a Příkrý sequence with respect to U, so by (iii), C D is finite. On the other hand, D V [ C ] , and C is maximal in V [ C ] , so D C is finite. Hence, C V [ D ] , so that V [ C ] = V [ D ] , as claimed.
For every W A , we may now define
G W = { D κ | D is a maximal P říkrý sequence with respect to W } .
Note that the definition of G W only uses W (and κ ) as a parameter, and that G U = G . Therefore, by (1), G U has cardinality κ . Thus, by adding this requirement to the definition of A if necessary, we may assume that for every W A , the cardinality of G W is κ . We then have that C W A G W , and this latter set is OD V [ G ] and has cardinality κ , making C < κ + - HOD V [ G ] , as claimed.
Finally, let me turn to (c). To be able to apply Lemma 4, note that P is cone homogeneous: given two conditions p = s 0 , T 0 and q = s 1 , T 1 , let T = T 0 T 1 , p = s 0 , T and q = s 1 , T . Then p p , q q and P p is isomorphic to P q via the function that maps s , W P p to ( s s 0 ) s 1 , W . It is routine to check that this is an isomorphism between the cones. Lemma 4 now proves the lemma.
Here is an application in a concrete scenario, producing a model whose least leap is the successor of a singular cardinal.
Theorem 16.
Assume V = L [ U ] , where U is a normal ultrafilter on κ. Let P be the Příkrý forcing for U, and let G be P -generic over V . Then
L [ U ] = HOD L [ U ] [ G ] = < κ - HOD L [ U ] [ G ] < κ + - HOD L [ U ] [ G ] = L [ U ] [ G ] .
In particular, Λ 0 = κ + is the successor of a limit cardinal of countable cofinality in L [ U ] [ G ] .
Proof. 
In L [ U ] [ G ] , L [ U ] is definable (it is the core model), and U is the unique normal measure on κ in L [ U ] , so U is definable in L [ U ] [ G ] . Thus, the assumptions of Theorem 15(b) and (c) are satisfied, yielding that < κ - HOD L [ U ] [ G ] < κ - HOD L [ U ] and letting C be the Příkrý sequence corresponding to G, C < κ + - HOD L [ U ] [ G ] . However, L [ U ] = HOD L [ U ] HOD L [ U ] [ G ] , since L [ U ] is definable in L [ U ] [ G ] ; see Proposition 9. Therefore, we have that L [ U ] = HOD L [ U ] [ G ] = < κ - HOD L [ U ] [ G ] . The rest follows because C < κ + - HOD L [ U ] [ G ] , as this implies that L [ U ] [ G ] = L [ U ] [ C ] < κ + - HOD L [ U ] [ G ] L [ U ] [ G ] . □
Finally, here is another simple application, paralleling Theorem 14 and producing a model with a singular limit leap whose successor cardinal is also a leap.
Theorem 17.
If ZFC is consistent with a measurable cardinal, then ZFC is also consistent with the existence of a singular limit leap of countable cofinality, whose cardinal successor is a leap.
Proof. 
Working in a model of ZFC with a measurable cardinal, we can form the canonical inner model L [ U ] and work there, so let us assume that V = L [ U ] . Let κ be the measurable cardinal (so U is the unique normal ultrafilter on κ ). Let P U be the Příkrý forcing with respect to U, and let C be a Příkrý sequence with respect to U.
In V [ C ] , let P be the reverse Easton iteration employing Add ( γ , 1 ) at stage γ when γ < κ is an uncountable regular cardinal, and using trivial forcing at all other stages.
(1)
C < κ + - HOD V [ C ] [ G ] < κ - HOD V [ C ] [ G ] .
To see that C < κ + - HOD V [ C ] [ G ] , recall that C is one of κ many maximal Příkrý sequences with respect to U in V [ C ] , by Theorem 15. The forcing P is < ω 1 -closed in V [ C ] , so does not add any countable sequences of ordinals, and preserves cardinals. Moreover, U is still definable in V [ C ] [ G ] . Hence, C is still < κ + - HOD V [ C ] [ G ] , using the same definition.
To see that C does not belong to < κ - HOD V [ C ] [ G ] , suppose towards a contradiction that it did. Let A = { x | φ ( x , α ) } V [ C ] [ G ] be OD V [ C ] [ G ] with C A and A ¯ ¯ V [ C ] [ G ] < κ . Arguing in V [ C ] , since P is weakly homogeneous in V [ C ] , we know that for every x, either P φ ( x ˇ , α ˇ ) or P ¬ φ ( x ˇ , α ˇ ) . Therefore, define, still in V [ C ] :
A ˜ = { x | P φ ( x ˇ , α ˇ ) } .
Then A ˜ = A V [ C ] A , and in particular, C A ˜ . We have that
A ˜ ¯ ¯ V [ C ] = A ˜ ¯ ¯ V [ C ] [ G ] A ¯ ¯ V [ C ] [ G ] < κ .
Moreover, since P is OD V [ C ] , A ˜ is OD V [ C ] . Taken together, this shows that C < κ - HOD V [ C ] . However, this contradicts Theorem 15(a), which says that < κ - HOD V [ C ] V .
(2)
Let γ < κ be regular and uncountable. Then
G ( γ ) < γ + + - HOD V [ C ] [ G ] < γ + - HOD V [ C ] [ G ] .
Viewing G ( γ ) as a subset of γ as usual, it follows that it belongs to P ( γ ) V [ C ] [ G ] , an OD V [ C ] [ G ] set of cardinality less than γ + + in V [ C ] [ G ] , showing that G ( γ ) < γ + + - HOD V [ C ] [ G ] .
To see that G ( γ ) does not belong to < γ + - HOD V [ C ] [ G ] , assume it did. As before, it would follow that G ( γ ) < γ + - HOD V [ C ] [ G ( γ + 1 ) ] by Corollary 4, and further, by Theorem 11, that G ( γ ) < γ + - HOD V [ C ] [ G γ ] , which is absurd. This proves (2).
Now, in V [ C ] [ G ] , κ has countable cofinality, and by (2), κ is a limit of leaps, and by (1), κ + is a leap, as wished. □

4. Questions and Directions for Future Research

Blurry definability is a new topic, and as such, there are many directions future research could take.
Some research has been undertaken and some deep results have been obtained on < ω 1 - HOD , the “hereditarily nontypical” sets, by Kanovei and Lyubetsky. Some of their techniques might be usable at other stages of the blurry definability hierarchy. An intriguing set of results concerns the status of the axiom of choice in < ω 1 - HOD . Specifically, in [6] (Lemma 10.2), they show that in the forcing extension by their forcing P < ω , outlined in Section 3.4, < ω 1 - HOD does not satisfy the axiom of choice. On the other hand, they provide in [5] a different construction of a model in which < ω 1 - HOD is situated strictly between HOD and V , but this time it does satisfy AC . It would be interesting to see whether one can control the structure of leaps, while also controlling whether or not < κ - HOD satisfies the axiom of choice. Of course, there is the limitation that at a limit leap κ , < κ - HOD cannot satisfy AC . Given the nature of the forcing notions used by Kanovei and Lyubetsky, this would probably entail analyzing forcing notions whose conditions are perfect trees on some uncountable regular cardinal κ , as was done in [28], for example, and it might involve techniques from the area of generalized Baire spaces.
Another topic of interest is the status of gaps between leaps. I did not verify that successors of limit cardinals below the length of the iteration to produce the model of Theorem 12 are not leaps there, but I suspect that an argument such as the one establishing part (c) of the theorem, together with the techniques employed in the proof of Theorem 11 would show that - this is something that should be checked. Taking this further, one could try to construct models where as many consecutive cardinals as possible are leaps. One naive approach to constructing a model where this is true up to ω + 2 would be to use the method of Theorem 17 but use iterated collapse forcings (as in [29], for example) between the elements of the Příkrý sequence to arrange that the formerly measurable cardinal becomes ω . Analyzing the effect of collapse forcing itself on blurry definability would be an interesting first step.
Relating to the use of Cohen forcing to produce leaps, the reason Add ( κ , 1 ) introduced a leap at κ + + was that GCH held in the models under consideration. Therefore, it would be interesting to have failures of GCH , say at κ , but still have κ + + , or even κ + be a leap.
Another question concerns the use of large cardinals to produce models in which the successor cardinal of a limit leap is a leap: are large cardinals necessary for this? Can the presence of a core model be used, via covering, to rule out the occurrence of such a situation?
Furthermore, it seems as though the features of Příkrý forcing used to prove the salient facts around blurry definability in its forcing extensions, Theorem 15, are shared by Magidor forcing; see [30]. Therefore, it would seem promising to attempt to use it to produce a model with a singular limit leap of higher cofinality, whose cardinal successor is a leap.
Additionally, it seems that it should be possible to iterate adding Cohen sets past a measurable cardinal and much more, preserving measurability, using lifting techniques, and therefore producing models with many singular limit leaps whose successor cardinals are leaps. I do not foresee any problems in performing a length On iteration, to produce models with a proper class of leaps, etc.
Finally, and this may be a leap, but let me close with the question whether it is consistent that every uncountable cardinal is a leap.

Funding

This research was funded by the Simons Foundation under grant number 580600.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Kanovei, V.; Lyubetsky, V. On the ‘Definability of Definable’ Problem of Alfred Tarski. Mathematics 2020, 8, 2214. [Google Scholar] [CrossRef]
  2. Hamkins, J.D.; Leahy, C. Algebraicity and implicit definability in set theory. Notre Dame J. Form. Log. 2016, 57, 431–439. [Google Scholar] [CrossRef] [Green Version]
  3. Tzouvaras, A. Typicality à la Russell. Available online: https://www.researchgate.net/publication/351358980 (accessed on 29 December 2021).
  4. Jech, T. Set Theory: The Third Millenium Edition, Revised and Expanded; Springer: Berlin/Heidelberg, Germany, 2003. [Google Scholar]
  5. Kanovei, V.; Lyubetsky, V. A generic model in which the Russell-nontypical sets satisfy ZFC strictly between HOD and the universe. arXiv 2021, arXiv:2111.13491. [Google Scholar]
  6. Kanovei, V.; Lyubetsky, V. On Russell typicality in Set Theory. arXiv 2021, arXiv:2111.07654. [Google Scholar]
  7. Hamkins, J.D. Extensions with the approximation and cover properties have no new large cardinals. Fundam. Math. 2003, 180, 257–277. [Google Scholar] [CrossRef] [Green Version]
  8. Hamkins, J.D. Gap forcing. Isr. J. Math. 2001, 125, 237–252. [Google Scholar] [CrossRef]
  9. Bukovský, L. Characterization of generic extensions of models of set theory. Fundam. Math. 1973, 83, 35–46. [Google Scholar] [CrossRef]
  10. Laver, R. Certain very large cardinals are not created in small forcing extensions. Ann. Pure Appl. Log. 2007, 149, 1–6. [Google Scholar] [CrossRef] [Green Version]
  11. McAloon, K. On the sequence of models HODn. Fundam. Math. 1974, 82, 85–93. [Google Scholar] [CrossRef] [Green Version]
  12. Reitz, J. The Ground Axiom. J. Symb. Log. 2007, 72, 1299–1317. [Google Scholar] [CrossRef]
  13. Gitik, M. All uncountable cardinals can be singular. Isr. J. Math. 1980, 35, 61–88. [Google Scholar] [CrossRef]
  14. Cheng, Y.; Friedman, S.D.; Hamkins, J.D. Large cardinals need not be large in HOD. Ann. Pure Appl. Log. 2015, 166, 1186–1198. [Google Scholar] [CrossRef]
  15. Woodin, H. The 19th Midrasha Mathematicae Lectures. Bull. Symb. Log. 2017, 23, 1–109. [Google Scholar] [CrossRef] [Green Version]
  16. Goldberg, G. Strongly compact cardinals and ordinal definability. arXiv 2021, arXiv:2107.00513. [Google Scholar]
  17. Woodin, W.H. The continuum hypothesis, the generic-multiverse of sets, and the Ω conjecture. In Set Theory, Arithmetic, and Foundations of Mathematics: Theorems, Philosophies; Kennedy, J., Kossak, R., Eds.; Lecture Notes in Logic; Cambridge University Press: Cambridge, UK, 2011; pp. 13–42. [Google Scholar] [CrossRef] [Green Version]
  18. Dobrinen, N.; Friedman, S.D. Homogeneous Iteration and Measure One Covering Relative to HOD. Arch. Math. Log. 2008, 47, 711–718. [Google Scholar] [CrossRef]
  19. Enayat, A.; Kanovei, V.; Lyubetsky, V. On effectively indiscernible projective sets and the Leibniz-Mycielski Axiom. Mathematics 2020, 9, 1670. [Google Scholar] [CrossRef]
  20. Fuchs, G.; Gitman, V.; Hamkins, J.D. Ehrenfeucht’s lemma in set theory. Notre Dame J. Form. Log. 2018, 59, 355–370. [Google Scholar] [CrossRef] [Green Version]
  21. Apter, A.W.; Friedman, S.; Fuchs, G. More on HOD-supercompactness. Ann. Pure Appl. Log. 2021, 172, 102901. [Google Scholar] [CrossRef]
  22. Kunen, K. Set Theory. An Introduction to Independence Proofs; North Holland Publishing Co.: Amsterdam, The Netherlands, 1980. [Google Scholar]
  23. Kanovei, V.G.; Lyubetsky, V.A. A countable definable set containing no definable elements. Math. Notes 2017, 102, 338–349. [Google Scholar] [CrossRef] [Green Version]
  24. Brodsky, A.M.; Rinot, A. A microscopic approach to Souslin-tree construction, Part II. Ann. Pure Appl. Log. 2021, 172, 102904. [Google Scholar] [CrossRef]
  25. Příkrý, K. Changing measurable into accessible cardinals. Diss. Math. 1970, 68, 5–52. [Google Scholar]
  26. Mathias, A.R.D. On sequences generic in the sense of Prikry. J. Aust. Math. Soc. 1973, 15, 409–414. [Google Scholar] [CrossRef] [Green Version]
  27. Fuchs, G. A characterization of generalized Příkrý sequences. Arch. Math. Log. 2005, 44, 935–971. [Google Scholar] [CrossRef]
  28. Friedman, S.D.; Thompson, K. Perfect trees and elementary embeddings. J. Symb. Log. 2008, 73, 906–918. [Google Scholar] [CrossRef]
  29. Fuchs, G. Combined maximality principles up to large cardinals. J. Symb. Log. 2009, 74, 1015–1046. [Google Scholar] [CrossRef] [Green Version]
  30. Fuchs, G. On sequences generic in the sense of Magidor. J. Symb. Log. 2014, 79, 1286–1314. [Google Scholar] [CrossRef] [Green Version]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Fuchs, G. Blurry Definability. Mathematics 2022, 10, 452. https://doi.org/10.3390/math10030452

AMA Style

Fuchs G. Blurry Definability. Mathematics. 2022; 10(3):452. https://doi.org/10.3390/math10030452

Chicago/Turabian Style

Fuchs, Gunter. 2022. "Blurry Definability" Mathematics 10, no. 3: 452. https://doi.org/10.3390/math10030452

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