Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2307.06881

Kat\v{e}tov order between Hindman, Ramsey, van der Waerden and summable ideals

Rafał Filipów·Krzysztof Kowitz·Adam Kwela
View original source ↗Read source document ↗Export metadata ↓

Abstract

A family I of subsets of a set X is an ideal on X if it is closed under taking subsets and finite unions of its elements. An ideal I on X is below an ideal J on Y in the Katetov order if there is a function $f:Y\to X$ such that $f^{-1}[A]\in J$ for every $A\in I$. We show that the Hindman ideal, the Ramsey ideal and the summable ideal are pairwise incomparable in the Katetov order, where * the Ramsey ideal consists of those sets of pairs of natural numbers which do not contain a set of all pairs of any infinite set (equivalently do not contain, in a sense, any infinite complete subgraph), * the Hindman ideal consists of those sets of natural numbers which do not contain any infinite set together with all finite sums of its members (equivalently do not contain IP-sets that are considered in Ergodic Ramsey theory), * the summable ideal consists of those sets of natural numbers such that the series of the reciprocals of its members is convergent. Moreover, we show that in the Katetov order the above mentioned ideals are not below the van der Waerden ideal that consists of those sets of natural numbers which do not contain arithmetic progressions of arbitrary finite length.

Explore related subjects

math.LOmath.CO

Keep this discovery

BibTeXRIS

Rafał Filipów, Krzysztof Kowitz, Adam Kwela. 2023-07-13. Kat\v{e}tov order between Hindman, Ramsey, van der Waerden and summable ideals. https://arxiv.org/abs/2307.06881

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