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

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

Restricted Kinna Wagner Principle:  For every infinite set \(X\) there is an infinite subset \(Y\) of \(X\) and a function \(f\) such that for every \(z\subseteq Y\), if \(|z| \ge 2\) then \(f(z)\) is a non-empty proper subset of \(z\).

Restricted Ordering Principle:  For every infinite set \(X\) there is an infinite subset \(Y\) of \(X\) such that \(Y\) can be linearly ordered.

Restricted Choice for Families of Well Ordered Sets:  For every infinite set \(X\) there is an infinite subset \(Y\) of \(X\) such that the family of non-empty well orderable subsets of \(Y\) has a choice function.