SearcharxivSearch

arXiv · 1812.03837

New Large Cardinal Axioms and the Ultimate-L Program

Abstract

We will consider a number of new large-cardinal properties, the $α$-tremendous cardinals for each limit ordinal $α>0$, the hyper-tremendous cardinals, the $α$-enormous cardinals for each limit ordinal $α>0$, and the hyper-enormous cardinals. For limit ordinals $α>0$, the $α$-tremendous cardinals and hyper-tremendous cardinals have consistency strength between I3 and I2. An $ω$-enormous cardinal has consistency strength greater than I0, and also all the large-cardinal axioms discussed in the second part of Hugh Woodin's paper on suitable extender models, not known to be inconsistent with ZFC and of greater consistency strength than I0. Ralf Schindler and Victoria Gitman have developed the notion of a virtual large-cardinal property, and a clear sense can be given to the notion of "virtually $ω$-enormous". A virtually $ω$-enormous cardinal can be shown to dominate a Ramsey cardinal. It can be shown that a cardinal $κ$ which is a critical point of an elementary embedding $j:V_{λ+2} \prec V_{λ+2}$, in a context not assuming choice, is necessarily a hyper-enormous cardinal. Building on this insight, we can obtain the result that the existence of such an elementary embedding is in fact outright inconsistent with ZF. The assertion that there is a proper class of $α$-enormous cardinals for every limit ordinal $α>0$ can be shown to imply a version of the Ultimate-L Conjecture.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rupert McCallum. 2021-03-09. New Large Cardinal Axioms and the Ultimate-L Program. https://doi.org/10.13140/rg.2.2.29864.42245

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