SearcharxivSearch

arXiv · 1305.2058

Category forcings, $MM^{+++}$, and generic absoluteness for the theory of strong forcing axioms

Abstract

We introduce a category whose objects are stationary set preserving complete boolean algebras and whose arrows are complete homomorphisms with a stationary set preserving quotient. We show that the cut of this category at a rank initial segment of the universe of height a super compact which is a limit of super compact cardinals is a stationary set preserving partial order which forces $MM^{++}$ and collapses its size to become the second uncountable cardinal. Next we argue that any of the known methods to produce a model of $MM^{++}$ collapsing a superhuge cardinal to become the second uncountable cardinal produces a model in which the cutoff of the category of stationary set preserving forcings at any rank initial segment of the universe of large enough height is forcing equivalent to a presaturated tower of normal filters. We let $MM^{+++}$ denote this statement and we prove that the theory of $L(Ord^{\omega_1})$ with parameters in $P(\omega_1)$ is generically invariant for stationary set preserving forcings that preserve $MM^{+++}$. Finally we argue that the work of Larson and Asper\'o shows that this is a next to optimal generalization to the Chang model $L(Ord^{\omega_1})$ of Woodin's generic absoluteness results for the Chang model $L(Ord^{\omega})$. It remains open whether $MM^{+++}$ and $MM^{++}$ are equivalent axioms modulo large cardinals and whether $MM^{++}$ suffices to prove the same generic absoluteness results for the Chang model $L(Ord^{\omega_1})$.

Explore related subjects

Keep this discovery

BibTeXRIS

Matteo Viale. 2013-05-09. Category forcings, $MM^{+++}$, and generic absoluteness for the theory of strong forcing axioms. https://arxiv.org/abs/1305.2058

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