Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1110.1584

Martin's Maximum and tower forcing

Sean Cox·Matteo Viale
View original source ↗Read source document ↗Export metadata ↓

Abstract

There are several examples in the literature showing that compactness-like properties of a cardinal $κ$ cause poor behavior of some generic ultrapowers which have critical point $κ$ (Burke \cite{MR1472122} when $κ$ is a supercompact cardinal; Foreman-Magidor \cite{MR1359154} when $κ= ω_2$ in the presence of strong forcing axioms). We prove more instances of this phenomenon. First, the Reflection Principle (RP) implies that if $\vec{\mathcal{I}}$ is a tower of ideals which concentrates on the class $GIC_{ω_1}$ of $ω_1$-guessing, internally club sets, then $\vec{\mathcal{I}}$ is not presaturated (a set is $ω_1$-guessing iff its transitive collapse has the $ω_1$-approximation property as defined in Hamkins \cite{MR2540935}). This theorem, combined with work from \cite{VW_ISP}, shows that if $PFA^+$ or $MM$ holds and there is an inaccessible cardinal, then there is a tower with critical point $ω_2$ which is not presaturated; moreover this tower is significantly different from the non-presaturated tower already known (by Foreman-Magidor \cite{MR1359154}) to exist in all models of Martin's Maximum. The conjunction of the Strong Reflection Principle (SRP) and the Tree Property at $ω_2$ has similar implications for towers of ideals which concentrate on the wider class $GIS_{ω_1}$ of $ω_1$-guessing, internally stationary sets. Finally, we show that the word "presaturated" cannot be replaced by "precipitous" in the theorems above: Martin's Maximum (which implies SRP and the Tree Property at $ω_2$) is consistent with a precipitous tower on $GIC_{ω_1}$.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sean Cox, Matteo Viale. 2011-10-18. Martin's Maximum and tower forcing. https://arxiv.org/abs/1110.1584

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

KEEP EXPLORING

Related papers

arXiv2026

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO↗
arXiv2026

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO↗
arXiv2026

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO↗