SearcharxivSearch

arXiv subjects

Alejandro Poveda

Publications and source records attributed to Alejandro Poveda.

25 records · Page 2Linked to original sources

Sigma-Prikry forcing II: Iteration Scheme

In Part I of this series, we introduced a class of notions of forcing which we call Sigma-Prikry, and showed that many of the known Prikry-type notions of forcing that center around singular cardinals of countable cofinality are Sigma-Prikry. We showed that given a Sigma-Prikry poset P and a P-name for a non-reflecting stationary set T, there exists a corresponding Sigma-Prikry poset that projects to P and kills the stationarity of T. In this paper, we develop a general scheme for iterating Sigma-Prikry posets and, as an application, we blow up the power of a countable limit of Laver-indestructible supercompact cardinals, and then iteratively kill all non-reflecting stationary subsets of its successor. This yields a model in which the singular cardinal hypothesis fails and simultaneous reflection of finite families of stationary sets holds.

math.LO

Negating the Galvin Property

We prove that Galvin's property consistently fails at successors of strong limit singular cardinals. We also prove the consistency of this property failing at every successor of a singular cardinal. In addition, the paper analyzes the effect of Prikry-type forcings on the strong failure of the Galvin property and explores stronger forms of this property in the context of large cardinals

math.LO

Sigma-Prikry forcing I: The Axioms

We introduce a class of notions of forcing which we call $Σ$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $Σ$-Prikry. We show that given a $Σ$-Prikry poset $\mathbb P$ and a name for a non-reflecting stationary set $T$, there exists a corresponding $Σ$-Prikry poset that projects to $\mathbb P$ and kills the stationarity of $T$. Then, in a sequel to this paper, we develop an iteration scheme for $Σ$-Prikry posets. Putting the two works together, we obtain a proof of the following. Theorem. If $κ$ is the limit of a countable increasing sequence of supercompact cardinals, then there exists a cofinality-preserving forcing extension in which $κ$ remains a strong limit, every finite collection of stationary subsets of $κ^+$ reflects simultaneously, and $2^κ=κ^{++}$.

math.LO

The tree property at first and double successors of singular cardinals with an arbitrary gap

Let $\mathrm{cof}(μ)=μ$ and $κ$ be a supercompact cardinal with $μ<κ$. Assume that there is an increasing and continuous sequence of cardinals $\langleκ_ξ\mid ξ<μ\rangle$ with $κ_0:=κ$ and such that, for each $ξ<μ$, $κ_{ξ+1}$ is supercompact. Besides, assume that $λ$ is a weakly compact cardinal with $\sup_{ξ<μ}κ_ξ<λ$. Let $Θ\geqλ$ be a cardinal with $\mathrm{cof}(Θ)>κ$. Assuming the $\mathrm{GCH}_{\geqκ}$, we construct a generic extension where $κ$ is strong limit, $\mathrm{cof}(κ)=μ$, $2^κ= Θ$ and both $\mathrm{TP}(κ^+)$ and $\mathrm{TP}(κ^{++})$ hold. Further, in this model there is a very good and a bad scale at $κ$. This generalizes the main results of [Sin16a] and [FHS18].

math.LO

Identity crises between supercompactness and Vopenka's Principle

In this paper we study the notion of $C^{(n)}$-supercompactness introduced by Bagaria in \cite{Bag} and prove the identity crises phenomenon for such class. Specifically, we show that consistently the least supercompact is strictly below the least $C^{(1)}$-supercompact but also that the least supercompact is $C^{(1)}$-supercompact (and even $C^{(n)}$-supercompact). Furthermore, we prove under suitable hypothesis that the ultimate identity crises is also possible. These results solve several questions posed by Bagaria and Tsaprounis.

math.LO

Rosenthal compacta that are premetric of finite degree

We show that if a separable Rosenthal compactum $K$ is an $n$-to-one preimage of a metric compactum, but it is not an $n-1$-to-one preimage, then $K$ contains a closed subset homeomorphic to either the $n-$Split interval $S_n(I)$ or the Alexandroff $n-$plicate $D_n(2^\mathbb{N})$. This generalizes a result of the third author that corresponds to the case $n=2$.

math.GN