Papers
Topics
Authors
Recent
Search
2000 character limit reached

HOD1: Inner Model via Existential Second-Order Definability

Updated 9 July 2026
  • HOD1 is an inner model defined via existential second-order formulas, serving as a variant to classical HOD in set theory.
  • It compares ordinary HOD with a model generated by extended definability, illustrating independence phenomena under supercompact assumptions.
  • Forcing and coding strategies demonstrate that the equation HOD = HOD1 remains undecidable in ZFC augmented with large cardinal axioms.

Searching arXiv for papers specifically about HOD1 as the inner model C(Σ11)C(\Sigma^1_1). HOD1\mathrm{HOD}_1 is an inner model of set theory defined by

HOD1=C(Σ11),\mathrm{HOD}_1 = C(\Sigma^1_1),

where Σ11\Sigma^1_1 is the existential fragment of second-order logic, consisting of formulas of the form

R1Rnφ,\exists R_1\ldots \exists R_n\,\varphi,

with φ\varphi first-order. In the C(L)C(\mathcal L)-framework, HOD1\mathrm{HOD}_1 is obtained by replacing ordinary first-order definability in a constructibility-style hierarchy with existential second-order definability. It is therefore a definability-based variant of HOD rather than the usual class of hereditarily ordinal-definable sets. The central current result is that the statement HOD=HOD1\mathrm{HOD}=\mathrm{HOD}_1 is independent of ZFC plus “There is a supercompact cardinal” (Magidor et al., 25 Aug 2025).

1. Definition and logical setting

The paper "New inner models from second order logics" defines HOD1\mathrm{HOD}_1 by

HOD1\mathrm{HOD}_10

with

HOD1\mathrm{HOD}_11

This places HOD1\mathrm{HOD}_12 inside the general HOD1\mathrm{HOD}_13-construction, where one forms an inner model by closing stages under definability in an extended logic HOD1\mathrm{HOD}_14 rather than only under first-order definability (Magidor et al., 25 Aug 2025).

In this setup, HOD1\mathrm{HOD}_15 is not introduced as an ad hoc modification of HOD, but as one instance of a broader program studying inner models arising from stronger logical resources. The logic HOD1\mathrm{HOD}_16 is stronger than ordinary first-order logic, yet much weaker than unrestricted second-order logic. This makes HOD1\mathrm{HOD}_17 a natural nearby variant of HOD from the standpoint of definability theory.

The paper does not supply a further equivalent formulation beyond this syntactic one. The relevant formal content is precisely that HOD1\mathrm{HOD}_18 is the HOD1\mathrm{HOD}_19-model associated with existential second-order formulas (Magidor et al., 25 Aug 2025).

2. Relation to ordinary HOD

The usual HOD1=C(Σ11),\mathrm{HOD}_1 = C(\Sigma^1_1),0 is the class of hereditarily ordinal-definable sets, defined using ordinary first-order formulas with ordinal parameters. By contrast, HOD1=C(Σ11),\mathrm{HOD}_1 = C(\Sigma^1_1),1 is built from existential second-order definability. The two constructions are therefore adjacent in motivation but distinct in mechanism (Magidor et al., 25 Aug 2025).

The paper is explicit that HOD1=C(Σ11),\mathrm{HOD}_1 = C(\Sigma^1_1),2 is a variant of HOD rather than HOD itself. It also notes that HOD1=C(Σ11),\mathrm{HOD}_1 = C(\Sigma^1_1),3 “extends e.g. HOD1=C(Σ11),\mathrm{HOD}_1 = C(\Sigma^1_1),4,” although no structural theorem about that extension is developed there (Magidor et al., 25 Aug 2025). What is developed in detail is the comparison problem

HOD1=C(Σ11),\mathrm{HOD}_1 = C(\Sigma^1_1),5

A crucial point is that the paper does not prove any absolute inclusion such as

HOD1=C(Σ11),\mathrm{HOD}_1 = C(\Sigma^1_1),6

in ZFC. Instead, it proves that equality itself is undecidable over a strong large-cardinal background. This shifts the comparison from a straightforward inclusion question to a relative-consistency problem (Magidor et al., 25 Aug 2025).

