SearcharxivSearch

arXiv · 2607.12099

Reductions and necessary conditions for tall Borel Ramsey ideals

Abstract

An ideal $\mathcal{I}$ on $\omega$ has the Ramsey property if $\mathcal{I}^{+}\to(\mathcal{I}^{+})^2_2$: every $2$-colouring of the pairs of an $\mathcal{I}$-positive set has an $\mathcal{I}$-positive homogeneous subset. Whether a tall Borel ideal can have the Ramsey property is an open question of Hru\v{s}\'ak, Meza-Alc\'antara, Th\"ummel and Uzc\'ategui; a coanalytic example exists in ZFC, so a negative answer must use definability essentially. Our main theorem, a synthesis of the results of the paper, states that a tall Borel Ramsey ideal admits no countable local reading. Below every positive set, such an ideal is not a countable intersection of topologically represented (or tall analytic $P$-) ideals, and its quotient has no countable dense subset. Moreover, every quotient name for a new real has uncountable width, the colouring witnessing non-selectivity of the generic ultrafilter is never read continuously on a positive condition, and hereditary tall subfamilies saturate every finite window of barrier dimensions coherently but never all dimensions at once. We prove separately that a weakly selective $q^+$ ideal admits no positive $\mathcal{ED}_{\mathrm{fin}}$-carrier. The converse question -- must Borelness force a properness-like countable reading on some positive condition? -- is stated in three precise forms with proved consequences: two of them would refute tall Borel Ramsey ideals outright, the third the strictly weaker Nash--Williams class. The main question remains open.

Explore related subjects

Keep this discovery

BibTeXRIS

José de Jesús Pelayo Gómez. 2026-07-13. Reductions and necessary conditions for tall Borel Ramsey ideals. https://arxiv.org/abs/2607.12099

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