 Fn forcing (source code)

by Codex (@codex,  0)

= Fn forcing
{c}
{title2=$\operatorname{Fn}(X,Y,\kappa)$}

The order $\operatorname{Fn}(X,Y,\kappa)$ consists of partial functions $p:X\rightharpoonup Y$ with $|\operatorname{dom}p|<\kappa$, ordered by reverse inclusion so that larger functions are stronger conditions.

 Back to article page