It is proved in $\mathsf {ZF}$ (without the axiom of choice) that, for all infinite sets M, there are no surjections from $\omega \times M$ onto $\operatorname {\mathrm {\mathscr {P}}}(M)$.

For a set M, let |M| denote the cardinality of M. A family F is called strongly almost disjoint if there is an n∈ω such that |A∩B|<n for any two distinct elements A, B of F. It is shown in ZF (without the axiom of choice) that, for all infinite sets M and all strongly almost disjoint families F⊆P(M), |F|<|P(M)| and there are no finite-to-one functions from P(M) into F, where P(M) denotes the power set of M.

We write$\mathcal {S}_n(A)$for the set of permutations of a setAwithnnon-fixed points and$\mathrm {{seq}}^{1-1}_n(A)$for the set of one-to-one sequences of elements ofAwith lengthnwherenis a natural number greater than$1$. With the Axiom of Choice,$|\mathcal {S}_n(A)|$and$|\mathrm {{seq}}^{1-1}_n(A)|$are equal for all infinite setsA. Among our results, we show, in ZF, that$|\mathcal {S}_n(A)|\leq |\mathrm {{seq}}^{1-1}_n(A)|$for any infinite setAif${\mathrm {AC}}_{\leq n}$is assumed and this assumption cannot be removed. In the other direction, we show that$|\mathrm {{seq}}^{1-1}_n(A)|\leq |\mathcal {S}_{n+1}(A)|$for any infinite setAand the subscript$n+1$cannot be reduced ton. Moreover, (...) we also show that “$|\mathcal {S}_n(A)|\leq |\mathcal {S}_{n+1}(A)|$for any infinite setA” is not provable in ZF. (shrink)

The factorial of a cardinal, denoted by, is the cardinality of the set of all permutations of a set which is of cardinality. We give a condition that makes the cardinal equality provable without the axiom of choice. In fact, we prove in that, for all cardinals, if and there is a permutation without fixed points on a set which is of cardinality, then.

The factorial of a cardinal, denoted by, is the cardinality of the set of all permutations of a set which is of cardinality. We give a condition that makes the cardinal equality provable without the axiom of choice. In fact, we prove in that, for all cardinals, if and there is a permutation without fixed points on a set which is of cardinality, then.

A partition is finitary if all its members are finite. For a set A, $\mathscr {B}(A)$ denotes the set of all finitary partitions of A. It is shown consistent with $\mathsf {ZF}$ (without the axiom of choice) that there exist an infinite set A and a surjection from A onto $\mathscr {B}(A)$. On the other hand, we prove in $\mathsf {ZF}$ some theorems concerning $\mathscr {B}(A)$ for infinite sets A, among which are the following: (1) If there is a finitary (...) partition of A without singleton blocks, then there are no surjections from A onto $\mathscr {B}(A)$ and no finite-to-one functions from $\mathscr {B}(A)$ to A. (2) For all $n\in \omega $, $|A^n|<|\mathscr {B}(A)|$. (3) $|\mathscr {B}(A)|\neq |\mathrm {seq}(A)|$, where $\mathrm {seq}(A)$ is the set of all finite sequences of elements of A. (shrink)