We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We write $\mathcal {S}_n(A)$ for the set of permutations of a set A with n non-fixed points and $\mathrm {{seq}}^{1-1}_n(A)$ for the set of one-to-one sequences of elements of A with length n where n is 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 sets A. Among our results, we show, in ZF, that $|\mathcal {S}_n(A)|\leq |\mathrm {{seq}}^{1-1}_n(A)|$ for any infinite set A if ${\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 set A and the subscript $n+1$ cannot be reduced to n. Moreover, we also show that “$|\mathcal {S}_n(A)|\leq |\mathcal {S}_{n+1}(A)|$ for any infinite set A” is not provable in ZF.
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)$.
In this paper we extend to non-classical set theories the standard strategy of proving independence using Boolean-valued models. This extension is provided by means of a new technique that, combining algebras (by taking their product), is able to provide product-algebra-valued models of set theories. In this paper we also provide applications of this new technique by showing that: (1) we can import the classical independence results to non-classical set theory (as an example we prove the independence of $\mathsf {CH}$); and (2) we can provide new independence results. We end by discussing the role of non-classical algebra-valued models for the debate between universists and multiversists and by arguing that non-classical models should be included as legitimate members of the multiverse.
For a set x, let ${\cal S}\left( x \right)$ be the set of all permutations of x. We prove in ZF (without the axiom of choice) several results concerning this notion, among which are the following:
(1) For all sets x such that ${\cal S}\left( x \right)$ is Dedekind infinite, $\left| {{{\cal S}_{{\rm{fin}}}}\left( x \right)} \right| < \left| {{\cal S}\left( x \right)} \right|$ and there are no finite-to-one functions from ${\cal S}\left( x \right)$ into ${{\cal S}_{{\rm{fin}}}}\left( x \right)$, where ${{\cal S}_{{\rm{fin}}}}\left( x \right)$ denotes the set of all permutations of x which move only finitely many elements.
(2) For all sets x such that ${\cal S}\left( x \right)$ is Dedekind infinite, $\left| {{\rm{seq}}\left( x \right)} \right| < \left| {{\cal S}\left( x \right)} \right|$ and there are no finite-to-one functions from ${\cal S}\left( x \right)$ into seq (x), where seq (x) denotes the set of all finite sequences of elements of x.
(3) For all infinite sets x such that there exists a permutation of x without fixed points, there are no finite-to-one functions from ${\cal S}\left( x \right)$ into x.
(4) For all sets x, $|{[x]^2}| < \left| {{\cal S}\left( x \right)} \right|$.
For a set x, let ${\cal S}\left( x \right)$ be the set of all permutations of x. We prove by the method of permutation models that the following statements are consistent with ZF:
(1) There is an infinite set x such that $|\wp \left( x \right)| < |{\cal S}\left( x \right)| < |se{q^{1 - 1}}\left( x \right)| < |seq\left( x \right)|$, where $\wp \left( x \right)$ is the power set of x, seq (x) is the set of all finite sequences of elements of x, and seq1-1 (x) is the set of all finite sequences of elements of x without repetition.
(2) There is a Dedekind infinite set x such that $|{\cal S}\left( x \right)| < |{[x]^3}|$ and such that there exists a surjection from x onto ${\cal S}\left( x \right)$.
(3) There is an infinite set x such that there is a finite-to-one function from ${\cal S}\left( x \right)$ into x.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.