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

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

Martin's Axiom \((\aleph_{0})\): Whenever \((P\le)\) is a non-empty, ccc  quasi-order (ccc means every anti-chain is countable) and \({\cal D}\) is a family of \(\le\aleph_0\) dense subsets of \(P\), then there is a \({\cal D}\) generic filter \(G\) in \(P\).