The exact strength of generic absoluteness for the universally Baire sets

Grigor Sargsyan; Nam Trang

Home/Archive/arXiv

arXiv · 2110.02725

The exact strength of generic absoluteness for the universally Baire sets

Grigor Sargsyan·Nam Trang

View original source ↗Read source document ↗Export metadata ↓

Abstract

A set of reals is \textit{universally Baire} if all of its continuous preimages in topological spaces have the Baire property. $\sf{Sealing}$ is a type of generic absoluteness condition introduced by Woodin that asserts in strong terms that the theory of the universally Baire sets cannot be changed by forcing. The $\sf{Largest\ Suslin\ Axiom}$ ($\sf{LSA}$) is a determinacy axiom isolated by Woodin. It asserts that the largest Suslin cardinal is inaccessible for ordinal definable bijections. Let $\sf{LSA-over-uB}$ be the statement that in all (set) generic extensions there is a model of $\sf{LSA}$ whose Suslin, co-Suslin sets are the universally Baire sets. We show that over some mild large cardinal theory, $\sf{Sealing}$ is equiconsistent with $\sf{LSA-over-uB}$. In fact, we isolate an exact large cardinal theory that is equiconsistent with both (see \rdef{dfn:hod_pm}). As a consequence, we obtain that $\sf{Sealing}$ is weaker than the theory $``\sf{ZFC} + $there is a Woodin cardinal which is a limit of Woodin cardinals". A variation of $\sf{Sealing}$, called $\sf{Tower \ Sealing}$, is also shown to be equiconsistent with $\sf{Sealing}$ over the same large cardinal theory. The result is proven via Woodin's $\sf{Core\ Model\ Induction}$ technique, and is essentially the ultimate equiconsistency that can be proven via the current interpretation of $\sf{CMI}$ as explained in the paper.

Explore related subjects

math.LO

Keep this discovery

BibTeX RIS

Grigor Sargsyan, Nam Trang. 2021-10-06. The exact strength of generic absoluteness for the universally Baire sets. https://arxiv.org/abs/2110.02725

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