Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2007.04812

Some combinatorial properties of Ultimate L and V

Gabriel Goldberg
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper establishes a number of constraints on the structure of large cardinals under strong compactness assumptions. These constraints coincide with those imposed by the Ultrapower Axiom, a principle that is expected to hold in Woodin's hypothesized Ultimate \(L\), providing some evidence for the Ultimate \(L\) Conjecture. We show that every regular cardinal above the first strongly compact that carries an indecomposable ultrafilter is measurable, answering a question of Silver for large enough cardinals. We show that any successor almost strongly compact cardinal of uncountable cofinality is strongly compact, making progress on a question of Boney, Unger, and Brooke-Taylor. We show that if there is a proper class of strongly compact cardinals then there is no nontrivial cardinal preserving elementary embedding from the universe of sets into an inner model, answering a question of Caicedo granting large cardinals. Finally, we show that if \(\kappa\) is strongly compact, then \(V\) is a set forcing extension of the inner model \(\kappa\text{-HOD}\) consisting of sets that are hereditarily ordinal definable from a \(\kappa\)-complete ultrafilter over an ordinal; \(\kappa\text{-HOD}\) seems to be the first nontrivial example of a ground of \(V\) whose definition does not involve forcing.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Gabriel Goldberg. 2020-07-09. Some combinatorial properties of Ultimate L and V. https://arxiv.org/abs/2007.04812

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