**4**

votes

**4**answers

1k views

### Where do Set Theory and Number Theory meet together?

As all know, by absoluteness theorems in Set Theory, most of theorems in number theory are $ZFC$-provable if and only if they are consistent with $ZFC$, it's because of absoluteness of essence of ...

**9**

votes

**0**answers

184 views

### Preserving Jonsson cardinals

I am (still) interested in trying to characterize and describe forcings that preserve Jonsson cardinals. A cardinal $\kappa$ is a Jonsson cardinal if there is no Jonsson algebra on $\kappa$, i.e. ...

**11**

votes

**1**answer

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

**32**

votes

**1**answer

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

**10**

votes

**2**answers

349 views

### Semiproper but not proper

Assume V=L. Is there a semi-proper notion of forcing that is not proper?
Namba forcing isn't semi-proper in L, and Prikry forcing isn't even available there.

**3**

votes

**1**answer

164 views

### CCC Forcing and $\omega_1$ conditions

I have a question about the proof of the Lemma 7.2 in the paper
I. Juhász, P. Koszmider and L. Soukup,
A first countable, initially $\omega_{1}$-compact but non-compact space,
Topology and its ...

**2**

votes

**1**answer

141 views

### A question regarding forcing extensions

Can one, for an infinite set A in ZFC, use forcing to add so many generic subsets of A as to make the collection of all subsets of A a proper class? Consider now a model $M$ of ZFC and use $Add( , ...

**1**

vote

**2**answers

146 views

### A Question Regarding Defining Generic Extensions of ZF and ZFC in Morse-Kelly Set Theory

It is known that Morse-Kelly (MK) set theory forms a metatheory for ZFC. For example:
MK proves Con(ZFC). In fact, Joel David Hamkins claims in his blog post "Kelly-Morse set theory implies Con(ZFC) ...

**7**

votes

**2**answers

378 views

### When can we reach a real by forcing?

I'm sure this is well-known, but: suppose I have a non-constructible real $r\in V-L$. Under what conditions is there a poset $\mathbb{P}\in L$ and a $G$ which is $\mathbb{P}$-generic over $L$, such ...

**2**

votes

**1**answer

237 views

### At what level of the analytic hierarchy do Cohen reals lie?

In his doctoral thesis titled "Three models of ordinal computability", Benjamin Seyfferth proved the following theorems:
i) A set $\mathtt A$ of reals is Ordinal Turing Machine-enumerable if and only ...

**5**

votes

**2**answers

394 views

### Gorelic's Forcing for large Lindelöf spaces with points $G_\delta$

I am trying to understand a step for proving that there exists large Hausdorff Lindelöf Spaces with points $G_\delta$ using forcing. I am following Isaac Gorelic's "The Baire Category And Forcing ...

**8**

votes

**2**answers

373 views

### centeredness in forcing iterations

Suppose $A$ is a complete subalgebra of a complete boolean algebra $B$, and $B$ is $\kappa$-centered. Let $G \subset A$ be a generic ultrafilter. Is $B/G$ $\kappa$-centered in $V[G]$?
Naively, we ...

**8**

votes

**1**answer

330 views

### A question about three forcings

Let $P_1$ be the finite support iteration of random forcings of length $\omega$. Let $P_2 = \text{Random} \times \text{Random}$ and $P_3 = \text{Random} \times \text{Cohen}$. Are $P_i, P_j$, for $1 ...

**8**

votes

**1**answer

295 views

### On $V$-decisive and weakly homogeneous forcings

