SearcharxivSearch

arXiv · 2209.01395

The proper forcing axiom for $\aleph_1$-sized posets, $\omega_1$-linked symmetrically proper forcing, and the size of the continuum

Abstract

We show that the Proper Forcing Axiom for forcing notions of size $\aleph_1$ is consistent with the continuum being arbitrarily large. In fact, assuming $GCH$ holds and $\kappa\geq\omega_2$ is a regular cardinal, we prove that there is a proper and $\aleph_2$-c.c.\ forcing giving rise to a model of this forcing axiom together with $2^{\aleph_0}=\kappa$ and which, in addition, satisfies all statements of the form $\mathcal{H}(\aleph_2)\models \exists y\varphi(a, y)$, where $a\in \mathcal{H}(\aleph_2)$ and $\varphi(x, y)$ is a $\Sigma_0$ formula with the property that for every ground model $M$ of $CH$ with $a\in M$ there is, in $M$, a suitably nice poset -- specifically, a poset $\mathbb{Q}\subseteq\mathcal{H}(\kappa)^M$ which is $\omega_1$-linked and symmetrically proper -- adding some $b$ such that $\varphi(a, b)$. In particular, $\mathbb{P}$ forces Moore's Measuring principle, Baumgartner's Axiom for $\aleph_1$-dense sets of reals, Todor\v{c}evi\'{c}'s Open Colouring Axiom for sets of size $\aleph_1$, the Abraham-Rubin-Shelah Open Colouring Axiom, and Todor\v{c}evi\'{c}'s P-ideal Dichotomy for $\aleph_1$-generated ideals on $\omega_1$, among other statements. Hence, all these statements are simultaneously compatible with a large continuum. Finally, we show that a further small variation of our construction yields a model satisfying, in addition to all the earlier conclusions, Martin's Maximum for posets of size $\aleph_1$.

Explore related subjects

Keep this discovery

BibTeXRIS

David Asperó, Mohammad Golshani. 2022-09-03. The proper forcing axiom for $\aleph_1$-sized posets, $\omega_1$-linked symmetrically proper forcing, and the size of the continuum. https://arxiv.org/abs/2209.01395

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