SearcharxivSearch

arXiv · 2405.13775

On algebraic sums, trees and ideals in the Cantor space

Abstract

We work in the Cantor space $2^\omega$. The results of the paper adhere the following pattern. Let $\mathcal{I}\in \{\mathcal{M}, \mathcal{N}, \mathcal{M}\cap \mathcal{N}, \mathcal{E}\}$ and $T$ be a perfect, uniformly perfect or Silver tree. Then for every $A\in \mathcal{I}$ there exists $T'\subseteq T$ of the same kind as $T$ such that $A+\underbrace{[T']+[T']+\dots +[T']}_{\text{n--times}}\in \mathcal{I}$ for each $n\in\omega$. We also prove weaker statements for splitting trees. For the case $\mathcal{E}$ we also provide a simple characterization of basis of $\mathcal{E}$. We use these results to prove that the algebraic sum of a generalized Luzin set and a generalized Sierpi\'nski set belongs to $u_0$ and $v_0$, provided that $\mathfrak{c}$ is a regular cardinal.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marcin Michalski, Robert Rałowski, Szymon Żeberski. 2024-05-22. On algebraic sums, trees and ideals in the Cantor space. https://arxiv.org/abs/2405.13775

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