**47**

votes

**3**answers

3k views

### Forcing as a new chapter of Galois Theory

There is a (very) long essay by Grothendieck with the ominous title La Longue Marche à travers la théorie de Galois (The Long March through Galois Theory). As usual, Grothendieck knew what he was ...

**31**

votes

**1**answer

833 views

### Producing finite objects by forcing!

It is a trivial fact that forcing can not produce finite sets of ground model objects. However there are situations,
where we can use forcing to prove the existence of finite objects with some ...

**26**

votes

**5**answers

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 ...

**24**

votes

**0**answers

477 views

### Where do uncountable models collapse to?

Suppose $T$ is a complete first-order theory (in an finite, or at worst countable, language). Given any model $\mathcal{M}\models T$ of cardinality $\kappa$, we can ask whether $\mathcal{M}$ can be ...

**23**

votes

**2**answers

2k views

### Similarities between Post's Problem and Cohen's Forcing

Remark: I have since learned that G.H. Moore addresses this question in the third reference listed at the end of this post, beginning on p. 157 in which he cites a letter from Kreisel to Gödel dated ...

**23**

votes

**2**answers

582 views

### When does the choice of the generic matter?

It is a somewhat curious phenomenon that, in forcing arguments, one usually doesn't care about any particular properties of the generic filter being used (this isn't strictly true; there are cases ...

**23**

votes

**1**answer

1k 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 ...

**19**

votes

**3**answers

2k views

### In What Way are Set Theorists' 'Experiences' in the CH Worlds Flawed, if Any?

This is in regards to Joel David Hamkins' new paper "IS THE DREAM SOLUTION OF THE CONTINUUM HYPOTHESIS ATTAINABLE?" (look under title in arXiv). I quote from the last paragraph of his paper:
"My ...

**19**

votes

**1**answer

647 views

### If all reals are generic, is the set of reals generic?

Let $W\subseteq V$ be two models of $\sf ZFC$ with the same ordinals. Is the following situation consistent:
For every $x\in\Bbb R^V$ there is some $P_x\in W$ such that for some $G\subseteq P_x$ ...

**17**

votes

**5**answers

2k views

### What is the generic poset used in forcing, really?

I'm not a set theorist, but I understand the 'pop' version of set-theoretic forcing: in analogy with algebra, we can take a model of a set theory, and an 'indeterminate' (which is some poset), and add ...

**17**

votes

**1**answer

723 views

### Kaplansky's conjecture and Martin's axiom

Recall Kaplansky's conjecture which states that every algebra homomorphism from the Banach algebra C(X) (where X is a compact Hausdorff topological space) into any other Banach algebra, is ...

**17**

votes

**2**answers

2k views

### Two versions of “absolutely ccc”

I have recently been slogging my way through Shelah's "Large continuum, oracles". Essentially from the start there has been a question needling me which I cannot seem to answer.
In the paper, ...

**16**

votes

**9**answers

2k views

### Examples of ZFC theorems proved via forcing

This is an old suggestion of Joel David Hamkins at the end of his answer to this question: Forcing as a tool to prove theorems
I just noticed it while trying to understand his answer. But indeed it ...

**16**

votes

**2**answers

2k views

### Universe view vs. Multiverse view of Set Theory

Here I refer to Hamkins' slides:
http://lumiere.ens.fr/~dbonnay/files/talks/hamkins.pdf
particularly, to the "Universe view simulated inside Multiverse", p. 22.
My question is: is it very unsound ...

**16**

votes

**2**answers

497 views

### Is the notion of fixed point property for topological spaces an absolute notion?

Recall that a topological space $X$ has the fixed point property (FPP) if any continuous function $f: X\to X$ has a fixed point.
Is the notion of FPP for topological spaces an absolute notion? More ...

**16**

votes

**2**answers

615 views

### How “much” does (Grigorieff) forcing destroy an ultrafilter?

Introduction. I recently revisited Shelah's model without P-points and I was wondering how "badly" Grigorieff forcing destroys ultrafilters, i.e., what kind of properties can survive the destruction ...

**16**

votes

**1**answer

