SearcharxivSearch

arXiv · 2304.07623

Towards a generic absoluteness theorem for Chang models

Abstract

Let $\Gamma^\infty$ be the set of all universally Baire sets of reals. Inspired by recent work of the second author and Nam Trang, we introduce a new technique for establishing generic absoluteness results for models containing $\Gamma^\infty$. Our main technical tool is an iteration that realizes $\Gamma^\infty$ as the sets of reals in a derived model of some iterate of $V$. We show, from a supercompact cardinal $\kappa$ and a proper class of Woodin cardinals, that whenever $g \subseteq Col(\omega, 2^{2^\kappa})$ is $V$-generic and $h$ is $V[g]$-generic for some poset $\mathbb{P}\in V[g]$, there is an elementary embedding $j: V\rightarrow M$ such that $j(\kappa)=\omega_1^{V[g*h]}$ and $L(\Gamma^\infty, \mathbb{R})$ as computed in $V[g*h]$ is a derived model of $M$ at $j(\kappa)$. As a corollary we obtain that $\mathsf{Sealing}$ holds in $V[g]$, which was previously demonstrated by Woodin using the stationary tower forcing. Also, using a theorem of Woodin, we conclude that the derived model of $V$ at $\kappa$ satisfies $\mathsf{AD}_{\mathbb{R}}+``\Theta$ is a regular cardinal". Inspired by core model induction, we introduce the definable powerset $\mathcal{A}^\infty$ of $\Gamma^\infty$ and use our derived model representation mentioned above to show that the theory of $L(\mathcal{A}^\infty)$ cannot be changed by forcing. Working in a different direction, we also show that the theory of $L(\Gamma^\infty, \mathbb{R})[\mathcal{C}]$, where $\mathcal{C}$ is the club filter on $\wp_{\omega_1}(\Gamma^\infty)$, cannot be changed by forcing. Proving the two aforementioned results is the first step towards showing that the theory of $L(Ord^\omega, \Gamma^\infty, \mathbb{R})([\mu_\alpha: \alpha\in Ord])$, where $\mu_\alpha$ is the club filter on $\wp_{\omega_1}(\alpha)$, cannot be changed by forcing.

Explore related subjects

Keep this discovery

BibTeXRIS

Sandra Müller, Grigor Sargsyan. 2023-04-15. Towards a generic absoluteness theorem for Chang models. https://arxiv.org/abs/2304.07623

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