All Questions
414 questions
2
votes
0
answers
62
views
Consistency of Sigma-V-2 uniformization with AD
Is ZF + AD consistent with: For every real $r$, every true $Σ^V_2(r)$ statement has a $Δ^V_2(r)$ example?
DC is provable in ZF + every true $Σ^V_2$ statement has a $Δ^V_2$ example (i.e. witness). ...
- 7,545
9
votes
2
answers
384
views
Iteration of $\aleph_2$-properness
Let us say a forcing $P$ is proper for a class of models $\mathcal C$, if for large enough regular $\theta$ and $M \prec H_\theta$ in $\mathcal C$ with $P \in M$, every $p \in P \cap M$ can be ...
- 1,281
4
votes
0
answers
225
views
Complexity of $Σ_n$ theory of $H(ω_2)$ under MM$^{++}$
Complexity of $Σ_n$ theory of $H(ω_2)$ under MM$^{++}$
Under Woodin's $\mathbb{P}_\text{max}$ axiom (which is implied by MM$^{++}$), what is the complexity of the $Σ_n$ theory of $H(ω_2)$? Same ...
- 7,545
4
votes
0
answers
107
views
Partial uniformization under AD
Under ZF + AD, and especially $\text{AD}^+$, even if uniformization fails for reals, in some ways it must almost hold.
For a notion of small, we say that uniformization holds on a co-small set of ...
- 7,545
2
votes
1
answer
161
views
Are Cohen Generics Minimal Covers?
Are Cohen generics (in $2^\omega$) minimal covers?
I'm ultimately interested in this question for some more effective notion of forcing but I realized I wasn't sure how to show this even assuming full ...
- 44.4k
2
votes
0
answers
232
views
Is the poset in the following construction stationary $\aleph_{\alpha + 2}$-linked?
Definition: A poset P is $\mathbf{stationary}$ $\kappa^{+}$-$\mathbf{linked}$ if for every sequence of conditions $(p_{\gamma} | \gamma < \kappa^{+})$, there is a regerssive function $f: \kappa^{+} ...
7
votes
0
answers
260
views
A version of determinacy for all sets
Under ZF + AD, some games are undetermined because of lack of choice. In fact, the axiom of choice is equivalent to determinacy of games of length 2. However, we can ask whether the lack of choice ...
- 7,545
6
votes
0
answers
179
views
$Δ^1_3$ reals in transitive models
Every real number is $Δ^1_2$ in some $ω$-model of ZFC\P. I am looking for analogous statements for $Δ^1_3$ definability and transitive models, where the situation is more subtle.
What is the ...
- 9,902
18
votes
1
answer
554
views
When can we add choice to a model of ZF
For countable transitive models of ZF, is existence of a ZFC extension with the same height a first order property?
In other words, is there a statement $τ$ (in the language of set theory) such that ...
- 39.7k
14
votes
1
answer
642
views
Example of a forcing notion with finite-predecessor condition that does not add reals
This question seems very basic but I cannot seem to find any literature on it.
Let $\mathbb{P}$ be a forcing notion. If $p$ is a condition of $\mathbb{P}$, define the predecessor set of $p$ to be $$\{...
- 236k
3
votes
0
answers
211
views
Intuitionistic set-theoretic geology
Work in ZF, if there are proper class many supercompact cardinals, then all grounds are uniformly definable. Hence under reasonable assumption, we can have choiceless set-theoretic geology.
But can we ...
- 63.9k
6
votes
1
answer
199
views
$L(\mathbb{R})$-absoluteness from a proper class of Woodins: source?
For a paper I'm writing I need to use (as a blackbox) the following theorem: if there is a proper class of Woodin cardinals and $G$ is set-generic, then $L(\mathbb{R})$ and $L(\mathbb{R})^{V[G]}$ are ...
- 234
8
votes
4
answers
630
views
closure of separative quotients
Does there exist a partial order, nontrivial for forcing, that is countably closed, but whose separative quotient is not countably closed? Supposing the answer is yes, then is there a partial order, ...
- 2,143
7
votes
2
answers
727
views
What goes wrong in Easton forcing if we don't just use regular cardinals?
Recall that Easton forcing was introduced to show that the continuum function at regular cardinals could be anything subject to 'the obvious constraints' (monotonicity etc). However, it is a handy ...
- 1,097
6
votes
0
answers
144
views
Alternative proofs of the countable chain condition in forcing
Advance warning: This question is more about history and pedagogy than "hard" mathematics.
I am studying Cohen forcing with the forcing poset $(\operatorname{Fin}(E,2),\supseteq,0)$, and I ...
- 35.5k
18
votes
3
answers
2k
views
Scott-Solovay unpublished paper on ``Boolean valued models of set theory''
I have read some papers from 1970$^{th}$, and in some of them, the paper of Scott and Solovay on ``Boolean valued models of set theory'' is given as a main reference, with many references to the ...
- 47.1k
4
votes
1
answer
533
views
How to settle the Generalized Continuum Hypothesis when there are urelements?
Work in $\sf ZFCA$ and permutation models has preceded forcing by several decades. Was it used to settle the question of the Generalized Continuum Hypothesis $\sf GCH$ when urelements are admitted? I ...
- 11.3k
3
votes
0
answers
200
views
Weak extender models for supercompactness without choice
Assume ZFC and a supercompact cardinal $κ$. Is it consistent that there is a weak extender model $N⊨\text{ZF}$ for supercompactness of $κ$ such that the axiom of choice and well-ordering of $P_κ(λ)^N$...
- 7,545
4
votes
0
answers
166
views
Consistency of definability beyond P(Ord) in ZF
Is it consistent with ZF that the satisfaction relation of $L(P(Ord))$ is $Δ^V_2$ definable? More generally, is it consistent with ZF that there is a $Δ^V_2$ formula (taking $α$ as a parameter) that ...
- 7,545
4
votes
1
answer
332
views
Cohen forcing: why is the cardinality of $\mathcal P \left({\omega}\right)$ in ${\bf L}(\mathcal P \left({\omega}\right))$ independent of G?
This is a part of exercise E4 from Chapter VII of Kunen's Set Theory.
The hint (courtesy of A. Miller) goes like this: let ${\mathbb P} = Fn(I,2)$, $(|I| \geq \omega_{1})^M$. Let G be ${\mathbb P}$-...
- 5
6
votes
0
answers
125
views
From HODs to corresponding models of AD
If $M$ is HOD of a model $N$ of $\text{AD}^+ + V=L(P(ℝ))$, what kind of forcing construction in $M$ gives back such an $N$?
HODs for $\text{AD}^+ + V=L(P(ℝ))$ are conjectured (and under anti-large ...
- 7,545
8
votes
1
answer
241
views
A reference for forcing projections
The idea of a projection $\pi\colon\mathbb{Q}\to\mathbb{P}$ of forcing notions is something like a combinatorial stand-in for the fact that forcing with $\mathbb{Q}$ produces a generic for $\mathbb{P}$...
- 18.6k
6
votes
2
answers
438
views
Stationary many subsets of $\kappa^+$ whose order type is a cardinal and whose intersection with $\kappa$ is an inaccessible cardinal
Is anything known about the consistency strength of the following statement?
$\kappa$ is a Mahlo cardinal and there is a stationary set of $a \in \mathcal{P}_\kappa(\kappa^+)$ such that $a \cap \...
- 1,799
15
votes
1
answer
615
views
Changing the cofinality of a regular cardinal without collapsing any cardinals?
I have a short but hopefully interesting question on cardinal arithmetic and collapsing cardinals:
Is it possible to change the cofinality of a regular cardinal without collapsing any cardinals?
Is ...
- 1,799
17
votes
6
answers
1k
views
Strategic vs. tactical closure
The Banach-Mazur game on a poset $\mathbb P$ is the $\omega$-length game where the players alternate choosing a descending sequence $a_0 \geq b_0 \geq a_1 \geq b_1 \geq \dots$. Player II wins when ...
- 2,143
6
votes
1
answer
301
views
A variation on pinned equivalence relations
Recall (see e.g. Zapletal, Pinned equivalence relations) that a Borel equivalence relation $E$ on $\omega^\omega$ is pinned iff for every forcing $\mathbb{P}$ and every $\mathbb{P}$-name $\nu$ we have ...
- 225
7
votes
2
answers
440
views
On the existence of a real which is not set-generic over $L$
Recall that a real $r$ is set-generic over $L$ if there is a constructible forcing notion $\mathbb{P}$ and some $L$-generic filter $G\subset\mathbb{P}$ such that $r \in L[G]$.
I know that Jensen's ...
- 32.1k
8
votes
1
answer
413
views
Precipitous ideal and inner model
Assume $\kappa$ is measurable, $U$ is its unique normal measure, $V=L[U]$. We levy collapse $\kappa$ to make it become $\omega_1$.
If we don't have the inner model condition, then we only know that $\...
- 9,902
5
votes
0
answers
136
views
When does an iteration not add functions $\eta\to V$ at the final stage?
I am interested in better understanding the following property:
Let us say that an iteration of forcings $\langle\mathbb{P}_\alpha,\dot{\mathbb{Q}}_\beta\mid\alpha\leq\gamma,\beta<\gamma\rangle$ is ...
- 2,196
22
votes
2
answers
1k
views
Gently changing measure
This question was asked and bountied on MSE without answer, so I'm porting it here:
There's an easy way to change the measure of a set of reals by moving to a larger universe: simply make $\mathbb{R}$...
- 4,316
6
votes
1
answer
431
views
A strange product forcing
Given two forcing notions $\mathbb{P}_0,\mathbb{P}_1$, we know that the product $\mathbb{P_0}\times\mathbb{P_1}$ will produce the following diagram of models ordered by inclusion:
where $M$ is the ...
- 236k
9
votes
1
answer
434
views
Natural set-theoretic principles implying the Ground Axiom
The Ground Axiom states that the set-theoretic universe is not a set-forcing extension of an inner model. By
Reitz, it is first-order expressible and easy to force over any given ZFC model with class-...
- 12.9k
7
votes
0
answers
234
views
Is this equivalent to (some version of) Hechler forcing?
Let $\omega^{<\omega}$ be the set of finite strings of naturals, and let $\omega^{<\omega}_{\not=\emptyset}$ be the set of nonempty finite strings of naturals. Consider the following forcing ...
- 21.2k
8
votes
2
answers
518
views
History of forcing over admissible sets
In his paper "Forcing in admissible sets", Ershov writes
In unpublished lectures given at Novosibirsk State University in 1976-1977 on the theory of admissible sets, the author
showed that it is ...
- 17.7k
8
votes
1
answer
354
views
Does $\mathsf{MA}^+(\sigma\text{-closed})$ imply there are no Kurepa Trees?
The question in the title is somewhat self contained but let me make some definitions and remarks to clarify.
Recall that $\mathsf{MA}^+(\sigma\text{-closed})$ is the statement that if $\mathbb P$ is ...
5
votes
1
answer
156
views
Countable closure of quotient forcing
Let us say that a partial order is "countably closed with infima" if every descending $\omega$-sequence has an infimum.
Suppose $P$ and $Q$ are posets that are countably closed with infima, ...
- 2,143
11
votes
3
answers
792
views
When are two forcing posets "the same"?
Let $B$ and $C$ be complete Boolean algebras. To avoid triviality I may also want them to be atomless. For $b\in B$ nonzero, denote $B\upharpoonright b=\{p\in B:p\leq b\}$, which can be viewed as a ...
- 236k
9
votes
1
answer
383
views
Extending Namba forcing to arbitrary lengths
Namba forcing is stationary-preserving and forces $cf(\omega_2^{\mathbf{V}}) = \omega$. Ronald Jensen used $\mathcal{L}$-forcing to iterate Namba posets in order to solve the extended Namba problem: ...
- 76
7
votes
1
answer
241
views
Why does an $\varepsilon$-incomplete $Q$ remain so in the forcing extension of any $\varepsilon$-complete $P$?
This is Shelah's simpler notion of 'completeness' for not adding reals via forcing. Here $P$ and $Q$ are forcing notions.
Let $S_{\aleph_0}(\kappa)$ be the set of all countable subsets of a cardinal $\...
- 2,821
2
votes
1
answer
114
views
Closure properties of elementary embeddings resulting from generic iterations
In the context of generic embeddings, we fix a set $Z$, an ideal $I$ on $Z$, and $G$ a generic ultrafilter on $\mathcal{P}(Z) / I$. In $V[G]$, we can define the generic ultrapower $Ult(V, G)$ and an ...
- 2,143
13
votes
2
answers
598
views
Amoeba collapse
Here is a naive idea for a forcing $\mathbb A(\kappa)$, for an inaccessible cardinal $\kappa$. Conditions are pairs $(P,p)$, where $P \in V_\kappa$ is a partial order and $p \in P$. We define the ...
- 2,143
13
votes
3
answers
796
views
How to make countably closed forcing "nice" without choice
When working over a model $V$ of $ZFC$, countably closed forcings are extremely nice:
If $\mathbb{P}$ is countably closed, then $V[G]$ has no new $\omega$-sequences of elements of $V$. In ...
- 14k
17
votes
3
answers
1k
views
Minimum transitive models and V=L
Is there a c.e. theory $T⊢\text{ZFC}$ in the language of set theory such that the minimum transitive model of $T$ exists but does not satisfy $V=L$?
You may assume that ZFC has transitive models. ...
- 7,545
12
votes
1
answer
448
views
Comparing generic versions of $\mathbb{R}$
This question was previously asked and bountied at MSE, unsuccessfully.
I'm currently interested in the behavior of cardinalities in generic extensions of models of $\mathsf{ZF+\neg AC}$, and ...
- 2,520
5
votes
1
answer
248
views
Highly improper forcings
The following question comes from a typo in an old notebook of mine (I changed what I was calling my forcing notion partway through writing the definition of properness):
Say that a forcing $\mathbb{P}...
- 2,143
6
votes
0
answers
273
views
Forcing Martin's Axiom without cardinal arithmetic
We know that if $\kappa>2^{\aleph_0}$ and $\kappa^{<\kappa}=\kappa$, then there is a c.c.c. forcing which forces $\sf MA+2^{\aleph_0}=\kappa$. Traditionally, we even start with $\sf GCH$, which ...
- 39.7k
7
votes
1
answer
401
views
How hard is it to get "absolutely" no amorphous sets?
A beautiful and surprising (to me at least) result around the axiom of choice is that, while full $\mathsf{AC}$ is preserved by forcing, a model of $\mathsf{ZF}$ + "There are no amorphous sets&...
- 4,316
13
votes
1
answer
561
views
Iterating Neeman's forcing
In the paper, "Forcing with sequences of models of two types," (MR3201836), Neeman claims that, using a supercompact and a weakly compact above, one can force with his pure side conditions ...
- 18.6k
5
votes
0
answers
146
views
$2^{|V|}$ class cardinalities without global choice
Is it consistent with Morse-Kelley set theory without global choice (but with choice for sets) that there are $2^{|V|}$ proper classes of different cardinalities?
Alternative question: Is it ...
- 7,545
3
votes
0
answers
104
views
Examples of the use of forcing to build up models of stronger theories?
I'm very new to the subject of forcing. I always got the impression that with forcing we begin with say a model $M$ of a theory $\sf T+I$ and produce another model $M[G]$ that is also a model of $\sf ...
- 11.3k