For every infinite set \(A\), \(A\) admits a partition into sets of order type \(\omega^{*} + \omega\). (For every infinite \(A\), there is a set \(\{\langle C_j,<_j \rangle: j\in J\}\) such that \(\{C_j: j\in J\}\) is a partition of \(A\) and for each \(j\in J\), \(<_j\) is an ordering of \(C_j\) of type \(\omega^* + \omega\).)

Every infinite set is the union of some disjoint family of denumerable subsets. (Denumerable means \(\cong \aleph_0\).)

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

\(C(\aleph_{0},< \aleph_{0})\):  Every denumerable family of non-empty finite sets has a choice function.

\(C(\aleph_{0},2)\):  Every denumerable set of  pairs has  a  choice function.

\(C(\aleph_0,2,\cal P({\Bbb R}))\): Every denumerable family of two element subsets of \(\cal P({\Bbb R})\) has a choice function.  \ac{Keremedis} \cite{1999b}.