664 views

### Three old questions on the Sacks forcing

I came across the two following Qs in 1970.
Find reals $a,b$ such that $a$ is Sacks over $L[b]$ and vice versa $b$ is Sacks over $L[a]$. Note that a Sacks $\times$ Sacks generic pair definitely does ...

**15**

votes

**4**answers

1k views

### A New Continuum Hypothesis (Revised Version)

Define $N_n$ as $n$ th natural number: $N_0=0, N_1=1, N_2=2, ...$.
What happens after exponentiation?
We have the following equation: $2^{N_n}=N_{2^{n}}$.
(Which says: For all finite cardinal $n$ ...

**15**

votes

**2**answers

830 views

### Woodin's unpublished proof of the global failure of GCH

An unpublished result of Woodin says the following:
Theorem. Assuming the existence of large cardinals, it is consistent that $\forall \lambda, 2^{\lambda}=\lambda^{++}.$
In the paper "The ...

**15**

votes

**3**answers

853 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 ...

**15**

votes

**0**answers

622 views

### Souslin trees and weakly compact cardinals

In Souslin trees on the first inaccessible cardinal it is asked if it is consistent that there are no $\kappa-$Souslin trees at the least inaccessible cardinal $\kappa$.
In this question I would like ...

**14**

votes

**2**answers

532 views

### Who needs RCS iterations?

According to this paper of Chaz Schlindwein, any countable support iteration of semi-proper forcings is semi-proper. This seems like a breakthrough simplification, and I wonder why it is not more ...

**14**

votes

**3**answers

494 views

### Is Prikry forcing minimal?

Let $M$ be a model of $\sf ZFC$ in which $\kappa$ is a measurable cardinal, and $\cal U$ is a normal measure on $\kappa$. We can define the Prikry forcing (the most simple one) as the poset: $$\Bbb ...

**14**

votes

**3**answers

620 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 ...

**14**

votes

**2**answers

641 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 ...

**14**

votes

**2**answers

490 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}$?

**14**

votes

**1**answer

503 views

### Is every class that does not add sets necessarily added by forcing?

We know there are many situations in which we can force over a model $M$ of GBC to add a class $G$ without adding any sets. That is, the extension $M[G]$ satisfies GBC and has the same sets as $M$. ...

**14**

votes

**2**answers

734 views

### Set-theoretic forcing over sites?

All texts I have read on set-theoretic independence proofs consider several different sorts of constructions separately, such as Boolean-valued models (equivalently, forcing over posets), permutation ...

**13**

votes

**8**answers

3k views

### Forcing as a tool to prove theorems

It is often mentioned the main use of forcing is to prove independence facts, but it also seems a way to prove theorems. For instance how would one try to prove Erdös-Rado, $\beth_n^{+} \to ...

**13**

votes

**6**answers

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 ...

**13**

votes

**3**answers

868 views

### A limit to Shoenfield Absoluteness

Shoenfield's Absoluteness Theorem states that if $\phi$ is any $\Sigma^1_2$ sentence of second-order arithmetic, then $\phi$ is absolute between any two models of $ZF$ which share the same ordinals. ...

**13**

votes

**3**answers

548 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 ...

**13**

votes

**1**answer

703 views

### Forcing over set theory versus forcing over arithmetic

I've been trying to understand better some of the research on forcing over bounded arithmetic and its connections with lower bounds in complexity theory. For example, Takeuti and Yasumoto have some ...

**13**

votes

**1**answer

628 views

### Can there be an almost-special not-fully-special Aronszajn tree?

Question. Can there be an Aronszajn tree $T$, such that no
c.c.c. forcing extension adds a cofinal branch to $T$, but there is an
$\omega_1$-preserving forcing extension adding a cofinal branch to
...

**13**

votes

**1**answer

795 views

### Impact of discrepancy between Kunen's and Jech's definition of iterated forcing on full support iterations

One of the first things we usually learn when we study iterated forcing is that we can force over a model of ZFC + GCH to make the continuum function ($\lambda \mapsto 2^{\lambda}$) restricted to some ...

**13**

votes

