Search arXivSearch

arXiv · 2506.11607

Eccentricity, extendable choice and descending distributive forcing

Abstract

We introduce the forcing property of descending distributivity. A forcing $\mathbb{P}$ is $κ$-descending distributive if for all decreasing sequences $(D_α)_{α<κ}$ of open dense sets, $\bigcap_αD_α$ is open dense. This generalises the informal idea that $\mathbb{P}$ doesn't affect much on the scale of $κ$, such as if $\mathbb{P}$ is $κ$-distributive or if $κ> \lvert \mathbb{P} \rvert$. For example, a $κ$-descending distributive forcing will not change the cofinality of $κ$ or introduce fresh functions on $κ$. Using this, we investigate the phenomenon of eccentric sets, those sets $X$ such that, for some ordinal $α$, $X$ surjects onto $α$, but $α$ does not inject into $X$. We refine prior works of the author by giving explicit calculations for the Hartogs and Lindenbaum numbers in eccentric constructions and providing a sharper description of the Hartogs-Lindenbaum spectra of models of small violations of choice. To do so we further develop an axiom (scheme) introduced by Levy that we call the axiom of extendable choice. For an ordinal $α$, $\mathsf{EC}_α$ asserts that if $\emptyset \notin A = \{A_γ\mid γ< α\}$ and, for all $β< α$, $\{ A_γ\mid γ< β\}$ has a choice function, then $A$ has a choice function. This is closely tied to the presence of eccentric sets, and we construct symmetric extensions that give fine control over the $α$ for which $\mathsf{EC}_α$ holds by using descending distributivity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Calliope Ryan-Smith. 2025-06-13. Eccentricity, extendable choice and descending distributive forcing. https://arxiv.org/abs/2506.11607

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