\(UT(\aleph_0,\aleph_0,\aleph_0,\Bbb R)\): The union of a denumerable  family  of denumerable subsets of \({\Bbb R}\) is denumerable.

\(C(\aleph_0,\le\aleph_0)\): Every denumerable set of non-empty countable sets  has a choice function.

Lebesgue measure is countably additive.

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

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

Every set is almost well orderable.

\(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 is a subset of \({\Bbb R}\) which is not Borel.

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

In \(\Bbb R\), the union of a denumerable number of analytic sets is analytic. G. Moore [1982], pp 181 and 325.

There are exactly \(2^{\aleph_0}\) Borel sets in \(\Bbb R\). G. Moore [1982], p 325.

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

\(KW(\infty,\infty)\) (KW), The Kinna-Wagner Selection Principle: For every  set \(M\) there is a function \(f\) such that for all \(A\in M\), if \(|A|>1\) then \(\emptyset\neq f(A)\subsetneq A\). (See Form 81(\(n\)).  

\(UT(\aleph_{0},\aleph_{0},\aleph_{0})\): The countable union theorem:  The union of a denumerable set of denumerable sets is denumerable.

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

\(MC_\omega(\aleph_0,\infty)\): For every denumerable family \(X\) of pairwise disjoint non-empty sets, there is a function \(f\) such that for each \(x\in X\), f(x) is a non-empty countable subset of \(x\).

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

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

\(UT(WO,WO,WO)\): The union of a well ordered collection of well orderable sets is well orderable.

\(KW(\infty,WO)\), The Kinna-Wagner Selection Principle for a family of well orderable sets: For every set \(M\) of well orderable sets there is a function \(f\) such that for all \(A\in M\), if \(|A| > 1\) then \(\emptyset\neq f(A)\subsetneq A\).  (See Form 15.)

Every Lindelöf metric space is second countable.

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