SearcharxivSearch

arXiv · 2411.03558

On the optimality of the HOD dichotomy

Abstract

In the first part of the manuscript, we establish several consistency results concerning Woodin's $\HOD$ hypothesis and large cardinals around the level of extendibility. First, we prove that the first extendible cardinal can be the first strongly compact in HOD. We extend a former result of Woodin by showing that under the HOD hypothesis the first extendible cardinal is $C^{(1)}$-supercompact in HOD. We also show that the first cardinal-correct extendible may not be extendible, thus answering a question by Gitman and Osinski \cite[\S9]{GitOsi}. In the second part of the manuscript, we discuss the extent to which weak covering can fail below the first supercompact cardinal $\delta$ in a context where the HOD hypothesis holds. Answering a question of Cummings et al. \cite{CumFriGol}, we show that under the $\HOD$ hypothesis there are many singulars $\kappa<\delta$ where $\cf^{\HOD}(\kappa)=\cf(\kappa)$ and $\kappa^{+\HOD}=\kappa^{+}.$ In contrast, we also show that the $\HOD$ hypothesis is consistent with $\delta$ carrying a club of $\HOD$-regulars cardinals $\kappa$ such that $\kappa^{+\HOD}<\kappa^{+}$. Finally, we close the manuscript with a discussion about the $\HOD$ hypothesis and $\omega$-strong measurability.

Explore related subjects

Keep this discovery

BibTeXRIS

Gabriel Goldberg, Jonathan Osinski, Alejandro Poveda. 2024-11-05. On the optimality of the HOD dichotomy. https://arxiv.org/abs/2411.03558

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