All Questions

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

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

Consider a set $X\subseteq \mathbb{R}$ such that $X$ is not separable wrt its subspace topology For all $r\in\mathbb{R}$ there exists a sequence $(x_n)_{n\in\omega} \subset X$ converging to $r$ In a ...

Suppose $V\models ZFC$ and $P\in V$ is a poset of forcing conditions. It is a basic theorem in forcing that $V[G]\models ZFC$ for any generic extension by a $V$-generic filter $G$. It is also known ...