SearcharxivSearch

arXiv · 2411.11568

Large cardinals, structural reflection, and the HOD Conjecture

Abstract

We introduce exacting cardinals and a strengthening of these, ultraexacting cardinals. These are natural large cardinals defined equivalently as weak forms of rank-Berkeley cardinals, strong forms of J\'onsson cardinals, or in terms of principles of structural reflection. However, they challenge commonly held intuition on strong axioms of infinity. We prove that ultraexacting cardinals are consistent with Zermelo-Fraenkel Set Theory with the Axiom of Choice (ZFC) relative to the existence of an I0 embedding. However, the existence of an ultraexacting cardinal below a measurable cardinal implies the consistency of ZFC with a proper class of I0 embeddings, thus challenging the linear--incremental picture of the large cardinal hierarchy. We show that the existence of an exacting cardinal implies that V is not equal to HOD (G\"odel's universe of Hereditarily Ordinal Definable sets), showing that these cardinals surpass the current hierarchy of large cardinals consistent with ZFC. Moreover, we prove that the existence of an exacting cardinal above an extendible cardinal implies the "V is far from HOD" alternative of Woodin's HOD Dichotomy. In particular, it follows that the consistency of ZFC with an exacting cardinal above an extendible cardinal would refute Woodin's HOD Conjecture and Ultimate-L Conjecture. Finally, we show that the consistency of ZF with certain large cardinals beyond choice implies the consistency of ZFC with the existence of an exacting cardinal above an extendible cardinal.

Explore related subjects

Keep this discovery

BibTeXRIS

Juan P. Aguilera, Joan Bagaria, Philipp Lücke. 2024-11-18. Large cardinals, structural reflection, and the HOD Conjecture. https://arxiv.org/abs/2411.11568

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO