Forcing is a method first used to prove the continuum hypothesis is independent of the classical axioms of set theory

learn more… | top users | synonyms

8
votes
0answers
226 views

preserving saturated ideals

A reliable source made the following claim: Suppose CH there is an $\omega_2$-saturated ideal on $\omega_1$. Then this is preserved by $\mathrm{Add}(\omega_1,\omega_2)$. Question 1: How do you ...
0
votes
0answers
129 views

If C is a closed, unbounded subset of Ord, are the sets generated by the new class of ordinals Ord restricted to C, a Universe?

Given any universe, and some closed unbounded subset of Ord, is it possible toy generate a universe in the following way: Restrict Ord to a target club. Then generate all look the sets necessary to ...
9
votes
2answers
477 views

Preserving $\omega_1$ is Inaccessible to the reals

$\omega_1$ is inaccessible to the reals if and only if for all $x \in {}^\omega\omega$, $\omega_1^{L[x]} < \omega_1$. The question is if $\omega_1$ is inaccessible to the reals in $V$ and ...
1
vote
1answer
136 views

$\mathbb{P}_{\kappa}$ forces non$(\mathcal{M})$=cov$(\mathcal{M})=\kappa$

Let $\kappa$ be an uncountable regular cardibnal. Consider the finite support iteration $(\langle \mathbb{P}_{\alpha}\rangle _{\alpha \leq \kappa},\langle \mathbb{\dot{Q}}_{\alpha}\rangle _{\alpha ...
9
votes
1answer
370 views

Just a little absoluteness might be cheaper?

Absoluteness is a wonderful thing, but expensive consistency-strength wise. My question is, when can we get large amounts of absoluteness in specific situations for much cheaper? Specifically, fix a ...
10
votes
0answers
165 views

Generic $\mathbf{\Sigma}_3^1$-absoluteness for class forcings

In the paper "Generic Absoluteness" by Bagaria and Friedman (http://www.logic.univie.ac.at/~sdf/papers/bagfried.pdf) it is shown that in ZFC generic $\mathbf{\Sigma_3^1}$-absoluteness is false for ...
25
votes
5answers
1k views

Forcing as a replacement of induction and diagonal arguments

Let me give some examples motivating the question. The use of forcing instead of induction: For this consider Cantor's theorem: Theorem 1. Any two countable dense linear orders $I, J$ without end ...
5
votes
1answer
295 views

Details for Woodin's forcing argument for a saturated ideal from the Levy collapse

Theorem 2.65 in Woodin's book shows that a saturated ideal on $\omega_1$ exists after Levy-collapsing a Woodin cardinal $\delta$ to $\omega_2$. I am confused about the part of the argument where he ...
11
votes
0answers
187 views

Adding a saturated ideal

Is it consistent that there is no $\omega_2$-saturated ideal on $\omega_1$, but one is introduced by an $\omega_2$-closed forcing?
10
votes
0answers
199 views

c.c.c forcing notions and adding minimal generic reals

Is the following statement consistent: ``There is no non-trivial c.c.c forcing notion adding a minimal generic real''? The question is related to Prikry's question: Is it consistent that any ...
7
votes
1answer
187 views

Introducing meets while preserving directed closure

A poset $\mathbb{P}$ is called well-met iff every pair of compatible conditions in $\mathbb{P}$ has a greatest lower bound. Question: Suppose $\mathbb{P}$ is a separative partial order which is ...
22
votes
1answer
843 views

How hard is it to destroy a diamond? (with a real)

If we start with $V\models\lozenge$, it is not hard to force the failure of diamond. You can blow up the continuum, or destroy all the Suslin trees. You can blow up the continuum of $\aleph_1$, and ...
11
votes
1answer
264 views

minimal collapsing without GCH

Suppose $\kappa$ is a regular cardinal. Does there necessarily exist a poset $\mathbb P$ that collapses $\kappa^+$ while preserving all other cardinals?
9
votes
1answer
191 views

Does $Add(\kappa,1)^L$ ever collapse cardinals?

In general, we know that adding a subset to a regular cardinal $\kappa$ can collapse cardinals. If, for example, there is $\gamma < \kappa$ with $2^\gamma >\kappa$, then $Add(\kappa,1)$ will ...
6
votes
1answer
135 views

completions of regular suborders

Suppose $\mathbb{P}$ is a regular suborder of the separative partial order $\mathbb{Q}$ (see below for definitions). Must there always exist some complete boolean algebra $\mathbb{B}$ such that: ...
5
votes
1answer
198 views

$\text{cov}(\mathcal{M})$ vs. $\mathfrak{b}$ vs. $\mathfrak{s}$

Let me first recall some pretty standard notations: $\text{cov}(\mathcal{M})$ is the covering number of the ideal $\mathcal{M}$ of all meager subsets of $\mathbb{R}$; $\mathfrak{b}$ is the bounding ...
8
votes
1answer
310 views

Canonical functions in set theory and their applications

Given regular cardinal $\kappa>\omega,$ we can define the canonical functions $f_\alpha: \kappa\to \kappa,$ for $\alpha<\kappa^+.$ Some of their properties are presented in Chapter 22 of the ...
1
vote
0answers
124 views

What can be said about a Boolean-valued structure from what the Boolean-valued forcing extension thinks about it?

Suppose that $\phi$ is a formula in the language of set theory such that there are some $n_{1},...,n_{k}$ such that if $V\models\phi(x)$, then $x=(X,R_{1},...,R_{k})$ and ...
5
votes
1answer
176 views

Universally Baire Tree Representation of Projective Sets

In Feng, Magidor, and Woodin "Universally Baire Sets of Reals", they show that if $A$ is a $\mathbf{\Pi}_2^1$ set and $U$ and $V$ are any pair of trees witnessing the universal baireness of $A$, then ...
5
votes
2answers
542 views

A specific Model of ZFC

In his paper "Some Second Order Set Theory", Joel Hamkins asked whether there is a model of set theory $V$ that is elementary equivalent to $V[G]$, Whenever $G$ is $V$-generic for the collapse of a ...
1
vote
0answers
174 views

The patterns of possibility for nontrivial automorphisms and nontrivial elementary embeddings of the universe

In their paper "The Role of the Foundation Axiom in the Kunen Inconsistency" (arXiv:1311.0814 [Math.LO]), Daghighi, Golshani, Hamkins, and Jerabek show that the patterns of possibility for the ...
4
votes
0answers
229 views

Is there some absoluteness between the Boolean valued universe $V^{B}$ and $V$?

It is well known that if $\phi$ is a $\Delta_{1}$-formula and $x_{1},..,x_{n}$ in $V$ and $V[G]$ is a forcing extension, then $V\models\phi(x_{1},...,x_{n})$ if and only if ...
13
votes
6answers
1k views

The origins of forcing in mathematical logic and other branches of mathematics

As everyone knows, forcing was created by Cohen to answer questions in set theory. Question 1. What are the first applications of set theoretic forcing in other branches of mathematical logic, like ...
3
votes
0answers
177 views

What algebraic identities does the iteration of forcing operation satisfy?

Let $G$ be the set of all formulas $\phi(x)$ in the language of such that $ZFC\vdash\exists x\phi(x)$ exists, $ZFC\vdash\phi(x)\rightarrow``x\,\textrm{is a complete Boolean algebra}"$, ...
4
votes
1answer
129 views

$\mathfrak{p}=\mathfrak{b}=\mathfrak{a}=\aleph_1$ and $\mathfrak{d}=\mathfrak{c}=\kappa$

Asumme tha in $M$, $CH$ holds and $\kappa>\aleph_0$ and $\kappa^{\aleph_0}=\kappa$. Let $K$ be $Fn(\kappa,2)$-generic over $M$. Question: Then we can say in $M[K]$ that: $(i)$ ...
14
votes
2answers
580 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 ...
2
votes
1answer
113 views

“Namba forcing adds reals” independent of $ZFC + \neg CH$?

I know that, in the presence of $CH$, Namba forcing does not add reals. But when $CH$ fails, is it consistent that it still does not add reals?
8
votes
2answers
242 views

Is there a version of Miller forcing “guided by” an ultrafilter?

It’s well known that Mathias forcing factors as a two-step iteration $P(\omega)/\mathrm{fin}\ast \mathbb{M}_{\dot U}$, where $\mathbb{M}_{\dot U}$ is Mathias forcing guided by the generic ultrafilter ...
7
votes
6answers
530 views

Applications of forcing in model theory

What are the major applications of (set theoretic) forcing in model theory?
7
votes
1answer
343 views

Tree Version of Hechler Forcing

In their recent (2009) paper Eventually Different Functions and Inaccessible Cardinals, Brendle and Löwe consider a 'tree version' of the Hechler forcing. This forcing $\mathbb{D}$ consists of ...
5
votes
2answers
244 views

Preservation Results for Iterations of Non-Proper Forcing

Suppose $\mathbb{P}$ is a forcing with the following properties: Let $G \subseteq \mathbb{P}$ be filter generic over $V$, then there exists $A \in V[G]$ such that $V[G]$ thinks $A$ is countable and $A ...
14
votes
2answers
473 views

Preservation of properness

Suppose $\mathbb P$ is a countably closed forcing, and $\mathbb Q$ is a c.c.c. forcing that adds reals. Is $\mathbb P$ still proper in $V^{\mathbb Q}$?
8
votes
0answers
167 views

History of preservation theorems in forcing theory

For my honours thesis, I am studying a general preservation theorem using a framework provided by Shelah. I am mainly concerned about revised countable support iteration of $\dot{S}$-semiproper ...
6
votes
1answer
452 views

Adding sets not containing arithmetic progressions of length three by forcing

Consider the following forcing notion: conditions in $\mathbb{P}$ are pairs $(s, N),$ where: 1) $s\in 2^{<\omega}$, 2) $N\in \mathbb{N}$, 3) (by identifying $s$ with a subset of $lh(s)$) $s$ ...
6
votes
0answers
197 views

