Questions tagged [forcing]

Forcing is a set theoretic method used mainly for proving independence results. For questions about forcing function please use (differential-equations).

Forcing was invented by Paul Cohen in 1963 in order to prove the relative consistency of the failure of the continuum hypothesis with the axioms of $\sf ZFC$.

The idea is to fix a model of $\sf ZFC$, and define internally to that model a partial order which describes some sort of approximations of the new object we wish to adjoin (e.g. a new subset of $\omega$). By adjoining a generic filter to this partial order, where generic means that it meets every dense set that the model knows about, we can show that the object defined by the generic filter inherits the properties which are true on dense sets, and that the model we have when adjoining this generic filter is still a model of $\sf ZFC$.

Moreover, if the model chosen was countable, then we can prove the existence of a generic filter.

For example, if $M$ is a countable model of $\sf ZFC$ and our partial order is all the finite subsets of $\omega^M$ ordered by end extension, then a generic filter would define a subset of $\omega^M$ which is not in $M$. To see this, note that if $A\in M$ is a subset of $\omega^M$ then it defines in $M$ a dense set of all the finite subsets which are not included in $A$. Why is it dense? Because we can always extend a finite set so it will not be a subset of $A$ anymore. So, a subset defined by the generic filter has to be different from $A$.

To read more here is a few good resources:

  1. Jech - Set Theory (3rd Millennium edition).
  2. Kunen - Set Theory.
  3. Halbeisen - Combinatorial Set Theory
734 questions
2
votes
1 answer

Role of Negation in Tarski Truth and Cohen Forcing Definitions

As I am new to Forcing, I would appreciate any help on whether the following is anywhere near being correct : Given a Structure M, Enderton, 2001, "A Mathematical Introduction to Logic" defines truth in the structure M on page 84 with a valuation S,…
user239186
2
votes
1 answer

$(<\kappa)$-closure for Prikry forcing

A p.o. $\mathcal{P}$ is $(<\kappa)$-closure, if for every decreasing sequence of $<\kappa$ conditions in the forcing $p_0 \geq p_1 \geq \cdots$, there is a condition that is below all of them. Prikry forcing $\mathcal{P}$ is the set of pairs…
1
vote
1 answer

Are P-names the codes used to define all possible membership relations that could be Forced from a Countable Model of Set Theory?

Is the following anywhere close to a possible meaning of P-Names in Forcing, based upon a countable model M of Set Theory and the addition of a new set G and its associated model M[G] ?: 1) If the membership relation for each set in a model of set…
user239186
1
vote
1 answer

a question on forcing

Suppose $p_{n}$, $n\in \omega$ is a sequence in a partial order $P$ and $Q_{n}$ is a dense open subset of $P$ for each $n\in\omega$ such that $p_{n}\in Q_{n}$ and $\bigcap_{n}Q_{n}=\emptyset$. Is it true that no generic $G$ can contain all $p_{n}$?
0
votes
0 answers

Coding a new real using a variant of the Baumgartner forcing

I'm working with the following variant of Baumgartner's forcing to add a club subset of $\omega_1$, talked about by Mitchell on page 3 here: https://arxiv.org/pdf/math/0407225.pdf Let $S \subseteq \omega_1$ be stationary. The poset $\mathbb{P}_S$ is…
0
votes
0 answers

Question on iterated forcing from Halbeisen's book.

I am reading through the chapter on iterated forcing from Halbeisen's set theory book and have some trouble about the notation that he uses. Let $\mathbb{P}_{\alpha} = \langle \mathring{\mathbb{Q}}_{\gamma}: \gamma \in \alpha\rangle$ be an…
0
votes
0 answers

Forcing relation: names and check names

Let $P\in V$ be a forcing notion and let $\varphi(x,\sigma_1,\dots,\sigma_n)$ be a formula in the forcing language, where $\sigma_1,\dots,\sigma_n$ are $P$-names. Suppose there is a condition $p\in P$ such that $p\Vdash\exists…
Seba Thei
  • 236
0
votes
0 answers

Best introduction to Forcing

What is the best source(paper/book) for an introduction to Forcing? What I found already is Chow, some papers of Cohen himself etc.
Averroes2
  • 1,147
0
votes
1 answer

Can all subsets of N intersect all Cohen Dense Sets?

$\mathbf{A.}$ Define a partial order (Domain,<,PO) as follows: PosNeg := {1,-1, 2,-2, 3,-3 ....} Domain := {FinSub$_i$ : Finsub$_i$ is a finite subset of PosNeg} PO is ordered using "<" with the following rules: FinSub$_i$ < FinSub$_j$ $\;$ iff …
user239186
0
votes
1 answer

A forcing notion which collapses $\omega_1$

I am dealing with iterate forcing and I am focusing in those properties which are preserved via iterations. In this regard I would like to see that the forcing $\mathbb{P}=(Fn(\omega,2)^\omega)^M$ which is isomorphic to the $\omega-$iteration of…
Antoine
  • 327
0
votes
1 answer

Shooting a club through a stationary set

I'm trying to understand the construction of a club set of $\omega_1$ inside a stationary one in a generic extension. Given a stationary set $S\subset\omega_1$ the forcing which force the existence of a club inside $S$ in a generic extension is…
Cesare
  • 377