SearcharxivSearch

arXiv · 2203.04186

The Special Tree Number

Abstract

Define the special tree number, denoted $\mathfrak{st}$, to be the least size of a tree of height $\omega_1$ which is neither special nor has a cofinal branch. This cardinal had previously been studied in the context of fragments of $\mathsf{MA}$ but in this paper we look at its relation to other, more typical, cardinal characteristics. Classical facts imply that $\aleph_1 \leq \mathfrak{st} \leq 2^{\aleph_0}$, under Martin's Axiom $\mathfrak{st} = 2^{\aleph_0}$ and that $\mathfrak{st} = \aleph_1$ is consistent with $\mathsf{MA}({\rm Knaster}) + 2^{\aleph_0} = \kappa$ for any regular $\kappa$ thus the value of $\mathfrak{st}$ is not decided by $\mathsf{ZFC}$ and in fact can be strictly below essentially all well studied cardinal characteristics. We show that conversely it is consistent that $\mathfrak{st} = 2^{\aleph_0} = \kappa$ for any $\kappa$ of uncountable cofinality while ${\rm non}(\mathcal M) = \mathfrak{a} = \mathfrak{s} = \mathfrak{g} = \aleph_1$. In particular $\mathfrak{st}$ is independent of the lefthand side of Cicho\'{n}'s diagram, amongst other things. The proof involves an in depth study of the standard ccc forcing notion to specialize (wide) Aronszajn trees, which may be of independent interest.

Explore related subjects

Keep this discovery

BibTeXRIS

Corey Bacal Switzer. 2022-03-08. The Special Tree Number. https://arxiv.org/abs/2203.04186

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