SearcharxivSearch

arXiv · 2506.11607

Eccentricity, extendable choice and descending distributive forcing

Abstract

We introduce the forcing property of descending distributivity. A forcing $\mathbb{P}$ is $\kappa$-descending distributive if for all decreasing sequences $(D_\alpha)_{\alpha<\kappa}$ of open dense sets, $\bigcap_\alpha D_\alpha$ is open dense. This generalises the informal idea that $\mathbb{P}$ doesn't affect much on the scale of $\kappa$, such as if $\mathbb{P}$ is $\kappa$-distributive or if $\kappa > \lvert \mathbb{P} \rvert$. For example, a $\kappa$-descending distributive forcing will not change the cofinality of $\kappa$ or introduce fresh functions on $\kappa$. Using this, we investigate the phenomenon of eccentric sets, those sets $X$ such that, for some ordinal $\alpha$, $X$ surjects onto $\alpha$, but $\alpha$ 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 $\alpha$, $\mathsf{EC}_\alpha$ asserts that if $\emptyset \notin A = \{A_\gamma \mid \gamma < \alpha\}$ and, for all $\beta < \alpha$, $\{ A_\gamma \mid \gamma < \beta\}$ 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 $\alpha$ for which $\mathsf{EC}_\alpha$ 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

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