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

Lebesgue measure is countably additive.

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

\({\cal P}(\Bbb R)\) is 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}.

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

If \(K\) is a finite subset of \(\omega-\{0,1\}\), \(C(\infty,K)\): For every \(n\in K\), every set of \(n\)-element sets has a choice function.

If \(n\in\omega-\{0,1\}\), \(C(WO,n)\): Every well ordered collection of \(n\)-element sets has a choice function.

Tychonoff's Compactness Theorem for Countably Many \(T_2\) Spaces: The product of countably many \(T_2\) compact spaces is compact.

Every non-well-orderable set has an infinite subset with a Dedekind finite power set.

If \(n\in\omega-\{0,1\}\), \(C(\aleph_0,n)\): Every denumerable set of \(n\)-element sets has a choice function.

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

(For \(n\in\omega\), \(n\ge 2\).) \(PC(\aleph_0,n,\infty)\): Every denumerable set of \(n\)-element sets has an infinite subset with a choice function.