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

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

Löwenheim-Skolem Theorem: If a countable family of first order  sentences is satisfiable in a set \(M\) then it is satisfiable in a countable subset of \(M\). (See Moore, G. [1982], p. 251 for references.