\(DC(\aleph _{1})\):  Given a relation \(R\) such that for every  subset \(Y\) of a set \(X\) with \(|Y| < \aleph_{1}\) there is an \(x \in  X\)  with \(Y \mathrel R x\), then there is a function \(f: \aleph_{1} \rightarrow  X\) such that \((\forall\beta < \aleph_{1}) (\{f(\gamma ): \gamma < b \} \mathrel R f(\beta))\).

\(C(\aleph_{1},\infty)\): Every set \(A\) of non-empty sets such that \(\vert A\vert = \aleph_{1}\) has a choice function. Moore, G. [1982], p. 202.

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

\(KW(\aleph_0,\infty)\), The Kinna-Wagner Selection Principle for a denumerable family of sets: For every denumerable set \(M\) there is a function \(f\) such that for all \(A\in M\), if \(|A| > 1\) then \(\emptyset\neq f(A)\subsetneq A\).