\((\forall \alpha)(UT(\aleph_{\alpha},\aleph_{\alpha}, \aleph_{\alpha}))\): For every ordinal \(\alpha\), if \(A\) and every member of \(A\) has cardinality \(\aleph_{\alpha}\), then \(|\bigcup A| = \aleph _{\alpha }\).

\(C(WO,\infty)\):  Every well orderable set of non-empty sets has a choice function. Moore, G. [1982], p 325.

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

\(SPI\): Weak ultrafilter principle: Every infinite set has a non-trivial ultrafilter.
Jech [1973b], p 172 prob 8.5.

\(PW\):  The power set of a well ordered set can be well ordered.

\({\cal P}(\Bbb R)\) is well orderable.

If \(X\) is a \(T_2\) space with at least two points and \(X^{Y}\) is hereditarily metacompact then \(Y\) is  countable. (A space is metacompact if every open cover has an open point finite refinement. If \(B\) and \(B'\) are covers of a space \(X\), then \(B'\) is a refinement of \(B\) if \((\forall x\in B')(\exists y\in B)(x\subseteq y)\). \(B\) is point finite if \((\forall t\in X)\) there are only finitely many \(x\in B\) such that \(t\in x\).) van Douwen [1980]

\(C(WO,WO)\):  Every well ordered family of non-empty, well orderable sets has a choice function.

\(SVC\): There is a set \(S\) such that for every set \(a\), there is an ordinal \(\alpha\) and a function from \(S\times\alpha\) onto \(a\).

There are \(2^{\aleph_0}\) Vitali equivalence classes. (Vitali equivalence classes are equivalence classes of the real numbers under the relation \(x\equiv y\leftrightarrow(\exists q\in{\Bbb Q})(x-y=q)\).). \ac{Kanovei} \cite{1991}.

The Banach-Tarski Paradox: There are three finite partitions \(\{P_1,\ldots\), \(P_n\}\), \(\{Q_1,\ldots,Q_r\}\) and \(\{S_1,\ldots,S_n, T_1,\ldots,T_r\}\) of \(B^3 = \{x\in {\Bbb R}^3 : |x| \le 1\}\) such that \(P_i\) is congruent to \(S_i\) for \(1\le i\le n\) and \(Q_i\) is congruent to \(T_i\) for \(1\le i\le r\).

\(\Bbb Z\) (the set of integers under addition) is amenable.  (\(G\) is {\it amenable} if there is a finitely additive measure \(\mu\) on \(\cal P(G)\) such that \(\mu(G) = 1\) and \(\forall A\subseteq G, \forall g\in G\), \(\mu(gA)=\mu(A)\).)

The set of all denumerable subsets of \(\Bbb R\) has power \(2^{\aleph_0}\).

If \(\Bbb R\) is partitioned into two sets, at least one of them has cardinality \(2^{\aleph_0}\).

\(C(\infty,WO)\): Every set of non-empty, well orderable sets has a choice function.
Moore, G. [1982], p 125.

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

\(MC(\infty,\infty)\) \((MC)\), The Axiom of Multiple Choice: For every set \(M\) of non-empty sets there is a function \(f\) such that \((\forall x\in M)(\emptyset\neq f(x)\subseteq x\) and \(f(x)\) is finite).

Every set is either well orderable or has an infinite amorphous subset.

\(D_{\aleph_{0}}\): Every non-well-orderable set is the union of a pairwise disjoint, well orderable family of denumerable sets.  (See note 27 for \(D_{\kappa}\), \(\kappa\) a well ordered cardinal.)

Definability of cardinal addition in terms of \(\le\): There is a first order formula whose only non-logical symbol is \( \le \) (for cardinals) that defines cardinal addition.

Every non-well-orderable set has an infinite, Dedekind finite subset.

\(EP\) sets: For every set \(A\) there is a projective set \(X\) and a function from \(X\) onto \(A\).

\(EFP\ Ab\): Every Abelian group is a homomorphic image of a free projective Abelian group.

If \((E_i)_{i\in I}\) is a family of non-empty sets, then there is a family \((U_i)_{i\in I}\) such that \(\forall i\in I\), \(U_i\) is an ultrafilter on \(E_i\).

Idemmultiple Partition Principle: If \(y\) is idemmultiple (\(2\times y\approx y\)) and \(x\precsim ^* y\), then \(x\precsim y\).