2020
DOI: 10.4153/s0008414x20000425
|View full text |Cite
|
Sign up to set email alerts
|

Sigma-Prikry forcing I: The Axioms

Abstract: We introduce a class of notions of forcing which we call $\Sigma $ -Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $\Sigma $ -Prikry. We show that given a $\Sigma $ -Prikry poset $\mathbb P$ and a name for a non-reflecting stationary set T, there exists a corresponding $\Sigma $ … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2021
2021
2025
2025

Publication Types

Select...
5
2

Relationship

3
4

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 49 publications
0
7
0
Order By: Relevance
“…Similarly, the same wish extends to singular cardinals, although in this context one will encounter a shortage of parallels of PFA. A potential strategy to overcome this problem might bear on the abstract iteration scheme for singular cardinals introduced in the Σ-Prikry project by Rinot, Sinapova and the third author [PRS21b,PRS21a,PRS21c].…”
Section: Open Problemsmentioning
confidence: 99%
“…Similarly, the same wish extends to singular cardinals, although in this context one will encounter a shortage of parallels of PFA. A potential strategy to overcome this problem might bear on the abstract iteration scheme for singular cardinals introduced in the Σ-Prikry project by Rinot, Sinapova and the third author [PRS21b,PRS21a,PRS21c].…”
Section: Open Problemsmentioning
confidence: 99%
“…• Σ = κ n | n < ω is an increasing sequence of Laver-indestructible supercompact cardinals; • κ := sup n<ω κ n , µ := κ + and λ := κ ++ ; • 2 κ = κ + and 2 µ = µ + ; • Γ := {α < µ | ω < cf V (α) < κ}. Under these assumptions, Corollaries 4.11 and 6.1 of [PRS19] read as follows, respectively: Fact 5.4. If (P, ℓ, c) is a Σ-Prikry notion of forcing such that 1l P P μ = κ + , then V P |= Refl(<ω, Γ).…”
Section: An Applicationmentioning
confidence: 99%
“…In the introduction to Part I of this series [PRS19], we described the need for iteration schemes and the challenges involved in devising such a scheme, especially at the level of successor of singular cardinals. The main tool available to obtain consistency results at the level of singular cardinals and their successors is the method of forcing with large cardinals, and in particular, Prikry-type forcing.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations