SearcharxivSearch

arXiv · 1404.2111

Absoluteness via Resurrection

Abstract

The resurrection axioms are forcing axioms introduced recently by Hamkins and Johnstone, developing on ideas of Chalons and Velickovi\'c. We introduce a stronger form of resurrection axioms (the \emph{iterated} resurrection axioms $\textrm{RA}_\alpha(\Gamma)$ for a class of forcings $\Gamma$ and a given ordinal $\alpha$), and show that $\textrm{RA}_\omega(\Gamma)$ implies generic absoluteness for the first-order theory of $H_{\gamma^+}$ with respect to forcings in $\Gamma$ preserving the axiom, where $\gamma=\gamma_\Gamma$ is a cardinal which depends on $\Gamma$ ($\gamma_\Gamma=\omega_1$ if $\Gamma$ is any among the classes of countably closed, proper, semiproper, stationary set preserving forcings). We also prove that the consistency strength of these axioms is below that of a Mahlo cardinal for most forcing classes, and below that of a stationary limit of supercompact cardinals for the class of stationary set preserving posets. Moreover we outline that simultaneous generic absoluteness for $H_{\gamma_0^+}$ with respect to $\Gamma_0$ and for $H_{\gamma_1^+}$ with respect to $\Gamma_1$ with $\gamma_0=\gamma_{\Gamma_0}\neq\gamma_{\Gamma_1}=\gamma_1$ is in principle possible, and we present several natural models of the Morse Kelley set theory where this phenomenon occurs (even for all $H_\gamma$ simultaneously). Finally, we compare the iterated resurrection axioms (and the generic absoluteness results we can draw from them) with a variety of other forcing axioms, and also with the generic absoluteness results by Woodin and the second author.

Explore related subjects

Keep this discovery

BibTeXRIS

Giorgio Audrito, Matteo Viale. 2014-04-08. Absoluteness via Resurrection. https://arxiv.org/abs/1404.2111

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