SearcharxivSearch

arXiv · 2110.03648

Distributivity and Minimality in Perfect Tree Forcings for Singular Cardinals

Abstract

Dobrinen, Hathaway and Prikry studied a forcing $\mathbb{P}_\kappa$ consisting of perfect trees of height $\lambda$ and width $\kappa$ where $\kappa$ is a singular $\omega$-strong limit of cofinality $\lambda$. They showed that if $\kappa$ is singular of countable cofinality, then $\mathbb{P}_\kappa$ is minimal for $\omega$-sequences assuming that $\kappa$ is a supremum of a sequence of measurable cardinals. We obtain this result without the measurability assumption. Prikry proved that $\mathbb{P}_\kappa$ is $(\omega,\nu)$-distributive for all $\nu<\kappa$ given a singular $\omega$-strong limit cardinal $\kappa$ of countable cofinality, and Dobrinen et al$.$ asked whether this result generalizes if $\kappa$ has uncountable cofinality. We answer their question in the negative by showing that $\mathbb{P}_\kappa$ is not $(\lambda,2)$-distributive if $\kappa$ is a $\lambda$-strong limit of uncountable cofinality $\lambda$ and we obtain the same result for a range of similar forcings, including one that Dobrinen et al$.$ consider that consists of pre-perfect trees. We also show that $\mathbb{P}_\kappa$ in particular is not $(\omega,\cdot,\lambda^+)$-distributive under these assumptions. While developing these ideas, we address natural questions regarding minimality and collapses of cardinals.

Explore related subjects

Keep this discovery

BibTeXRIS

Maxwell Levine, Heike Mildenberger. 2021-10-07. Distributivity and Minimality in Perfect Tree Forcings for Singular Cardinals. https://arxiv.org/abs/2110.03648

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