Rasiowa-Sikorski Axiom:  If \((B,\land,\lor)\) is a Boolean algebra, \(a\) is a non-zero element of \(B\), and \(\{X_n: n\in\omega\}\) is a denumerable set of subsets of \(B\) then there is a maximal filter \(F\) of \(B\) such that \(a\in F\) and for each \(n\in\omega\), if \(X_n\subseteq F\) and \(\bigwedge X_n\) exists then \(\bigwedge X_n \in F\).

\(DC(\omega)\) (DC), Principle of Dependent Choices: If \(S\)  is  a relation on a non-empty set \(A\) and \((\forall x\in A) (\exists y\in A)(x S y)\)  then there is a sequence \(a(0), a(1), a(2), \ldots\) of elements of \(A\) such that \((\forall n\in\omega)(a(n)\mathrel S a(n+1))\).  See Tarski [1948], p 96, Levy [1964], p. 136.

\(C(\aleph_{0},\infty)\):

\(C(\aleph_0,2^{(2^{\aleph_0})})\): Every denumerable collection of non-empty sets each with power \(2^{(2^{\aleph_{0}})}\) has a choice function.

\(UT(\aleph_{0},2^{\aleph_{0}},2^{\aleph_{0}})\): The union of denumerably many sets each of power \(2^{\aleph _{0}}\) has power \(2^{\aleph_{0}}\).

There is an ordinal \(\alpha\) such that for all \(X\), if \(X\) is a denumerable union of denumerable sets then \({\cal P}(X)\) cannot be partitioned into \(\aleph_{\alpha}\) non-empty sets.