SearcharxivSearch

arXiv · 2410.15384

Generic Absoluteness Revisited

Abstract

The present paper is concerned with the relation between recurrence axioms and Laver-generic large cardinal axioms in light of principles of generic absoluteness and the Ground Axiom. M. Viale proved that Martin's Maximum$^{++}$ together with the assumption that there are class many Woodin cardinals implies $\mathcal{H}(\aleph_2)^{\mathsf{V}}\prec_{\Sigma_2}\mathcal{H}(\aleph_2)^{\mathsf{V}[\mathbb{G}]}$ for a generic $\mathbb{G}$ on any stationary preserving $\mathbb{P}$ which also preserves Bounded Martin's Maximum. We show that a similar but more general conclusion follows from each of $(\mathcal{P},\mathcal{H}(\kappa))_{\Sigma_2}$-${\sf RcA}^+$ (which is a fragment of a reformulation of the Maximality Principle for $\mathcal{P}$ and $\mathcal{H}(\kappa)$), and the existence of the tightly $\mathcal{P}$-Laver-generically huge cardinal. While under "$\mathcal{P}=$ all stationary preserving posets", our results are not very much more than Viale's Theorem, for other classes of posets, "$\mathcal{P}=$ all proper posets" or "$\mathcal{P}=$ all ccc posets", for example, our theorems are not at all covered by his theorem. The assumptions (and hence also the conclusion) of Viale's Theorem are compatible with the Ground Axiom. In contrast, we show that the assumptions of our theorems (for most of the common settings of $\mathcal{P}$ and with a modification of the large cardinal property involved) imply the negation of the Ground Axiom. This fact is used to show that fragments of Recurrence Axiom $(\mathcal{P},\mathcal{H}(\kappa))_\Gamma$-${\sf RcA}^+$ can be different from the corresponding fragments of Maximality Principle ${\sf MP}(\mathcal{P},\mathcal{H}(\kappa))_\Gamma$ for $\Gamma=\Pi_2$.

Explore related subjects

Keep this discovery

BibTeXRIS

Sakaé Fuchino, Takehiko Gappo, Francesco Parente. 2024-10-20. Generic Absoluteness Revisited. https://doi.org/10.1017/jsl.2025.10131

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