This suggests that replacing first-order definability by existential second-order definability does not have a uniform effect on the resulting inner model across all universes of set theory. The comparison is sensitive to forcing and coding constructions rather than being fixed by the formal strength of the logic alone.

3. Independence of HOD1=C(Σ11),\mathrm{HOD}_1 = C(\Sigma^1_1),7

The central theorem proved in Section 3 of "New inner models from second order logics" is: HOD1=C(Σ11),\mathrm{HOD}_1 = C(\Sigma^1_1),8 More precisely, assuming the consistency of ZFC with a supercompact cardinal, both

HOD1=C(Σ11),\mathrm{HOD}_1 = C(\Sigma^1_1),9

and

Σ11\Sigma^1_10

are consistent with that theory (Magidor et al., 25 Aug 2025).

This refines an earlier result cited in the paper, namely that Σ11\Sigma^1_11 is already independent of ZFC. The new contribution is that adjoining large cardinal axioms of this strength does not resolve the question (Magidor et al., 25 Aug 2025).

The significance is methodological as much as structural. Large cardinals often settle or calibrate the consistency strength of canonical statements about inner models, but here even the presence of a supercompact cardinal does not determine whether existential second-order definability collapses back to ordinary HOD. That establishes Σ11\Sigma^1_12 as a genuinely nontrivial variation in the landscape of definability-based inner models.

4. Model where Σ11\Sigma^1_13

For the positive consistency direction, the proof uses Menas’s model of Σ11\Sigma^1_14 with a supercompact cardinal. The paper states that in this model every set is coded by the class of ordinals Σ11\Sigma^1_15 such that

Σ11\Sigma^1_16

and that this coding pattern can be captured by Σ11\Sigma^1_17 (Magidor et al., 25 Aug 2025).

The argument is then straightforward in outline. Since every set is recoverable from an ordinal coding pattern visible to Σ11\Sigma^1_18, one obtains

Σ11\Sigma^1_19

Because the same model also satisfies R1Rnφ,\exists R_1\ldots \exists R_n\,\varphi,0, it follows that

R1Rnφ,\exists R_1\ldots \exists R_n\,\varphi,1

there (Magidor et al., 25 Aug 2025).

The role of the coding

R1Rnφ,\exists R_1\ldots \exists R_n\,\varphi,2

is central. The proof does not rely on a direct structural collapse of existential second-order definability to first-order ordinal definability; rather, it exploits a universe in which every set has already been encoded into a sufficiently transparent ordinal pattern. This suggests that equality between HOD and R1Rnφ,\exists R_1\ldots \exists R_n\,\varphi,3 can be forced by making all sets uniformly recoverable from coding visible to the richer definability apparatus.

5. Model where R1Rnφ,\exists R_1\ldots \exists R_n\,\varphi,4

The negative consistency direction is more elaborate. Starting from a universe with

R1Rnφ,\exists R_1\ldots \exists R_n\,\varphi,5

and a supercompact cardinal R1Rnφ,\exists R_1\ldots \exists R_n\,\varphi,6, the proof constructs a model R1Rnφ,\exists R_1\ldots \exists R_n\,\varphi,7 in which a real R1Rnφ,\exists R_1\ldots \exists R_n\,\varphi,8 satisfies

R1Rnφ,\exists R_1\ldots \exists R_n\,\varphi,9

Hence

φ\varphi0

in that model (Magidor et al., 25 Aug 2025).

The construction uses a sequence φ\varphi1 of the first weakly compact cardinals above φ\varphi2, with

φ\varphi3

It first “marks” the φ\varphi4 by violating GCH exactly at each φ\varphi5, while preserving weak compactness of each φ\varphi6 and introducing no new weakly compact cardinals. Then, over the resulting universe, it performs a reverse Easton iteration adding Cohen subsets at inaccessible cardinals below φ\varphi7. Finally, for those φ\varphi8, it destroys weak compactness of φ\varphi9 by adding a C(L)C(\mathcal L)0-Souslin tree C(L)C(\mathcal L)1 (Magidor et al., 25 Aug 2025).

The crucial technical claim is

C(L)C(\mathcal L)2

