Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.03572

Extendible cardinals, and Laver-generic large cardinal axioms for extendibility

Sakaé Fuchino
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce (super-$C^{(\infty)}$-)Laver-generic large cardinal axioms for extendibility ((super-$C^{(\infty)}$-)LgLCAs for extendible, for short), and show that most of the previously known consequences of the (super-$C^{(\infty)}$-)LgLCAs for ultrahuge, in particular, general forms of Resurrection Principles, Maximality Principles, and Absoluteness Theorems, already follow from (super-$C^{(\infty)}$\mbox{-)}LgLCAs for extendible. The consistency of LgLCAs for extendible (for transfinitely iterable $Σ_2$-definable classes of posets) follows from an extendible cardinal while the consistency of super-$C^{(\infty)}$-LgLCAs for extendible follows from a model with a strongly super-$C^{(\infty)}$-extendible cardinal. If $μ$ is an almost-huge cardinal, there are cofinally many $κ<μ$ such that\ $V_μ\models$``$κ$ is strongly super-$C^{(\infty)}$ extendible''. Most of the known reflection properties follow already from some of the LgLCAs for supercompact. We give a survey on the related results. We also show the separation between some of the LgLCAs as well as between LgLCAs and their consequences. LgLCAs are generic large cardinal axioms in terms of generic elementary embeddings with the critical point $κ_{\mathfrak{refl}}=\max\{\aleph_2,2^{\aleph_0}\}$. We show that Laver generic large cardinal axioms for all posets\ in terms of generic elementary embeddings with the critical point $2^{\aleph_0}$ is also possible. We abbreviate this type of axiom for the notion of extendibility as the LgLCAA for extendible and examine its consequences.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sakaé Fuchino. 2025-06-24. Extendible cardinals, and Laver-generic large cardinal axioms for extendibility. https://arxiv.org/abs/2506.03572

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

KEEP EXPLORING

Related papers

arXiv2026

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

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

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↗