SearcharxivSearch

arXiv · 2208.02684

Indestructibility of some compactness principles over models of PFA

Abstract

We show that $\mathsf{PFA}$ (Proper Forcing Axiom) implies that adding any number of Cohen subsets of $\omega$ will not add an $\omega_2$-Aronszajn tree or a weak $\omega_1$-Kurepa tree, and moreover no $\sigma$-centered forcing can add a weak $\omega_1$-Kurepa tree (a tree of height and size $\omega_1$ with at least $\omega_2$ cofinal branches). This partially answers an open problem whether ccc forcings can add $\omega_2$-Aronszajn or $\omega_1$-Kurepa trees. We actually prove more: We show that a consequence of $\mathsf{PFA}$, namely the guessing model principle, $\mathsf{GMP}$, which is equivalent to the ineffable slender tree property, $\mathsf{ISP}$, is preserved by adding any number of Cohen subsets of $\omega$. And moreover, $\mathsf{GMP}$ implies that no $\sigma$-centered forcing can add a weak $\omega_1$-Kurepa tree. For more generality, we study the principle $\mathsf{GMP}$ at an arbitrary regular cardinal $\kappa = \kappa^{<\kappa}$ (we denote this principle $\mathsf{GMP}_{\kappa^{++}}$), and as an application we show that there is a model in which there are no weak $\aleph_{\omega+1}$-Kurepa trees and no $\aleph_{\omega+2}$-Aronszajn trees.

Explore related subjects

Keep this discovery

BibTeXRIS

Radek Honzik, Chris Lambie-Hanson, Šárka Stejskalová. 2022-08-04. Indestructibility of some compactness principles over models of PFA. https://arxiv.org/abs/2208.02684

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