SearcharxivSearch

arXiv · 2309.03821

The vanishing levels of a tree

Abstract

We initiate the study of the spectrum $Vspec(\kappa)$ of sets that can be realized as the vanishing levels $V(T)$ of a normal $\kappa$-tree $T$. The latter is an invariant in the sense that if $T$ and $T'$ are club-isomorphic, then the symmetric difference of $V(T)$ and $V(T')$ is nonstationary. Additional features of this invariant imply that $Vspec(\kappa)$ is closed under finite unions and intersections. The set $V(T)$ must be stationary for an homogeneous normal $\kappa$-Aronszajn tree $T$, and if there exists a special $\kappa$-Aronszajn tree, then there exists one $T$ that is homogeneous and satisfies $V(T)=\kappa$ (modulo clubs). It is consistent (from large cardinals) that there is an $\aleph_2$-Souslin tree, and yet $V(T)$ is co-stationary for every $\aleph_2$-tree $\mathbf T$. Both $V(T)=\emptyset$ and $V(T)=\kappa$ (modulo clubs) are shown to be feasible using $\kappa$-Souslin trees even at some large cardinal close to a weakly compact. It is also possible to have a family of $2^\kappa$ many $\kappa$-Souslin trees for which the corresponding family of vanishing levels forms an antichain modulo clubs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Assaf Rinot, Shira Yadai, Zhixing You. 2023-09-07. The vanishing levels of a tree. https://arxiv.org/abs/2309.03821

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