SearcharxivSearch

arXiv · 2003.07120

Tameness for set theory $II$

Abstract

The paper is the second of two and shows that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic definable concepts of second and third order arithmetic, and appealing to the model-theoretic notions of model completeness and model companionship. Specifically we use the general framework linking generic absoluteness results to model companionship introduced in the first paper to show that strong forms of Woodin's axiom $(*)$ entail that any theory $T$ extending $\mathsf{ZFC}$ by suitable large cardinal axioms has a model companion $T^*$ with respect to certain signatures $\tau$ containing symbols for $\Delta_0$-relations and functions, constant symbols for $\omega$ and $\omega_1$, a predicate symbol for the nonstationary ideal on $\omega_1$, symbols for certain lightface definable universally Baire sets. Moreover $T^*$ is axiomatized by the $\Pi_2$-sentences $\psi$ for $\tau$ such that $T$ proves that $$ L(\mathsf{UB})\models(\mathbb{P}_\max\Vdash\psi^{H_{\omega_2}}), $$ where $L(\mathsf{UB})$ denotes the smallest transitive model containing the universally Baire sets. Key to our results is the recent breakthrough of Asper\`o and Schindler establishing that a strong form of Woodin's axiom $(*)$ follows from $\mathsf{MM}^{++}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Matteo Viale. 2020-03-16. Tameness for set theory $II$. https://arxiv.org/abs/2003.07120

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