Cantor’s Theorem May Fail for Finitary Partitions

Journal of Symbolic Logic:1-18 (forthcoming)
  Copy   BIBTEX

Abstract

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.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,168

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2024-04-05

Downloads
24 (#1,005,806)

6 months
5 (#853,286)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Boundedly finite-to-one functions.Xiao Hu & Guozhen Shen - forthcoming - Logic Journal of the IGPL.

Add more citations