Tree property and singular strong limit cardinals

I heard that the following theorem is proved recently by Foreman-Magidor, which answers a famous old open question: Theorem. It is consistent, relative to the existence of large cardinals, that ...
15
votes
3answers
831 views

Questions about $\aleph_1-$closed forcing notions

"Foreman`s maximality principle" states that every non-trivial forcing notion either adds a real or collapses some cardinals. This principle has many consequences including: 1) $GCH$ fails ...
-2
votes
1answer
185 views

Forcing and $\mathbb{P}$-name [closed]

If $\mathbb{P}$ be a poset, $\dot{Q}$ a $\mathbb{P}$-name and $\mu$ an infinite cardinal such that $\Vdash 0<|\dot{Q}|\leq\mu$. $(a)$ Exist names $\langle \dot{q}_\alpha\rangle_{\alpha<\mu}$ ...
13
votes
3answers
539 views

Products of Cohen forcings

Let $\lambda$ be an infinite cardinal. Does the full support product of $\lambda$ copies of $Add(\omega, 1)$ collapse $2^\lambda$ to $\aleph_0$? For $\lambda = \omega$, it is known to be true (it is ...
1
vote
1answer
244 views

Confusion with proof about a fact $\mathbb{P}$-name [closed]

Let $\mathbb{P}$ be poset. Let $B$ be a set. We say that a $\mathbb{P}$-name $\dot{b}$ is a nice name for member of $B$ if there is a maximal antichain $A\subseteq\mathbb{P}$ and a function ...
14
votes
3answers
552 views

Singularizing forcing of “small” cardinality?

Can there be a large cardinal $\kappa$ and a forcing of size $\kappa$ that makes $\kappa$ a singular cardinal? The motivation is that the standard Prikry forcing does not have a dense set of size ...
4
votes
1answer
280 views

stationary tower forcing

It is known that if $\delta$ is a Woodin cardinal and $\kappa < \delta$, then the stationary tower forcing $\mathbb Q^\kappa_{<\delta}$ preserves cardinals up to $\kappa$ and forces $\delta = ...
11
votes
1answer
307 views

cardinals below the critical point of a generic embedding

This may be an easy question. Are the cardinals below the critical point of a precipitous ideal embedding always absolute between the generic ultrapower and the generic extension? To focus on the ...
7
votes
2answers
424 views

collapsing successor of singular

Let $\lambda$ be a singular cardinal. Is it consistent that there is a forcing of size $\lambda^+$ that collapses $\lambda^+$ while preserving all cardinals below $\lambda$? (Note that even without ...
4
votes
1answer
143 views

presaturated ideals

In this paper, Gitik and Shelah make the following claim (part of Proposition 1.5): Claim (Gitik-Shelah): Suppose $\kappa < \lambda$ are regular, $2^\lambda = \lambda^+$, and $D$ is a normal ...
4
votes
2answers
246 views

Proving results about complete Boolean algebras in ZFC using Boolean valued models

I want to know what non-trivial ZFC theorems (not consistency results) about complete Boolean algebras (or more generally of partially ordered sets) one can prove using forcing. I am mainly ...
3
votes
1answer
92 views

The GCH in a reverse Easton support iteration

I am trying to understand the proof that the GCH can first fail at a weakly compact cardinal. We assume the GCH and that there exists a weakly compact cardinal $\kappa$, and we construct a reverse ...
5
votes
1answer
152 views

Pseudo-Prikry sequences vs Prikry sequences

Definition: Let $V\subseteq W$ be two transitive models of $ZFC$. A pseudo-Prikry sequence, $s$, at a cardinal $\kappa$ for $(V, W)$ is an $\omega$-sequence, cofinal at $\kappa$ such that for every ...
9
votes
0answers
221 views

Proving regularity properties from forcing axioms

It's well known that PFA implies projective determinacy. It's also well known that PD implies that all projective sets are Lebesgue measurable, have the Baire property, etc. Is there a direct proof ...
9
votes
1answer
348 views

Forcing to “minimally” add new reals.

Suppose that I want to force to add a "single" new subset of $\omega$ and not much else. For example, consider the Cohen forcing consisting of finite partial functions from $\omega$ to 2. The forcing ...
9
votes
1answer
325 views

singularize the least inaccessible?

Is it consistent that there is some partial order $\mathbb P$ and some inaccessible cardinal $\kappa$, which is the least inaccessible, such that $\mathbb P$ forces $\kappa$ to be singular while ...