**1**answer

406 views

### Random reals and strongly meager sets

Adding a single Cohen real makes the set of reals from the ground model strong measure zero (see this question).
The notion of strong measure zero sets has its dual concept in the category branch -- ...

**12**

votes

**4**answers

943 views

### Cantor-Bernstein for notions of forcing

For forcing notions $\mathbb{P}$ and $\mathbb{Q}$ let us write $\mathbb{P}\triangleleft\mathbb{Q}$ if forcing with $\mathbb{Q}$ always adds a $\mathbb{P}$-generic filter over $V$. In other words, ...

**12**

votes

**3**answers

898 views

### When can we detect forcing?

First, a rather broad question: has there been any work on what, given a model $M$ of set theory, we can say about those models of set theory $N$ and posets $\mathbb{P}$ such that $\mathbb{P}\in N$ ...

**12**

votes

**4**answers

1k views

### Forcing over models without the axiom of choice

In the vast majority of papers forcing is always developed over ZFC.
Not surprisingly too, since infintary combinatorial principles are often used to prove results based on properties such as chain ...

**12**

votes

**1**answer

645 views

### I'll admit it: I don't understand the definition of the Easton product.

I'm teaching myself bits and pieces of forcing at the moment, for the purposes of translating them into sheaf-theoretic versions. I'm trying to write down what I feel is a cleaner description of the ...

**12**

votes

**1**answer

213 views

### Forcings that are not equivalent to Levy collapse

Assume GCH and that $\kappa$ is a regular uncountable cardinal. Let $\mathbb{P}$ be a separative, $<\kappa$-directed closed, nowhere trivial, $\kappa^+$-cc poset of size $\kappa^+$. Must ...

**12**

votes

**1**answer

375 views

### capturing small sets in small factors

Suppose $\kappa$ is a regular cardinal and $P$ is a $\kappa$-c.c. partial order. I want to know when are small sets added by subforcings of size $<\kappa$. The following seems well-known:
...

**12**

votes

**0**answers

445 views

### Some questions about $0^{\sharp}$ and forcing over $L$

1-Let $P\in L$ be a nontrivial set forcing or even a tame class forcing (tameness in the sense of Sy Friedman; see for example his Handbook paper), and let $G$ be $P-$generic over $L$. Then it is ...

**11**

votes

**3**answers

1k views

### Forcing over an arbitrary model of ZFC

I’m learning set theory and forcing in the (french) book from Jean-Louis Krivine “Théorie des ensembles”.
Given a countable transitive model $\mathscr{M}$ of ZFC together with a poset $P$, he ...

**11**

votes

**2**answers

680 views

### Questions about Prikry forcing and Cohen forcing

I have some questions.
The first one is about the product of Prikry's forcing.
Let $\kappa$ be a measurable cardinal, $U_1, U_2$ be normal measures on $\kappa$ and let $\mathbb{P}_{U_1}, ...

**11**

votes

**1**answer

1k views

### Forcing in Homotopy Type Theory

I apologize if this question doesn't make any sense. I'll just go ahead and delete it if that's the case. But the question is just the title. Is there a notion of forcing in homotopy type theory? ...

**11**

votes

**2**answers

616 views

### Can we collapse $\omega_1$ to $\omega$ without adding a dominating real?

(Disclaimer: This question was also asked at MSE (http://math.stackexchange.com/questions/71020/can-we-collapse-omega-1-without-adding-a-dominating-real). I'm posting it here because, when I asked it, ...

**11**

votes

**1**answer

257 views

### Does stationary reflection imply Mahloness?

Suppose $\kappa$ is strongly inaccessible and every stationary subset of $\kappa$ reflects. Must $\kappa$ be Mahlo?
Remarks:
It is possible for every stationary subset of $\kappa$ to reflect, but ...

**11**

votes

**1**answer

310 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?

**11**

votes

**1**answer

574 views

### Is forcing computable?

By results similar to Tennenbaum's theorem we know that there exist no computable models of $ZF$. But suppose we are given, as a sort of oracle, access to some model of $ZF$ (e.g. we can make oracle ...