To prove this, the paper compares C(L)C(\mathcal L)3-truth across four forcing-related models. For every C(L)C(\mathcal L)4-formula C(L)C(\mathcal L)5 and C(L)C(\mathcal L)6, the following are equivalent: C(L)C(\mathcal L)7 The forward implications use upward persistence of existential second-order truth under forcing extensions, while the converse direction uses homogeneity of the forcing from C(L)C(\mathcal L)8 to C(L)C(\mathcal L)9 (Magidor et al., 25 Aug 2025).

Because HOD1\mathrm{HOD}_10 remains unchanged through the critical step, the real HOD1\mathrm{HOD}_11 is not seen by HOD1\mathrm{HOD}_12. Ordinary HOD, however, can detect both which ordinals are the marked HOD1\mathrm{HOD}_13 and which of them have lost weak compactness. Thus HOD1\mathrm{HOD}_14 becomes ordinal-definable in HOD1\mathrm{HOD}_15, yielding

HOD1\mathrm{HOD}_16

(Magidor et al., 25 Aug 2025).

6. Conceptual significance

The paper treats HOD1\mathrm{HOD}_17 as a nearby but nontrivial perturbation of HOD. The question

HOD1\mathrm{HOD}_18

therefore tests how robust hereditary ordinal definability is under a modest strengthening of the underlying logic from first-order to existential second-order definability (Magidor et al., 25 Aug 2025).

The independence theorem shows that even strong large cardinal assumptions do not settle whether this strengthening changes the resulting inner model. In one direction, coding can force complete agreement. In the other, carefully arranged forcing extensions allow ordinary ordinal definability to recover information that remains invisible to the HOD1\mathrm{HOD}_19-construction (Magidor et al., 25 Aug 2025).

A plausible implication is that the decisive issue is not merely the formal expressive power of HOD=HOD1\mathrm{HOD}=\mathrm{HOD}_10, but the interaction between that expressive power and the ambient coding architecture of the universe. In particular, homogeneity and persistence of HOD=HOD1\mathrm{HOD}=\mathrm{HOD}_11-truth can prevent HOD=HOD1\mathrm{HOD}=\mathrm{HOD}_12 from seeing distinctions that HOD can recover through ordinally definable global patterns.

The paper does not establish substantive comparisons between HOD=HOD1\mathrm{HOD}=\mathrm{HOD}_13 and the other inner models studied there, such as HOD=HOD1\mathrm{HOD}=\mathrm{HOD}_14, HOD=HOD1\mathrm{HOD}=\mathrm{HOD}_15, or HOD=HOD1\mathrm{HOD}=\mathrm{HOD}_16. Its treatment of HOD=HOD1\mathrm{HOD}=\mathrm{HOD}_17 is separate and focused almost entirely on the comparison with ordinary HOD (Magidor et al., 25 Aug 2025).

7. Position within the study of inner models from extended logics

Within the broader HOD=HOD1\mathrm{HOD}=\mathrm{HOD}_18-program, HOD=HOD1\mathrm{HOD}=\mathrm{HOD}_19 occupies a natural intermediate position: stronger than purely first-order definability, but still governed by a sharply delimited logical fragment. The paper’s Section 3 does not develop a fine structure for HOD1\mathrm{HOD}_10, nor does it derive large-cardinal content internal to HOD1\mathrm{HOD}_11. Its sole substantive theorem about the model is the undecidability of equality with HOD under a supercompact cardinal assumption (Magidor et al., 25 Aug 2025).

That narrow focus is itself informative. It indicates that HOD1\mathrm{HOD}_12 is being used as a test case for a general phenomenon: changing the logic in a constructibility-style hierarchy can produce inner models whose relationship to classical definability-based models is not settled by ZFC, and not even by strong large cardinal hypotheses.

In that sense, HOD1\mathrm{HOD}_13 functions as an especially clear example of the sensitivity of inner-model formation to the choice of definability notion. The paper’s final conclusion is accordingly not that HOD1\mathrm{HOD}_14 has a fixed structural relation to HOD, but that the equation

HOD1\mathrm{HOD}_15

remains open to forcing variation even in universes with supercompact cardinals (Magidor et al., 25 Aug 2025).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to HOD1.