SearcharxivSearch

arXiv · 2607.22196

Ramsey-Theoretic Finiteness in Choiceless Set Theory: The Gower's Collapse and Rainbow and Canonical Separations

Abstract

We study finiteness classes arising from Ramsey-theoretic principles in set theory without the Axiom of Choice. First, we answer a question of Brot, Cao, and Fern\'andez-Bret\'on concerning Gowers' $\mathbf{FIN}_k$ theorem. The $\mathbf{FIN}_k$ operation gives rise to a finiteness notion for each $k\geq 1$, but we show that this notion is independent of the value of $k$: the resulting hierarchy collapses, and every level is equivalent to $H$-finiteness, i.e., to Dedekind-finiteness of $[X]^{<\omega}$. We then turn to the Rainbow Ramsey theorem and the Canonical Ramsey theorem. The corresponding failure classes $\operatorname{\mathbf{RRT-Fin}_n^m}$ and $\operatorname{\mathbf{CRT-Fin}}$ are genuine finiteness classes contained in $\operatorname{\mathbf{D-Fin}}$. We prove several inclusions placing them relative to standard Ramsey-theoretic finiteness classes of Brot--Cao--Fern\'andez-Bret\'on, prove their independence from the collapsed Hindman--Gowers class, and analyze the parameter dependence of the rainbow classes through Fraenkel--Mostowski examples. The finer questions of strictness, and the full two-parameter structure of the rainbow classes, are left open where the present arguments do not settle them.

Explore related subjects

Keep this discovery

BibTeXRIS

Brinda Venkataramani. 2026-07-24. Ramsey-Theoretic Finiteness in Choiceless Set Theory: The Gower's Collapse and Rainbow and Canonical Separations. https://arxiv.org/abs/2607.22196

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