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

Finite \(\Leftrightarrow\) Dedekind finite: \(W_{\aleph_{0}}\) Jech [1973b]: \(E(I,IV)\) Howard/Yorke [1989]): Every Dedekind finite set is finite.

Ramsey's Theorem II: \(\forall n,m\in\omega\), if A is an infinite set and the family of all \(m\) element subsets of \(A\) is partitioned into \(n\) sets \(S_{j}, 1\le j\le n\), then there is an infinite subset \(B\subseteq A\) such that all \(m\) element subsets of \(B\) belong to the same \(S_{j}\). (Also, see Form 17.)