Search arXivSearch

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

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO