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.

Ramsey's Theorem I: If \(A\) is an infinite set and the family of all 2 element subsets of \(A\) is partitioned into 2 sets \(X\) and \(Y\), then there is an infinite subset \(B\subseteq A\) such that all 2 element subsets of \(B\) belong to \(X\) or all 2 element subsets of \(B\) belong to \(Y\). (Also, see Form 325.), Jech [1973b], p 164 prob 11.20.

\(PC(\infty, <\aleph_0,\infty)\):  Every infinite family of finite  sets has an infinite subfamily with a choice function.