SearcharxivSearch

arXiv · 2206.11954

The Strong and Super Tree Property at Successors of Singular Cardinals

Abstract

The strong tree property and ITP (also called the super tree property) are generalizations of the tree property that characterize strong compactness and supercompactness up to inaccessibility. That is, an inaccessible cardinal $\kappa$ is strongly compact if and only if the strong tree property holds at $\kappa$, and supercompact if and only if ITP holds at $\kappa$. We present several results motivated by the problem of obtaining the strong tree property and ITP at many successive cardinals simultaneously; these results focus on the successors of singular cardinals. We describe a general class of forcings that will obtain the strong tree property and ITP at the successor of a singular cardinal of any cofinality. Generalizing a result of Neeman about the tree property, we show that it is consistent for ITP to hold at $\aleph_n$ for all $2 \leq n < \omega$ simultaneously with the strong tree property at $\aleph_{\omega+1}$; we also show that it is consistent for ITP to hold at $\aleph_n$ for all $3 < n < \omega$ and at $\aleph_{\omega+1}$ simultaneously. Finally, turning our attention to singular cardinals of uncountable cofinality, we show that it is consistent for the strong and super tree properties to hold at successors of singulars of multiple cofinalities simultaneously.

Explore related subjects

Keep this discovery

BibTeXRIS

William Adkisson. 2022-06-23. The Strong and Super Tree Property at Successors of Singular Cardinals. https://arxiv.org/abs/2206.11954

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