SearcharxivSearch

arXiv · 2511.09764

From Internal to External: Classical Models of ZF + PP + $\neg$AC

Abstract

Goal. We analyze when the Partition Principle ($\mathsf{PP}$) holds without $\mathsf{AC}$ in models arising from a free finite $H$-action on Cantor space, and reconcile two standard routes to such models. Approach. Route I proceeds via a Boolean-valued presentation $\mathrm{Sh}(\mathbb{B})$ and symmetric names; Route II uses direct forcing with $\mathrm{Fn}(\mathbb{N}\times H,2)$ and finite-support automorphisms. We prove a unification theorem identifying the resulting symmetric submodels and develop a Local-to-Global Embedding Principle (LEP) for hereditarily symmetric names. Results. We prove external $\mathsf{PP}$ in the symmetric model $N$ built via Route II. From LEP we obtain that $\mathsf{PP}$ holds in the symmetric model, hence $N\models \mathsf{ZF}+\mathsf{PP}+\neg\mathsf{AC}$. Along the way, we unify the Route I/Route II presentations functorially. Limitations. Our proof exploits the countable-support stratification of $\mathrm{Fn}(\mathbb{N}\times H,2)$; extending the LEP/gluing to uncountable presentations (e.g. $\mathrm{Fn}(\kappa\times H,2)$ for $\kappa>\omega$) or, more generally, to $\kappa$-directed families of finite supports remains open.

Explore related subjects

Keep this discovery

BibTeXRIS

Frank Gilson. 2025-11-12. From Internal to External: Classical Models of ZF + PP + $\neg$AC. https://arxiv.org/abs/2511.09764

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