Suppose that $\Bbb P$ is a forcing in $V$, we say that $\Bbb P$ is $V$-decisive if whenever $\varphi(x_1,\ldots,x_n)$ is a statement in the language of forcing, and $u_1,\ldots,u_n\in V$ then $1_{\Bbb ...

**8**

votes

**1**answer

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

**6**

votes

**1**answer

397 views

### Can the Cohen forcing collapse cardinals?

Let $\kappa$ be a regular cardinal, and let $\mathbb{P} = Add(\kappa,1)$ be the standard forcing notion for adding a new subset of $\kappa$ using partial function from $\kappa$ to $2$ with domain of ...

**2**

votes

**2**answers

116 views

### proof that “small” sets in an extension by iterated forcing already appear in an earlier stage

In Kunen's book (introduction to independence proofs, ) the following lemma is proved (chapter 8, lemma 5.14):
Assume that in M, $\alpha$ is a limit ordinal,
$( ( \mathbb{P}_\xi : \xi \leq \alpha) , ...

**4**

votes

**0**answers

176 views

### Recursively Pointed Sacks Forcing and Preserving $\omega_1$

Let $\mathbb{P}$ denote recursively pointed Sacks forcing. This is forcing with recursively pointed perfect trees ordered by inclusion. A tree $T \subseteq {}^{<\omega}2$ is recursively pointed if ...

**3**

votes

**1**answer

223 views

### How to change the successor of a singular with a Woodin?

I'm looking for references on how to change the successor of a singular cardinal from "more or less" minimal assumptions. If possible, then without adding bounded subsets to the singular either.
In ...

**6**

votes

**1**answer

214 views

### Consistency of Weak Diamond with a Weak Version of Martin's Axiom

If $S \subset \omega_1$ is stationary, then the weak diamond principle $\Phi(S)$ states that for any $F: 2^{<\omega_1} \to 2$, there is a $g: \omega_1 \to 2$ such that for all $f: \omega_1 \to 2$, ...

**7**

votes

**1**answer

453 views

### Forcing is intuitionistic

The main idea of why it´s necessary a generic filter $G$ to extend a countable transitive $\epsilon$-interpretation (not necessarily a model) $M$ is given by the condition (for which $G$ being a ...

**0**

votes

**1**answer

186 views

### A Question Regarding the Powerset Size Axiom

Consider the the Powerset Size Axiom, that is, the following:
(PSA) ($\forall$x,y) |x|$\lt$|y|$\Rightarrow$$2^{|x|}$$\lt$$2^{|y|}$.
Does there exist a class $\mathscr M$ of models of ZFC such that ...

**3**

votes

**1**answer

185 views

### Does existence of $\omega_1$ subset of reals imply $\omega_1$ choice for subsets of reals?

Suppose there exists a subset of $\Bbb R$ which has cardinality $\omega_1$. Is it then necessarilly true that for every collection of $\omega_1$ subsets of $\Bbb R$ there exists a choice function?
I ...

**3**

votes

**1**answer

191 views

### Is Every New Real in the Silver Extension a Silver Generic Real?

Let $\mathbb{V}$ denote Prikry-Silver forcing. That is, $\mathbb{V}$ is forcing with partial functions $\omega \rightarrow 2$ with coinfinite domain or forcing with uniform trees.
Let $\dot x$ ...

**5**

votes

**2**answers

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

**5**

votes

**2**answers

383 views

### If every nonseparable metric space contains a sequence of subsets with no convergent subsequence, does the Continuum Hypothesis hold?

If every nonseparable metric space contains a sequence of subsets with no convergent subsequence, does the Continuum Hypothesis hold?
The answer is negative, and in the interests of self-contained ...

**4**

votes

**0**answers

187 views

### A question about $\dot{S^Q}$-semiproperness and revised countable support iterated forcing of length a limit ordinal

For a forcing notion $Q$, let $\dot{S^Q}$ be the $Q$-name for the class of ordinals $\{\kappa : \kappa = \omega_1^{V}$ $or$ $\kappa$ $is$ $a$ $regular$ $uncountable$ $cardinal \}$ in $V^Q$.
We say ...

**6**

votes

**1**answer

386 views

### Different approaches to forcing

There are many different approaches to the forcing method, and I am looking for all known such approaches. So my question is:
Question 1. Which different approaches to set theoretic forcing are ...

**7**

votes

**0**answers

250 views

### Silver's unpublished work on reverse Easton iteration

Silver was the first person who used the method of reverse Easton iterations in connection with large cardinals, and used it to force the failure of $GCH$ at some measurable cardinal.
At most papers ...

**6**

votes

**1**answer

103 views

### $RUCar^{V}$-semiproperness implies properness

This is a claim in Shelah's Proper and Improper Forcing, more specifically Claim 2.3(1) of Chapter X (p. 484). The proof of the claim is "Easy" but I cannot quite figure it out. There must be some ...

**16**

votes

**1**answer

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

**9**

votes

**0**answers

188 views

### Which forcing types preserve the axiom of determinacy?

Do we have some rudimentary understanding of some properties that a forcing can have in order to guarantee that it doesn't violate the axiom of determinacy?
To be more specific, in Which forcings ...

**5**

votes

**2**answers

217 views

### Iteration of Proper Forcing and Support of Master Conditions

Suppose $\mathbb{P}$ is a definable proper forcing (for instance Sacks forcing). Let $\alpha$ be some ordinal. Let $\mathbb{P}_\alpha$ be the countable support iteration of $\mathbb{P}$ of length ...

**5**

votes

**1**answer

319 views

### Relationship between fragments of the axiom of choice and the dependent choice principles

The dependent choice principle ${\rm DC}_\kappa$ states that if $S$ is a nonempty set and $R$ is a binary relation such that for every $s\in S^{\lt\kappa}$, there is $x\in S$ with $sRx$, then there ...

**7**

votes

**1**answer

262 views

### Inaccessible becomes successor of singular

Is it possible, starting from any large cardinal assumption, to find a countably closed forcing $\mathbb{P}$ such that for some inaccessible $\kappa$, $\Vdash_\mathbb{P} "\kappa = \lambda^+$ and ...

**6**

votes

**1**answer

196 views

### continuum many mutually generic filters

Given a countable model $M$ of set theory and an atomless, separative partial order $\mathbb{P} \in M$, can we construct (in the real universe) $2^\omega$ many pairwise mutually $\mathbb{P}$-generic ...

**3**

votes

**1**answer

371 views

### Preservation of $\diamondsuit$ by ccc forcings of size $\leq \omega_1$

This is essentially exercise H8 (p.248) of Kunen's Set Theory: An Introduction to Independence Proofs (old edition), or exercise IV.7.58 (p.307) of Kunen's Set Theory (new edition).
Suppose $P$ is ...

**3**

votes

**1**answer

121 views

### Boolean completion (of a forcing notion) isomorphic to each of its cones

Suppose $ \mathbb{P} := (P, {\leq_P}, 1_P) $ is a separative partial order. Let $ \mathbb{B} := \operatorname{RO}(\mathbb{P}) $ denote the Boolean completion.
Fix some dense embedding $ i \colon P ...

**4**

votes

**1**answer

209 views

### forcing square with small conditions

In the paper, Large cardinals and definable counterexamples to the continuum hypothesis, Foreman and Magidor mention a way to force $\square_{\omega_1}$ with countable conditions. (This is used in ...

**5**

votes

**2**answers

207 views

### Borel Sets in Sacks Generic Extension

Let $\mathbb{S}$ denote Sacks forcing. This is forcing with perfect trees or equivalently forcing with uncountable Borel subsets of ${}^\omega 2$ with the relation $\subseteq$.
Let $G \subseteq ...

**5**

votes

**1**answer

338 views

### Embeddings of forcing notions - preserve properness?

Let $ M $ be a countable, transitive model for $ \mathsf{ZFC}^* $, i.e. for a sufficiently large finite fragment of $ \mathsf{ZFC} $. Suppose that $ \mathbb{P} := (P, {\leq_P}, \mathbb{1}_P) \in M $ ...

**5**

votes

**2**answers

235 views

### Forcing $\neg AC$

Sorry if this sounds like a silly reference request, but I wasn't able to track down any. I'm looking for proof, via forcing, that axiom of choice can fail in a model of $ZF$. All of papers I found ...

**4**

votes

**1**answer

309 views

### Question about “Coding the universe”

The following is a result which I know as a weak form of Jensen's coding lemma$^*$ (first published in the book "Coding the universe"; also see http://www.jstor.org/stable/2273986):
For any class ...

**8**

votes

**1**answer

136 views

### Strongly compact cardinal with bad covering properties

This is a continuation of the question covering properties of strongly compact embedding.
Recall that a cardinal $\kappa$ is $\nu$-strongly compact cardinal if there is an elementary embedding ...

**19**

votes

**1**answer

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

**8**

votes

**2**answers

274 views

### Does forcing with recursively pointed perfect trees add a Turing degree that is minimal over $V$?

A tree $T$ on $\omega$ is recursively pointed if it is recursive in each of its branches. We can consider a variant of Sacks forcing where the conditions are recursively pointed perfect trees ordered ...

**8**

votes

**1**answer

348 views

### Forcing, cuts, and Dedekind-finite cardinalities

Tl;dr version: there are two natural classes of cuts in the nonstandard model of arithmetic consisting of the Dedekind-finite sets (if, in fact, they constitute such a model); both these classes are ...

**10**

votes

**1**answer

327 views

### Elements of the method of forcing in some papers of N. N. Luzin

In the paper
Eléments de la méthode de forcing dans quelques travaux de N. N. Lousin. (French) [Elements of the method of forcing in some papers of N. N. Luzin] Amphora, 469–479, Birkhäuser, ...

**7**

votes

**1**answer

379 views

### On Consistency of an Existence

Let $\omega \leq \kappa <2^{\omega}$ , $\omega \leq\lambda \leq \kappa$ and $D(\kappa, \lambda)$ be the statement:
For all $ \mathfrak{B} \subseteq \mathbf{P}(\omega)$ with ...

**9**

votes

**2**answers

629 views

### Origin of the term “generic” in set theory

In set theory, in particular the context of forcing, if $M$ is a model of $\sf ZFC$ and $P\in M$ is a partial order, we say that $G\subseteq P$ is a generic filter (or $M$-generic or generic over $M$) ...